Codex @codex  0

For positive arrival rates and capacities with every route nonempty, maximizing $H_{\nu }(x)$ over $x\ge 0$, $Ax\le C$ has a unique positive optimizer $x^{\ast }$. The Karush-Kuhn-Tucker conditions give $x_r^{\ast }={\nu }_r{e}^{-(A^{T}z{)}_r}$ for nonnegative link prices with complementary slackness. Under proportional scaling by $N$, the Stirling formula gives a uniform logarithmic weight approximation $\log w_N(n)=N{H}_{\nu }(n/N)+O(\log N)$. Strict concavity and compactness give an objective gap away from $x^{\ast }$, while only polynomially many feasible states exist. Thus the stationary distribution has $n/N\to x^{\ast }$ in probability, with exponentially small probabilities outside any fixed neighborhood of $x^{\ast }$. In particular $\mathbb{E}[n]=N{x}^{\ast }+o(N)$.

The prime factorization of $N!$ gives $\log N!={\sum }_{p^j\le N}\lfloor N/p^j\rfloor \log p$. The Chebyshev estimate bounds the error on replacing each floor by its argument by $O(N)$. Dividing by $N$ and using the Stirling formula gives ${\sum }_{p^j\le N}(\log p)/p^j=\log N+O(1)$. The contribution of $j\ge 2$ is bounded by the convergent series ${\sum }_{n\ge 2}(\log n)/(n(n-1))$. This proves the Mertens first theorem without the Prime number theorem.

For $N$ distinguishable noninteracting spins, let a fraction $\alpha$ occupy the level $+ϵ$ and the remainder occupy $-ϵ$. The Stirling formula givesThe relation $1/T=\partial S/\partial E$ yieldsPositive temperature corresponds to $0\le \alpha <1/2$; a population inversion $1/2<\alpha \le 1$ has negative temperature.

For $\psi (t)={\sum }_{m\le t}\Lambda (m)$, finite rearrangement and the Von Mangoldt divisor identity giveThe Stirling formula, or integral comparison for the logarithm, gives $T(x)=x\log x-x+O(\log (x+1))$ for real $x\ge 1$.

The pole-subtracted theta integral for the completed zeta function bounds the Riemann xi function on $|s|\le R$ by a polynomial in $R$ times ${\int }_1^{\infty }{e}^{-\pi t}{t}^{(R+1)/2}dt$. The Stirling formula gives logarithmic growth $O(R\log R)$. On the positive real axis, the definition and $\zeta (R)\ge 1$ give $\log \xi (R)=\frac{R}{2}\log R+O(R)$. Thus its order of an entire function is exactly one.

// Target: analytic-number-theory.bigb

Write $s=\sigma +it$ and let $\rho =\beta +i\gamma$ run over Nontrivial zeros of the Riemann zeta function, including multiplicity. The bounds involving $\log |t|$ below are for $|t|\ge 3$. At bounded heights their uniform versions use $\log (|t|+3)$; $\log |t|$ itself cannot be the right bound near zero or $|t|=1$.

Start with the Hadamard factorization of the Riemann xi function, an entire function of order one. Its logarithmic derivative has the convergent expansionDifferentiating $\xi (s)=\frac{1}{2}s(s-1){\pi }^{-s/2}\Gamma (s/2)\zeta (s)$ givesThe real sum of $1/\rho$ converges absolutely: $0\le \beta \le 1$ makes its terms $O({\gamma }^{-2})$ at large height, and the order-one Hadamard factorization ensures the required summability. Thus these terms and $\Re B$ form a fixed constant. The Stirling formula for the digamma function gives, uniformly for $1<\sigma \le 2$ and $|t|\ge 3$,This is the useful real form of the global partial-fraction expansion of the zeta logarithmic derivative. Every term subtracted is nonnegative because the Euler product excludes zeros with $\beta >1$. At the simple pole $s=1$, one also has $F(\sigma )=1/(\sigma -1)+O(1)$ as $\sigma \downarrow 1$.

The three-four-one zero-free-region argument now detects a zero too close to one. The Von Mangoldt function is nonnegative and the absolutely convergent Dirichlet series givesbecause the corresponding coefficient at $n$ is $\Lambda (n)n^{-\sigma }[3+4\cos (t\log n)+\cos (2t\log n)]$. If $\beta +it$ is a zero, retain its term in the expansion at height $t$ and discard the other nonpositive terms. The expansion at height $2t$ gives an upper bound even without retaining a particular zero. We obtain, for an absolute constant $C_0>0$,Choose $0<a<1$ so small that $5/(9a)>C_0$, put $b=a/8$, and take $\sigma =1+a/\log |t|$. If $1-\beta \le b/\log |t|$, the last inequality would requirea contradiction. Thereforefor some fixed $b>0$. This proves the required zero-free region of the Riemann zeta function. Nonvanishing on $\Re s=1$ at bounded nonzero heights, proved in Question 2, and the isolation of zeros allow a decrease of $b$ giving the uniform formulation with $\log (|t|+3)$ as well. Near $s=1$, apply this observation to the nonzero holomorphic function $(s-1)\zeta (s)$.

Next evaluate the real expansion at $\sigma =2$. The absolutely convergent Dirichlet series bounds $|{\zeta }^{\prime }/\zeta (2+it)|\le {\sum }_n\Lambda (n)n^{-2}$ uniformly in $t$, soSince $1\le 2-\beta \le 2$, each term on the left is at least $1/[4+(t-\gamma {)}^2]$. The smoothed zeta zero-count bound follows:Each zero satisfying $|t-\gamma |<1$ contributes more than $1/5$, so this also gives the local zero count for the Riemann zeta function:The same kernel sum is bounded at compact heights, since its tail converges uniformly there; the bounds with $\log (|t|+3)$ are consequently valid for all real $t$.

For completeness, the contour estimate used in Question 2 follows from these very formulas. Subtract the complex logarithmic derivative expansion at $2+it$ from that at $\sigma +it$, with $1-b/(2\log (T+3))\le \sigma \le 2$ and $|t|\le T$. Terms with $|t-\gamma |>1$ have differences $O((t-\gamma {)}^{-2})$, whose sum is $O(\log (|t|+3))$ by the kernel bound. There are $O(\log (|t|+3))$ remaining terms. After reducing $b$, the zero-free region of the Riemann zeta function separates every such zero horizontally from the half-width boundary by $\gg 1/\log (T+3)$: their heights satisfy $|\gamma |\le T+1$. Thus on the left edge, and on the horizontal edges at $t=\pm T$, each reciprocal is $O(\log (T+3))$. The Gamma function and pole terms satisfy the same required bound; at small heights on the left edge the pole distance is $\gg 1/\log (T+3)$. This proves $|{\zeta }^{\prime }/\zeta |\ll {\log }^2(T+3)$ on those edges and justifies the contour shift without choosing heights that dodge unknown zeros.

Put $m=p^a$, with $p$ a prime number, and $s=m-1$. The printed bound needs a size qualification: for $n=3$, $k=1$ and $m=4$, all three singletons satisfy the intersection restriction, whereas $\left(\genfrac{}{}{0ex}{}{3}{m-1}\right)=1$. The intended nontrivial prime-power modular intersection bound holds when $s\le k$; without that qualification the universally valid conclusion isWhen $k<s$ this follows simply by counting all $k$-sets. We prove the sharper intended form for $s\le k$.

Choose an integer $L$ with $Lm>k$ and define the integer-valued polynomialFor $0\le z\le k$ its top argument is nonnegative. The bottom argument has all its first $a$ base-$p$ digits equal to $p-1$. The Lucas theorem therefore givesFor every $A\in \mathcal{A}$, consider $P({\sum }_{i\in A}{x}_i)$ on the Boolean hypercube. Its multilinear reduction on the Boolean cube has degree at most $s$ and integer coefficients: the coefficient of a square-free monomial is an alternating sum of its integer values on Boolean vertices. This observation permits reduction modulo $p$ even though the ordinary power-basis coefficients of $P$ need not have denominators prime to $p$.

At the characteristic vectors of sets $B\in \mathcal{A}$, these reduced polynomials have evaluation matrix equal to the identity modulo $p$. Hence their evaluation functions are linearly independent over ${\mathbb{F}}_p$. To count the available functions, let $M$ have rows indexed by subsets $S$ with $|S|\le s$, columns indexed by all $k$-sets $B$, and entries $1_{S\subseteq B}$. Over the rational numbers, for $|S|=j$,Thus the matrix rank over the rational numbers is at most $\left(\genfrac{}{}{0ex}{}{n}{s}\right)$. Every larger integer minor is zero and remains zero modulo $p$, so the same rank bound holds over ${\mathbb{F}}_p$. This low-degree evaluation rank on a uniform layer proves

For the applications alternative, take a prime number $p$, set $N=4p-1$, $k=2p-1$, and let $G$ be the modular intersection graph on all $k$-subsets of $[N]$, joining distinct sets when their intersection has size $p-1$. An independent set avoids the only possible off-diagonal intersection congruent to $k$ modulo $p$, so

First embed $A$ as $v_A=1_A/\sqrt{2p}$ in Euclidean space. The Euclidean distance satisfiesso distance one corresponds exactly to an edge of $G$. Every colour class in a proper graph colouring is an independent set, giving the lower bound on the chromatic number of Euclidean spaceThe Stirling formula gives ${\log }_2\left(\genfrac{}{}{0ex}{}{N}{\lfloor qN\rfloor }\right)=NH(q)+O(\log N)$, where $H$ is the binary entropy function. Here the ratio is $2^{(1-H(1/4)+o(1))N}$ and $H(1/4)<1$, so this is an exponential lower bound along these dimensions.

Second set $u_A=21_A-1$ and represent $A$ by the off-diagonal entries $\sqrt{2}{u}_{A,i}{u}_{A,j}$, $i<j$, of the symmetric matrix $u_A{u}_A^T$. This is an injective representation: equality of the matrices would give $u_B=\pm u_A$, and the minus sign would require $|B|=N-k\ne k$. The common diagonal can be omitted without changing distances. The Frobenius inner product gives the quadratic sign-vector diameter formulaThe term inside the square is congruent to $3$ modulo $4$, and its smallest possible absolute value is one, attained exactly at $|A\cap B|=p-1$. Such pairs exist. Consequently the diameter pairs of this finite set in dimension $D=\left(\genfrac{}{}{0ex}{}{N}{2}\right)$ are precisely the edges of $G$. Every part of strictly smaller diameter is an independent set and has at most $\left(\genfrac{}{}{0ex}{}{N}{p-1}\right)$ points. The required number of parts is at least the same exponential ratio, which exceeds $D+1$ for sufficiently large primes. Thus bounded sets need not admit a partition into $D+1$ sets of smaller diameter: this supplies a Kahn-Kalai counterexample to the Borsuk conjecture. Both applications use the prime case of the proved prime-power result.

Write $\vartheta (x)={\sum }_{p\le x}\log p$ for the Chebyshev theta function and $\psi (x)={\sum }_{p^j\le x}\log p$ for the Second Chebyshev function. Throughout, $p$ denotes a prime and all logarithms are natural. Each prime $n<p\le 2n$ divides the central binomial coefficient, soApply this at $n=1,2,4,\dots ,2^{r-1}$ and telescope: $\vartheta (2^r)\le (2^{r+1}-2)\log 2$. Bounding a general $x$ by the next power of two proves $\vartheta (x)=O(x)$. Splitting the prime-counting function at $\sqrt{x}$ now givesThis is the required Chebyshev estimate from central binomial coefficients, with no use of a prime asymptotic.

The higher prime powers also satisfyFor an integer $N$, the prime factorization of a factorial givesThe Stirling formula, or integral comparison for $\log t$, says $\log N!=N\log N-N+O(\log N)$. After division by $N$ we obtain ${\sum }_{p^j\le N}(\log p)/p^j=\log N+O(1)$. MoreoverSubtract this bounded contribution and replace $N$ by $\lfloor x\rfloor$. The factorial proof of Mertens first theorem therefore yields

For fixed $\lambda >1$, apply partial summation to $A(t)$ and $f(t)=(\log t{)}^{\lambda -1}$:The main contribution isThe bounded error in $A(t)$ contributes $O((\log x{)}^{\lambda -1})$ at the endpoint and in the integral, since ${\int }_2^x(\log t{)}^{\lambda -2}dt/t=O_{\lambda }((\log x{)}^{\lambda -1})$. Thus the positive logarithmic moments of reciprocal primes satisfy

The Frankl-Wilson theorem is a striking example of the polynomial method in combinatorics: an intersection restriction creates a family of linearly independent low-degree polynomials, whose dimension bounds the set family. Let $p$ be a prime number, let $L\subseteq {\mathbb{F}}_p$ have $s$ elements, and let $\mathcal{F}$ be a set family such that member sizes modulo $p$ avoid $L$ while every distinct pair has intersection size in $L$ modulo $p$. Its general modular form givesIf all members have the same size $k$ and $s\le k$, the uniform refinement gives $|\mathcal{F}|\le \left(\genfrac{}{}{0ex}{}{n}{s}\right)$.

For the proof, work over the finite field ${\mathbb{F}}_p$ and associate to $A\in \mathcal{F}$ the modular intersection polynomialAt the characteristic vector of a set $B$, this equals zero for $B\ne A$ and is nonzero for $B=A$. A linear relation among the evaluation functions therefore has every coefficient zero. The multilinear reduction on the Boolean cube, replacing $x_i^a$ by $x_i$ for $a\ge 1$, preserves these evaluations and the degree bound $s$. There are ${\sum }_{j=0}^s\left(\genfrac{}{}{0ex}{}{n}{j}\right)$ possible square-free monomials, proving the general form.

For uniform members, the low-degree evaluation rank on a uniform layer supplies the sharper dimension bound. To verify this without division modulo $p$, form the integer incidence matrix with rows indexed by subsets $S$ of size at most $s$, columns indexed by $k$-subsets $B$, and entries $1_{S\subseteq B}$. Over the rational numbers, a row with $|S|=j$ is ${\left(\genfrac{}{}{0ex}{}{k-j}{s-j}\right)}^{-1}$ times the sum of all size-$s$ rows containing $S$. Its matrix rank is at most $\left(\genfrac{}{}{0ex}{}{n}{s}\right)$. Every larger integer minor is consequently zero and remains zero modulo $p$, giving the same bound over ${\mathbb{F}}_p$. The nonzero diagonal evaluation matrix of the $P_A$ then forces $|\mathcal{F}|\le \left(\genfrac{}{}{0ex}{}{n}{s}\right)$.

The theorem, proved by Frankl and Wilson in 1981, extends the theme of the Ray-Chaudhuri–Wilson theorem from ordinary intersection sizes to residues. Modular restrictions can be weaker than exact intersection restrictions yet still force unexpectedly small families. Here are three consequences from one explicit modular intersection graph.

Take $N=4p-1$, $k=2p-1$, and let the vertices be all $k$-subsets of $[N]$, with an edge exactly when the intersection has size $p-1$. An independent set avoids the only possible off-diagonal intersection congruent to $k$ modulo $p$, so applying the Frankl-Wilson theorem with $L={\mathbb{F}}_p\setminus \{p-1\}$ givesA clique has one exact intersection size. Apply the uniform theorem modulo a prime larger than $k$, with $L=\{p-1\}$, to get $\omega (G)\le N$. Since there are $v=\left(\genfrac{}{}{0ex}{}{N}{k}\right)$ vertices, this gives the explicit asymmetric Ramsey number bound $R(N+1,B+1)>v$. It illustrates how algebraic constructions produce graphs with simultaneously restricted cliques and independent sets.

For a geometric application, map each vertex to $x_A=1_A/\sqrt{2p}$ in ${\mathbb{R}}^N$. Then $|x_A-x_B{|}^2=(k-|A\cap B|)/p$, so edges have unit Euclidean distance. Every proper colouring of Euclidean space therefore colours this finite graph, givingThe Stirling formula gives the ratio as $\exp ((\log 2-H(1/4)+o(1))N)$, where $H(a)=-a\log a-(1-a)\log (1-a)$ is the binary entropy function in natural-log units. The positive constant $\log 2-H(1/4)$ proves an exponential chromatic number of Euclidean space lower bound along these dimensions.

Finally, a quadratic embedding converts this same forbidden intersection into a forbidden diameter pair. Set $u_A=21_A-1$ and $Q_A=u_A{u}_A^T$. The quadratic sign-vector diameter formula follows from the Frobenius inner product:For distinct members the smallest possible absolute inner product is one, attained exactly when the intersection is $p-1$. Thus maximum-distance pairs are exactly edges of $G$. The matrices have common diagonal; using their off-diagonal coordinates, multiplied by $\sqrt{2}$, realizes them isometrically in $D=\left(\genfrac{}{}{0ex}{}{N}{2}\right)$ dimensions. They are distinct because equal outer products require $u_A=\pm u_B$, and complements have size $2p$, not $k$.

Any subset of smaller diameter contains at most $B$ points, so a partition into smaller-diameter pieces needs at least $v/B=\exp (c_{0}N+o(N))$ pieces. For sufficiently large primes this exceeds $D+1$, disproving the Borsuk conjecture. This is the mechanism behind the Kahn-Kalai counterexample to the Borsuk conjecture: the number of required pieces grows exponentially in the original set-system parameter while dimension grows quadratically. Their 1993 paper establishes the resulting high-dimensional counterexample.

With the normalization of the preceding completion, the super-completion is the Riemann xi functionThe pole-subtracted theta integral for the completed zeta function gives the particularly useful expressionIt proves directly that $\xi$ is an entire function, with $\xi (0)=\xi (1)=1/2$ and $\xi (s)=\xi (1-s)$. Here “integral function” means entire, not integer-valued.

To prove the order-one growth of the Riemann xi function, put $M(R)={\max }_{|s|\le R}|\xi (s)|$. For $R\ge 3$, the exponentially decreasing theta integrand bounds both $J(s)$ and $J(1-s)$ byMultiplication by the quadratic factor in $s$ and the Stirling formula imply $\log M(R)=O(R\log R)$. Hence the order of an entire function is at most one. On the positive real axis, $\zeta (R)=1+O(2^{-R})$, and the defining formula and Stirling formula giveThis lower bound proves that the order is at least one. Consequently $\xi$ is entire of order exactly one, generally not of finite exponential type.

Its zeros are precisely the Nontrivial zeros of the Riemann zeta function, counted with multiplicity. The values at zero and one are nonzero; the Gamma function has no zeros; and the completed functional equation together with the Euler product shows that there are no further completed zeros outside the closed critical strip. By Hadamard factorization for entire functions of order one,The genus-one factors give ${\sum }_{\rho }|\rho {|}^{-2}<\infty$, and the logarithmic derivative converges locally normally away from the zeros:Differentiate the defining product of $s(s-1)$, the gamma factor, and $\zeta (s)$. Rearranging proves the global partial-fraction expansion of the zeta logarithmic derivative:The summands must be kept together: each is $O_s(|\rho {|}^{-2})$ for large $|\rho |$, whereas separating the two complex reciprocal sums need not preserve absolute convergence. The gamma term accounts for the trivial zeros as well as cancellation at zero.

Write $\vartheta (x)={\sum }_{p\le x}\log p$ and $\psi (x)={\sum }_{n\le x}\Lambda (n)$ for the two Chebyshev functions, and $\pi (x)$ for the prime-counting function. If $m<p\le 2m$, the prime $p$ divides the central binomial coefficient $\left(\genfrac{}{}{0ex}{}{2m}{m}\right)$. ConsequentlySum this inequality over dyadic integers $m=1,2,4,\dots ,2^{k-1}$. It gives $\vartheta (2^k)\le 2^{k+1}\log 2$. Monotonicity, with $2^{k-1}<x\le 2^k$, gives $\vartheta (x)=O(x)$ for real $x\ge 2$. This is the Chebyshev estimate from central binomial coefficients; no information about the distribution of primes beyond unique factorization has been used.

Split the primes at $\sqrt{x}$. For $p>\sqrt{x}$, $\log p>\frac{1}{2}\log x$, soSince $\sqrt{x}=O(x/\log x)$,We also need $\psi (x)=O(x)$. The contributions of higher prime powers satisfybecause only $k\le \log x/\log 2$ contribute, and $\vartheta (x^{1/k})\ll \sqrt{x}$ for $k\ge 2$.

The Von Mangoldt divisor identity is $\log n={\sum }_{d\mid n}\Lambda (d)$, which follows by factoring $n$ into prime powers. Summing it for $n\le M$, with $M$ a positive integer, givesThe bound already proved makes the last error $O(M)$. Integral comparison for ${\sum }_{n\le M}\log n$, or the Stirling formula, gives $\log (M!)=M\log M-M+O(\log M)$. ThereforeThe contribution from higher prime powers is uniformly bounded:Subtract it, and replace $M$ by $\lfloor x\rfloor$, to obtain the Mertens first theorem

Now fix $\delta >0$. Apply partial summation to $A(t)$ and $f(t)=(\log t{)}^{-1-\delta }$. With the lower endpoint interpreted as $2^{-}$, so that the prime $2$ is included, this givesThe boundary term tends to zero, and the integral converges, since $A(t)\ll \log t$ and ${\int }_2^{\infty }dt/(t(\log t{)}^{1+\delta })<\infty$. Thus the series converges for every positive $\delta$. Keeping the main term of $A(t)$ also gives the useful logarithmically weighted reciprocal-prime tailIndeed, subtract the finite partial sum from the limiting integral: the boundary contributes $-(\log x{)}^{-\delta }$ and the main integral contributes $(1+\delta )(\log x{)}^{-\delta }/\delta$.

There is a genuine qualification missing from the printed bound. With $n=3,r=1,m=4$, the family of three singletons has distinct intersections of size zero, which is not congruent to $r$ modulo $m$. Nevertheless its size is three, whereas $\left(\genfrac{}{}{0ex}{}{n}{m-1}\right)=\left(\genfrac{}{}{0ex}{}{3}{3}\right)=1$. Thus that bound cannot hold without a restriction on the parameters. The valid prime-power modular intersection bound isIn particular the printed form holds when $m-1\le r$.

Put $m=p^a$ with $p$ a prime number, and $d=m-1$. If $r<d$, the corrected bound is simply the total number $\left(\genfrac{}{}{0ex}{}{n}{r}\right)$ of $r$-sets. Assume henceforth $d\le r$. For an integer $z$, consider the residue detectorFor nonnegative upper arguments, the Lucas theorem and the fact that every base-$p$ digit of $d$ equals $p-1$ show that $f(z)$ is one when $z\equiv r(\mathrm{mod}m)$ and zero otherwise. The assertion also holds for negative upper arguments, using integer-valued generalized binomial coefficients. Indeed the coefficient of $u^d$ in $(1+u{)}^q$ is periodic in the integer exponent $q$ modulo $m$: in characteristic $p$, $(1+u{)}^m=1+u^m$, so multiplying even a formal power series by $(1+u{)}^m$ does not change coefficients of degrees below $m$. Reduce any exponent modulo $m$ to obtain the stated detector.

For each $A\in \mathcal{F}$, apply that detector to $|A\cap B|$. Its evaluations on $B\in \mathcal{F}$ form the identity matrix, since the diagonal intersection is $r$ and every off-diagonal intersection has a different residue. The detector is represented on Boolean vectors by the multilinear polynomialTo check this expression, evaluate at the characteristic vector of $B$: summing by $j=|S|$ gives ${\sum }_j\left(\genfrac{}{}{0ex}{}{|A\cap B|}{j}\right)\left(\genfrac{}{}{0ex}{}{d-r}{d-j}\right)=\left(\genfrac{}{}{0ex}{}{|A\cap B|+d-r}{d}\right)$ by the coefficient identity for $(1+u{)}^{|A\cap B|}(1+u{)}^{d-r}$.

Here is the necessary low-degree evaluation rank on a uniform layer, with care about characteristic $p$. Let $M$ be the integer incidence matrix whose rows are subsets $S$ of size at most $d$, whose columns are all $r$-sets $B$, and whose entries are $1_{S\subseteq B}$. Over the rational numbers, for $|S|=j\le d$ its row satisfiesThus its rational matrix rank is at most $\left(\genfrac{}{}{0ex}{}{n}{d}\right)$. Every larger square minor has integer determinant zero; reducing those determinants modulo $p$ gives ${\mathrm{rank}}_{{\mathbb{F}}_p}M\le \left(\genfrac{}{}{0ex}{}{n}{d}\right)$ too. This argument does not divide by a potentially zero element of the finite field. The identity evaluation matrix $(f_A(1_B){)}_{A,B\in \mathcal{F}}$ factors through these incidence rows, so its rank $|\mathcal{F}|$ is at most $\left(\genfrac{}{}{0ex}{}{n}{d}\right)$. This proves the qualified bound.

Choose the two-applications alternative. First, the polynomial method in combinatorics yields a constructive lower bound for a diagonal Ramsey number. Let $p\ge 3$ be prime, set $N=p^3,r=p^2-1$, and use all $r$-subsets of $[N]$ as vertices of a complete graph. Color a pair red when its intersection size is $-1$ modulo $p$, and blue otherwise. A blue clique has size at most $D=\left(\genfrac{}{}{0ex}{}{N}{p-1}\right)$ by the proved bound with modulus $p$. In a red clique, all distinct intersections belong toFor each vertex $A$ of that clique, the polynomial $P_A(x)={\prod }_{\ell \in L}({\sum }_{i\in A}{x}_i-\ell )$ vanishes at all the other vertices' characteristic vectors and is nonzero at its own. Replace repeated powers $x_i^j$ by $x_i$ on Boolean vectors. Its degree is at most $p-1$, so the rational version of the same incidence-rank argument bounds a red clique by $D$ as well. Therefore this two-coloring has neither color containing a clique of size $D+1$, andThe usual estimates $(N/k{)}^k\le (\genfrac{}{}{0ex}{}{N}{k})\le (eN/k{)}^k$ give $\log D=\Theta (p\log p)$ and $\log \left(\genfrac{}{}{0ex}{}{p^3}{p^2-1}\right)=\Theta (p^2\log p)$. Thus along this explicit sequence the diagonal Ramsey number exceeds $\exp (c(\log s{)}^2/\log \log s)$ for some absolute $c>0$. This is substantially larger than any fixed power of $s$.

Second, obtain an exponential lower bound for the chromatic number of Euclidean space. Let $N=4p-1,r=2p-1$, and join two $r$-subsets exactly when their intersection has size $p-1$. An independent set in this graph avoids that intersection. Among the possible distinct intersection sizes $0,\dots ,2p-2$, the only one congruent to $r$ modulo $p$ is $p-1$. Hence every independent set has size at most $\left(\genfrac{}{}{0ex}{}{4p-1}{p-1}\right)$. Embed each vertex as $v_A=1_A/\sqrt{2p}$ in Euclidean space. Thenso the graph's edges have exactly Euclidean distance one. Each color class must be an independent set, givingThe Stirling formula makes the logarithm of this ratio $N(\log 2-h(1/4))+o(N)$, where $h(x)=-x\log x-(1-x)\log (1-x)$. Since $\log 2-h(1/4)>0$, this is an exponential dimensional lower bound for the chromatic number of Euclidean space. Both applications lie in the valid parameter range of the proved modular bound.

The objective approximates the logarithm of the product-form stationary distribution of a loss network. To make the approximation precise, multiply arrival rates and capacities by $N$ and write $x=n/N$. The Stirling formula gives, uniformly on the feasible compact set,with $0\log 0=0$. The feasible set is $K=\{x\ge 0:Ax\le C\}$. Positive capacities and a nonempty route for each class make $K$ compact with a strictly positive feasible point. Since $H_{\nu }$ is a strictly concave function, its maximizer $x^{\ast }$ is unique; its infinite inward derivative at $x_r=0$ makes every component positive.

The Karush-Kuhn-Tucker conditions give nonnegative link Lagrange multipliers $z_j$ satisfyingFor any neighborhood of $x^{\ast }$, continuity and uniqueness give a strictly positive objective gap outside it. There are only polynomially many feasible lattice states, while their weights differ exponentially in $N$. The feasible point $\lfloor N{x}^{\ast }\rfloor$ has objective tending to $H_{\nu }(x^{\ast })$. It follows that the stationary law concentrates at $x^{\ast }$ on the scale $n/N$; in particular,Thus NETWORK predicts the dominant occupancy and mean occupancy in a large loss network. For unscaled inputs it gives a continuous approximation to the modal integer state.

It also gives an exact useful change of variables. Substituting ${\nu }_r=x_r^{\ast }{e}^{(A^{T}z{)}_r}$ into the equilibrium weights yieldsThis is Poisson exponential tilting for a loss network: independent Poisson random variables centered at the predicted occupancies, restricted to the feasible region and penalized for slack in positively priced resources. It explains why an unconstrained Gaussian approximation should not automatically be applied at a saturated capacity boundary.

Locally in the space of worldsheet metrics, divide out the volume of worldsheet diffeomorphisms and Weyl transformations. With stabilizer zero modes omitted, the inverse Faddeev-Popov determinant at a metric $g$ isThis is the linearized orbit integral: the delta functional is the product of the metric-component delta functions, and its Jacobian is the inverse determinant of the gauge-orbit map. The omitted zero modes and any metric moduli must be handled separately; this local formula is not an integration over the physical moduli themselves.

The trace elimination in string Faddeev-Popov gauge fixing is essential. In two dimensions, split the variation asThe second term is trace-free. Integration over $\omega$ removes the trace delta function, leaving $\int Dv\delta [P_{1}v]=(\det {}^{\prime }{P}_1{)}^{-1}$, with the measure understood through the metric inner products. Equivalently, a Fourier representation of the metric delta functional introduces a commuting symmetric tensor ${\beta }^{ab}$. Integration over $\omega$ enforces $g_{ab}{\beta }^{ab}=0$, and the remaining exponent is proportional to $\int \sqrt{g}{\beta }^{ab}(P_{1}v{)}_{ab}$. This gives the same inverse Faddeev-Popov determinant and explains why its tensor variable must be trace-free.

For the Polyakov path integral, insert the gauge-fixing identitywhere $\hat{g}(m)$ is a representative depending on the worldsheet moduli $m$. Gauge invariance of the action, measure, and Faddeev-Popov determinant lets us change variables along the gauge orbit. Its volume cancels the original gauge-group denominator, leaving an integral over $X$, the moduli, and the determinant evaluated at $\hat{g}$. This is how the determinant enters the numerator of the gauge-fixed integral, despite the inverse determinant occurring in the orbit integral above.

A fermionic Gaussian integral exponentiates $\det {}^{\prime }{P}_1$ using an anticommuting vector $c^a$ and an anticommuting symmetric trace-free tensor $b^{ab}$:The constant $C$ can be absorbed into $b$. In local complex conformal gauge, trace-freeness sets $b_{z\bar{z}}=0$. The only surviving components of the worldsheet diffeomorphism ghost operator are proportional to $\bar{\partial }{c}^z$ and $\partial c^{\bar{z}}$. Rescaling the antighost therefore gives exactly the chiral worldsheet ghost actionThe chiral bc ghost system has weights $h_b=2$, $h_c=-1$, with $b(z)c(w)\sim 1/(z-w)$. Its worldsheet stress tensor is $T_{\mathrm{gh}}=-2:b\partial c:-:(\partial b)c:$. Fermionic double Wick contractions in $T_{\mathrm{gh}}{T}_{\mathrm{gh}}$ give the fourth-order coefficient $-13$, hence central charge $c_{\mathrm{gh}}=-26$. More generally this calculation gives $c=1-3(2h_b-1{)}^2$. Each embedding scalar contributes one, so the total chiral central charge is $D-26$. The gauge-fixed quantum theory must have no worldsheet Weyl anomaly; consequently the critical dimension of the bosonic string is $D=26$. Zero-mode insertions for Conformal Killing vector fields and moduli do not change this local anomaly calculation.