Matching works

23 works

math.CO — Combinatorics

Schur Nonnegativity of Double-Wiring Cluster Variables

Contributed by Qiyue Tang

We prove Cuenca’s conjecture that every cluster variable of the matrix cluster algebra associated with a double wiring diagram evaluates to a Schur nonnegative symmetric function on every generalized Jacobi–Trudi matrix. The result extends to cluster monomials.

Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: some parts
Nov 15, 202610 pages
PDFView work

math.AG — Algebraic Geometry

A proof of the HLRV conjecture

Contributed by Qiyue Tang

We prove the Hausel–Letellier–Rodriguez-Villegas conjecture on the mixed Hodge polynomials of generic semisimple GLn\mathrm{GL}_n character varieties.

Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: no parts
Nov 15, 2026129 pages
PDFView work

math.AC — Commutative Algebra

Another Proof of Laurent Positivity for Generalized Cluster Algebras

Contributed by Qiyue Tang

We prove Laurent positivity in the original exchange coefficients for skew-symmetrizable Chekhov–Shapiro generalized cluster algebras of arbitrary finite rank.

Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 10, 202641 pages
PDFView work

math.CO — Combinatorics

Monomial Immanants of Totally Nonnegative Matrices

Contributed by Qiyue Tang

We prove that every monomial immanant is nonnegative on the totally nonnegative real matrices, establishing a conjecture of Stembridge. We identify the corresponding normalized symmetric function of annular holonomy with a single cluster theta function.

Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 10, 202625 pages
PDFView work

math.OC — Optimization and Control

The generalized Lax conjecture holds for mixed determinants

Contributed by Suvrit Sra

We prove that the mixed determinant η(⋅)\eta(\cdot) of Borcea and Brändén has a spectrahedral hyperbolicity cone. More precisely, for Hermitian matrices A1,…,AmA_1,\ldots,A_m of order dd, the hyperbolicity cone of η(A1,…,Am)\eta(A_1,\ldots,A_m) is cut out by ∑jΦj(Aj)⪰0\sum_j\Phi_j(A_j)\succeq0, where Φ1,…,Φm\Phi_1,\ldots,\Phi_m are explicit unital completely positive maps. We argue by induction on dd, adding one row and one column to every argument and expressing the logarithmic derivatives of η\eta as extremal eigenvalues. By compressing along polynomial boundary kernels, we reduce the order of the pencil ∑jΦj(Aj)\sum_j\Phi_j(A_j) to exp⁡(O(md3log⁡m))\exp(O(md^3\log m)); for one fixed positive semidefinite n×nn\times n matrix AA a separate pencil yields the order exp⁡(O(n2log⁡n))\exp(O(n^2\log n)). We also answer four problems of Borcea and Brändén negatively.

A mix of human-written and AI-generated textHuman understanding: some partsCompletely positive mapsJohnson's conjecturesSchur positivitygeneralized Lax conjecturehyperbolic polynomialsimmanantsmixed determinantprincipal minorsspectrahedral cones
Nov 05, 202631 pages
PDFView work

math.CO — Combinatorics

Log-concavity in the Newton basis and support of rank-two scattering coefficients

Contributed by Qiyue Tang

We prove that polynomials with nonnegative, interval-supported log-concave Newton coefficients are closed under multiplication and, for integer Newton coefficients, under D(m)↦(D(m)k)D(m)\mapsto\binom{D(m)}k for integers k≥0k\ge0. Coordinatewise Newton multiplication preserves two-variable Schur positivity. We also determine the exact positive Newton support of symmetric rank-two cluster scattering coefficients.

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 04, 202622 pages
PDFView work

math.PR — Probability

The Macdonald (q,t)(q,t)-permanent II: Probability laws and their regions of validity

Contributed by Suvrit Sra

The Macdonald (q,t)(q,t)-permanent replaces the constant cycle weight of the Vere-Jones α\alpha-permanent by (1−tk)/(1−qk)(1-t^k)/(1-q^k) for a cycle of length kk. We determine which of the probability laws built on the α\alpha-permanent survive this deformation, and where. The scalar gamma-type law survives on the whole parameter square, but the matrix law, a compound Wishart matrix, is more fragile. We prove that it exists in every dimension exactly when t∈{0,q,q2,…}t\in\{0,q,q^2,\ldots\}, and in dimension two exactly when t≤qt\le q. We conjecture that in each fixed dimension the matrix law exists exactly on the region that we show to be necessary, a qq-analogue of Gindikin's theorem.

A mix of human-written and AI-generated textHuman understanding: some partsCox processMacdonald permanentSchur measurealpha-permanentcomplete monotonicitycompound Wishart matrixinfinite divisibilityloop soupmatrix Laplace transform
Nov 02, 202627 pages
PDFView work

math.CO — Combinatorics

The Macdonald (q,t)(q,t)-permanent I: Algebra and positivity

Contributed by Suvrit Sra

We introduce the Macdonald (q,t)(q,t)-permanent, a two-parameter cycle-weighted permanent that contains the usual permanent and determinant, as well as the α\alpha-permanent of Vere-Jones, as degenerate cases. We prove a MacMahon-type master theorem for its generating function, and determine when it induces a valid kernel on tuples of vectors. Nonnegativity of the (q,t)(q,t)-permanent itself on semidefinite matrices turns out to be subtler: for t=qαt=q^\alpha nonnegativity holds exactly at the positive Wallach exponents; for a fixed qq we determine the region in rank two and for higher ranks under an additional condition, while for small qq positivity can even reach beyond the kernel region. Whether positivity forces t∈{0,q,q2,…}t\in\{0,q,q^2,\ldots\} remains an intriguing open problem.

A mix of human-written and AI-generated textHuman understanding: some partsMacMahon master theoremMacdonald permanentWallach setalpha-permanentimmanantpositive definite kerneltotal positivity
Nov 02, 202628 pages
PDFView work

math.FA — Functional Analysis

Weak positivity of Schur forms under decomposable curvature

Contributed by Suvrit Sra

Griffiths's 1969 conjecture predicts positivity of Schur forms for Griffiths-positive vector bundles. Finski reduced its weak form to a sign question for the double mixed discriminant Φn(H)\Phi_n(H) of a positive linear map. Du's rank-nine counterexample shows that Φn(H)≥0\Phi_n(H)\ge0 fails in general. We prove Φn(H)≥0\Phi_n(H)\ge0 for every decomposable map HH, a sum of a completely positive and a completely copositive map, using a quaternionic Gaussian determinant representation. Combined with Finski's incidence formula, this inequality gives weak nonnegativity of every Schur form under decomposable curvature, without splitting assumptions. Beyond the decomposable cone, nonnegativity of Φk(HV,U)\Phi_k(H_{V,U}) on every square compression is equivalent to Φn(H+S)≥0\Phi_n(H+S)\ge0 for every entanglement-breaking map SS. This class contains explicit indecomposable maps, but is nonconvex in every size n≥9n\ge9. We prove the nonconvexity by expressing Du's map as an average of four members, and the obstruction persists when all compression inequalities are strict.

A mix of human-written and AI-generated textHuman understanding: some partsBreuer-Hall mapChern formGriffiths positivitySchur formdecomposable mapentanglement-breaking mapmixed discriminantpositive linear mapquantum permanent
Nov 02, 202637 pages
PDFView work

math.CO — Combinatorics

On majorization inequalities for normalized Jack and Macdonald polynomials

Contributed by Suvrit Sra

We study the inequality Pλ(x;q,t)/Pλ(1n;q,t)≥Pμ(x;q,t)/Pμ(1n;q,t)P_\lambda(x;q,t)/P_\lambda(1^n;q,t)\geq P_\mu(x;q,t)/P_\mu(1^n;q,t) for all x∈R>0nx\in\mathbb{R}_{>0}^n whenever the partition λ\lambda majorizes μ\mu; Sra suggested it in 2015, and Chen, Khare and Sahi stated it as a conjecture in 2025. We prove the Jack case for every nn from Sun's positive Gelfand–Tsetlin integral and the Dixon–Anderson recursion. For Macdonald polynomials we prove the case n=2n=2, the covers (d)⪰(d−1,1)(d)\succeq(d-1,1) for every nn when t≤qt\leq q, and, by exact certificates, the case n=3n=3 with ∣λ∣≤8|\lambda|\leq 8. The HCIZ mechanism behind the Jack proof has no direct finite-qq analogue: at two explicit pairs (q,t)(q,t), no positive representation of the normalized ratio has a kernel multiplicative in λ\lambda, and normalizing at the principal specialization tδt^\delta instead fails the inequality.

A mix of human-written and AI-generated textHuman understanding: all partsDixon-Anderson integralHarish-Chandra-Itzykson-Zuber integralHeckman-Opdam hypergeometric functionJack polynomialsMacdonald polynomialsmajorization
Nov 02, 202620 pages
PDFView work

math.CO — Combinatorics

The qq-Foulkes problem III: On Foulkes' conjecture with a graded inner factor

Contributed by Suvrit Sra

We show that surjectivity of the canonical map Symb(SymaV)→Syma(SymbV)\mathrm{Sym}^b(\mathrm{Sym}^aV)\to\mathrm{Sym}^a(\mathrm{Sym}^bV) survives grading of the inner factor. Consequently hb[Ha]−Ha[hb]h_b[H_a]-H_a[h_b] is Schur positive whenever the canonical map is surjective, where HaH_a is the (modified) Hall--Littlewood polynomial; the same holds for (modified) Macdonald polynomials. We prove this surjectivity for b≥(a−1)2b\ge(a-1)^2, improving the known bound a(a−1)a(a-1). For Bergeron's qq-analog of Foulkes' conjecture that lets both factors be graded, we prove nonnegativity of every Schur coefficient for certain special cases. We also study the full conjecture under an expansion hypothesis on an explicit space of maps.

A mix of human-written and AI-generated textHuman understanding: some partsFoulkes conjectureFoulkes-Howe mapGaussian Newton expansionSchur positivitycoinvariant algebracurrent operatorplethysmq-Foulkes conjecture
Nov 02, 202618 pages
PDFView work

math.CO — Combinatorics

The qq-Foulkes problem II: Schur positivity with high probability

Contributed by Suvrit Sra

Bergeron's qq-analog of Foulkes' conjecture asserts that (Hb[Ha]−Ha[Hb])/(1−q)(H_b[H_a]-H_a[H_b])/(1-q) is Schur positive for a≤ba\le b, where HnH_n is the (modified) Hall--Littlewood polynomial. We view this conjecture probabilistically: on each irreducible representation of SabS_{ab}, the two plethysms induce degree distributions, and positivity means that the first is stochastically smaller than the second. We prove that, for a random (Plancherel) irreducible representation and a degree sampled from its graded multiplicity, the corresponding coefficient is negative with probability at most Cexp⁡(−c(ab)1/3)C\exp(-c(ab)^{1/3}), uniformly in a≤ba\le b. Consequently, the qq-Foulkes conjecture holds after deleting a fraction at most Cexp⁡(−c(ab)1/3)C\exp(-c(ab)^{1/3}) of each of the two graded modules. Additionally, we show that exact conditional means and variances yield complete positivity for explicit width and height families.

A mix of human-written and AI-generated textHuman understanding: some partsMacdonald polynomialPlancherel measureSchur positivityplethysmq-Foulkes conjecturestochastic order
Nov 02, 202632 pages
PDFView work

math.CO — Combinatorics

The qq-Foulkes problem I: A fusion inequality for Macdonald plethysms

Contributed by Suvrit Sra

We prove that the plethysm Hm[H~μ]H_m[\widetilde H_\mu] of a Macdonald polynomial by the Hall–Littlewood polynomial HmH_m lies above the Macdonald polynomial H~mμ\widetilde H_{m\mu} obtained by fusing mm copies of H~μ\widetilde H_\mu. More specifically, the quotient (Hm[H~μ]−H~mμ)/(1−qm)(H_m[\widetilde H_\mu]-\widetilde H_{m\mu})/(1-q^m) is Schur positive with coefficients in N[q,t]\mathbb N[q,t], and it is the character of an explicit module that we call the fusion defect. For one-row shapes the inequality places both qq-Foulkes plethysms Hb[Ha]H_b[H_a] and Ha[Hb]H_a[H_b] above the same polynomial HabH_{ab}, and comparing their two defects we obtain a distorted version of Bergeron's qq-analog of Foulkes' conjecture, in which the subtracted plethysm is shifted by qa(a−1)⌊b/2⌋q^{a(a-1)\lfloor b/2\rfloor}.

A mix of human-written and AI-generated textHuman understanding: some partsMacdonald polynomialSchur positivityfusion productplethysmq-Foulkes conjecture
Nov 02, 202620 pages
PDFView work

math.CA — Classical Analysis and ODEs

Monotonicity of Turán-ratios of symmetric polynomials

Contributed by Suvrit Sra

We study the Turán-ratio Sλ,i(x)2/(Sλ,i−1(x)Sλ,i+1(x))S_{\lambda,i}(x)^2/(S_{\lambda,i-1}(x)S_{\lambda,i+1}(x)), where Sλ,i(x):=sλ(1[n−i],x[i])S_{\lambda,i}(x):=s_\lambda(1^{[n-i]},x^{[i]}), and sλs_\lambda is the Schur polynomial in nn variables (indexed by partition λ\lambda) with ii arguments equal to xx and n−in-i of them equal to 11. Specifically, we prove that this Turán-ratio is strictly increasing for x>1x>1 and 1≤i<n1\le i<n (unless all nn padded parts of λ\lambda are equal, then it is identically one). For one-row shapes, our result answers a question of Ait-Haddou about complete homogeneous symmetric polynomials. For this case, we also offer a second proof through the zeros of Meixner polynomials that gives an explicit positive formula for the logarithmic derivative. We conclude with a Turán-ratio conjecture for Macdonald polynomials.

A mix of human-written and AI-generated textHuman understanding: all partsMeixner polynomialsSchur polynomialTuran ratiohomogeneous symmetric polynomialmonotonicity
Nov 02, 202610 pages
PDFView work

math.CA — Classical Analysis and ODEs

A Proof of McLeod's 1959 Conjecture on Complete Homogeneous Symmetric Ratios

Contributed by Suvrit Sra

We prove McLeod's (1959) conjecture that (hℓ+r/hℓ)1/r(h_{\ell+r}/h_\ell)^{1/r} is subadditive for all ℓ≥0\ell\ge0 and r≥1r\ge1, where hkh_k is the complete homogeneous symmetric polynomial of degree kk (J. B. McLeod, "On four inequalities in symmetric functions", Proc. Edinburgh Math. Soc., 1959). We first prove that the ratio hk/hk−1h_k/h_{k-1} is convex, and our proof takes an unexpected detour through queuing theory. The geometric mean of rr consecutive such ratios equals McLeod's conjectured function, but geometric means of convex functions need not be convex. Our second and decisive step is a tensorization trick that couples neighboring ratios tightly enough to make their geometric mean convex.

A mix of human-written and AI-generated textHuman understanding: all partsMcLeod inequalityclosed queuing networkcomplete homogeneous symmetric polynomialconvexitydiscrete Poincare inequality
Oct 29, 202611 pages
PDFView work

math.NT — Number Theory

Coefficient Dynamics and Consecutive Toeplitz Minors for the de Bruijn–Newman Famil

Contributed by Changxia Lin

Abstract We give a normalization-consistent coefficient formulation of the de Bruijn–Newman heat flow attached to the Riemann ξ-function. For the classical kernel Φ and the family Ht(z) = Z ∞ 0 e tu2 Φ(u) cos(zu) du, Ft(w) = Ht(i √ w) = X n≥0 qn(t)w n , we prove the exact evolution laws ∂tFt = 2F ′ t + 4wF′′ t , q(m) n (t) = (2n + 2m)! (2n)! qn+m(t). The coefficients have positive integral representations and the transformed entire function has order at most 1/2. We relate the zeros of Ft to the Pólya–frequency property of (qn(t)), derive the rectangular Jacobi–Trudi identity for the consecutive Toeplitz minors, and state carefully the strict consecutive-minor criterion needed to pass from these minors to total positivity. In particular, for this coefficient family the real-zero condition is equivalent to strict positivity of every consecutive minor Dt(n, r), not merely to nonnegativity of that selected family. This distinction avoids an invalid use of a weak version of Fekete’s criterion. We also correct the multiplicity bookkeeping for the squared-variable map and record a Chebyshev convolution identity without attributing to it an unjustified duplication of zeros. The paper proves no new unconditional upper bound for the de Bruijn–Newman constant and no proof of the Riemann hypothesis; its purpose is to provide an auditable set of exact identities and to isolate the remaining quantitative problem

Primarily human-written textHuman understanding: all partsRiemann ξ-function; de Bruijn–Newman constant; heat flow
Oct 26, 202622 pages
PDFView work

math.NT — Number Theory

Coefficient Dynamics and Consecutive Toeplitz Minors for the de Bruijn–Newman Family

Contributed by Changxia Lin, Pulin Shi

We give a normalization-consistent coefficient formulation of the de Bruijn–Newman heat flow attached to the Riemann ξ-function. For the classical kernel Φ and the family Ht(z) = Z ∞ 0 e tu2 Φ(u) cos(zu) du, Ft(w) = Ht(i √ w) = X n≥0 qn(t)w n , we prove the exact evolution laws ∂tFt = 2F ′ t + 4wF′′ t , q(m) n (t) = (2n + 2m)! (2n)! qn+m(t). The coefficients have positive integral representations and the transformed entire function has order at most 1/2. We relate the zeros of Ft to the Pólya–frequency property of (qn(t)), derive the rectangular Jacobi–Trudi identity for the consecutive Toeplitz minors, and state carefully the strict consecutive-minor criterion needed to pass from these minors to total positivity. In particular, for this coefficient family the real-zero condition is equivalent to strict positivity of every consecutive minor Dt(n, r), not merely to nonnegativity of that selected family. This distinction avoids an invalid use of a weak version of Fekete’s criterion. We also correct the multiplicity bookkeeping for the squared-variable map and record a Chebyshev convolution identity without attributing to it an unjustified duplication of zeros. The paper proves no new unconditional upper bound for the de Bruijn–Newman constant and no proof of the Riemann hypothesis; its purpose is to provide an auditable set of exact

Primarily human-written textHuman understanding: all partsRiemann ξ-function; de Bruijn–Newman
Oct 26, 202618 pages
PDFView work

math.NT — Number Theory

Convolution Smoothing in the Turán Hierarchy: The Blind Zone Extends from Order 43 to Order 61, and Empirically to Order 68

Contributed by Changxia Lin

Let Xi(t)=xi(1/2+it) be the Riemann xi-function on the critical line, Xi(t)=sum_{k>=0}(-1)^k c_k t^{2k} its even Taylor expansion, and D(n,r)=det[c_{n+i-j}]_{i,j=0}^{r-1} the associated Toeplitz minors. Writing G(z)=sum_{k>=0}c_k z^k and beta_j=-1/z_j for the zeros of G, the dual Jacobi-Trudi identity gives D(n,r)=c_0^r s_{(r^n)}(beta), the Schur function of the rectangular partition (r^n) in the alphabet beta. Positivity of D(n,r) for all n>=0 and all r>=1 is equivalent to the Riemann hypothesis (RH) by the Schoenberg-Edrei characterisation of Polya frequency sequences; for each fixed r, the inequalities D(n,r)>=0 are a necessary condition, and for r=2 they hold unconditionally. A previous paper of the author proved that every level r<=43 is blind: the minors D(n,r) stay positive even in the presence of non-real zeros. The mechanism there was the two-variable Chebyshev criterion U_k(cos theta)>0 iff (k+1)theta<pi, together with the uniform bound theta<=theta_max=2 arctan(1/(2 gamma_1)) =0.07071826... The present paper shows that the bound 43 is not the truth but an artefact of ignoring two structural features of the true alphabet. First, the evenness Xi(-t)=Xi(t) forces every zero of G to occur with multiplicity two in beta, so the relevant constituent is not U_r but the self-convolution W_r = sum_{i=0}^{r} U_i(cos theta) U_{r-i}(cos theta), with generating function sum_{r>=0} W_r z^r = 1/(1-2z cos theta + z^2)^2. We prove the identity W_r = (1/2) U'_{r+1}(cos theta) and the pole-free sign criterion of Lemma (sign), and we show that W_r>0 for all r<=61 while W_62<0: the convolution of the Chebyshev sequence against itself smooths away the sign change that occurs at U_44, pushing the threshold from 43 to 61. Secondly, the zeros on the critical line contribute a positive real sub-alphabet whose complete symmetric functions h_i(X)>0 convolve with the violating part, h_r(X union Y)=sum_{i+j=r} h_i(X) h_j(Y), pushing the threshold further. Main theorem (proved). For every r<=61 and every n=1, and regardless of whether RH is true, D(1,r)>0. Consequently the first 61 levels of the Turan hierarchy are blind on the shift-1 row. High-precision computation of the full rectangular Schur functions s_{(r^n)}(beta) on the true alphabet (truncated at N critical-line zeros) shows that the first discriminating order is r*=69 at shift n=1 and n=3, so that all orders r<=68 are blind; the value is stable under truncation (N=45,60,80 all give 69). A scaling law r* ~ 1.5 pi/theta is observed across two and a half decades of the violating offset. At shift n=2 no negative minor was found for any r<=400, suggesting a qualitatively stronger phenomenon. The number 61 is proved; the number 68 is numerical, and the Status section separates the two without ambiguity. No claim of a proof of RH is made.

Primarily human-written textHuman understanding: all partsRiemann zeta function / xi-function / Turan inequalities /
Oct 20, 202625 pages
PDFView work

math.NT — Number Theory

The Willow Transform and the Blind Zone Theorem: A Sharp Obstruction in the Turán Hierarchy for the Riemann ξ-Function

Contributed by Changxia Lin

Let Ξ(t)=ξ(1/2+it) denote the Riemann ξ-function in the critical-line parametrisation, let Ξ(t)=Σ_{k≥0}(-1)^k c_k t^{2k} be its even Taylor expansion at the origin, and let D(n,r)=det[c_{n+i-j}]_{i,j=0}^{r-1} be the associated Toeplitz minors. By the Schoenberg--Edrei characterisation of Pólya frequency sequences, positivity of D(n,r) for all n≥0 and all r≥1 is equivalent to the Riemann hypothesis (RH); for each fixed r the inequalities D(n,r)≥0 supply a necessary condition for RH, and for r=2 they were proved unconditionally by Csordas, Norfolk and Varga, so that the second level of the resulting hierarchy is not discriminating. We show that this failure of discrimination persists far beyond level 2, and we determine the range over which it does so: every level r≤43 is non-discriminating. Parametrising the zeros of the generating function G(z)=Σ_{k≥0}c_k z^k by β_j=-1/z_j, the dual Jacobi--Trudi identity yields the exact identity D(n,r)=c_0^r s_{(r^n)}(β), where s_{(r^n)} denotes the Schur function of the rectangular partition (r^n) in the alphabet β. A zero of ζ off the critical line contributes to β a conjugate pair ρ e^{±iθ} whose argument θ coincides with the vertical angle of the corresponding violating pair, whereas zeros on the critical line contribute positive real variables. For an alphabet of cardinality two we prove the closed form s_{(a,b)}(ρ e^{iθ}, ρ e^{-iθ}) = ρ^{a+b} sin((a+1-b)θ)/sin θ = ρ^{a+b} U_{a-b}(cos θ), where U_k is the Chebyshev polynomial of the second kind; the sign is therefore governed by the criterion U_k(cos θ)>0 if and only if (k+1)θ<π. Through the coproduct expansion s_λ(X⊔Y)=Σ_μ s_μ(X)s_{λ/μ}(Y), the Littlewood--Richardson expansion s_{λ/μ}=Σ_ν c^λ_{μν}s_ν of each skew factor, and the positivity of Schur functions on positive real alphabets, the sign analysis reduces to two-variable constituents. Since c^λ_{μν}>0 forces ν⊆λ=(r^n), the index k=ν_1-ν_2 of each constituent is bounded by the number of columns r and is independent of the shift n. All constituents then have the same sign, so no cancellation occurs. The same bound persists for an alphabet containing several conjugate pairs: iterating the coproduct over the pairs and using the fact that the entry 1 occurs at most once in each column of a semistandard tableau bounds every constituent index by ν_1≤r, independently of the number of pairs. This yields the following result. Blind Zone Theorem. Let the alphabet contain any number of violating pairs, each subtending a vertical angle at most θ_max, and suppose θ_max<π/(r+1). Then every minor D(n,r') with r'≤r is strictly positive, notwithstanding the presence of non-real zeros. The critical strip together with γ_1=14.134725141... forces θ≤θ_max=2 arctan(1/(2γ_1))=0.07071826... radians, whence π/θ_max=44.424...; consequently every order r≤43 is non-discriminating: for all n≥0 and all r≤43 the minor D(n,r) is positive if RH fails and non-negative if RH holds, so no minor of order r≤43 can certify either the truth or the falsity of RH. The bound is on the order r and not on the shift n; the corresponding n-based assertion is false, and the mechanism responsible is exhibited in the remarks section. The threshold is established for an arbitrary number of violating pairs; the case of several pairs is settled in the coproduct section and requires no separation condition on the moduli and no bound on the number of pairs. No claim of a proof of the Riemann hypothesis is made.

Primarily human-written textHuman understanding: all parts1 Riemann zeta function 2 xi-function 3 Turan inequalities 4 Toeplitz minors
Oct 18, 202631 pages
PDFView work

math.NT — Number Theory

The Willow Transform and the Blind Zone Theorem: A Sharp Information-Theoretic Obstruction in the Turán Hierarchy for the Riemann xi-Function

Contributed by Changxia Lin

Let Xi(t) = xi(1/2 + it) be the Riemann Xi-function, let Xi(t) = sum_{k>=0} (-1)^k c_k t^{2k} be its even Taylor expansion at the origin, and let D(n,r) = det[c_{n+i-j}] (i,j = 0..r-1) be the Toeplitz minors whose positivity for all n >= 0, r >= 1 is equivalent to the Riemann Hypothesis (RH). We prove a sharp and quantitative obstruction in the resulting hierarchy of criteria. Parametrising the zeros of G(z) = sum c_k z^k by beta_j = -1/z_j, we establish by the dual Jacobi-Trudi identity the exact identity D(n,r) = s_{(r^n)}(beta), the Schur function of the rectangular partition (r^n) in the variables beta. A zero of zeta off the critical line contributes to beta a conjugate pair rho e^{+-i theta} whose angle theta is exactly the vertical angle of the violating pair of zeros, while zeros on the critical line contribute positive real variables. For two variables we prove the closed form s_{(a,b)}(rho e^{i theta}, rho e^{-i theta}) = rho^{a+b} sin((a+1-b) theta) / sin theta = rho^{a+b} U_{a-b}(cos theta), U_k being the Chebyshev polynomial of the second kind, so that the sign is governed by the classical criterion U_k(cos theta) > 0 if and only if (k+1) theta < pi. Since a Schur function in two variables can be expanded through the coproduct s_lambda(X sqcup Y) = sum_mu s_mu(X) s_{lambda/mu}(Y), and since s_mu(X) > 0 for positive real X, positivity reduces to the two-variable factors, whose index k = a - b is bounded by the number of columns r, not by the shift n. This yields: Blind Zone Theorem. If a violating pair subtends a vertical angle theta < pi/(r+1), then every Toeplitz minor D(n,r') with r' <= r is strictly positive, notwithstanding the presence of non-real zeros. The critical strip together with gamma_1 = 14.134725141... forces theta <= theta_max = 2 arctan(1/(2 gamma_1)) = 0.07071826... rad, whence pi/theta_max = 44.424... and therefore every order r <= 43 is completely non-discriminating. We emphasise that the exponential bound is on the order r and not on the shift n; we exhibit the mechanism and show the contrary n-based bound is false. We also record the refutation of a "universal covering law" previously conjectured by the author, and a floating-point artefact that nearly produced a false refutation of the main theorem. No claim of a proof of RH is made.

A mix of human-written and AI-generated textHuman understanding: all partsChebyshev polynomialsRiemann Zeta FunctionSchur functionsToeplitz minorsTuran inequalitiesblind zonetotal positivityxi-function
Oct 16, 20263 pages
PDFView work

math.CO — Combinatorics

The Anti-Arithmetic Product of Symmetric Functions

Contributed by Darij Grinberg

The \emph{arithmetic product} ⊡\boxdot is a bilinear operation on the ring of symmetric functions over Q\mathbb Q defined by \[ p_\lambda \ \boxdot\ p_\mu = \prod_{i,j}p_{\operatorname{lcm}(\lambda_i,\mu_j)}^{\gcd(\lambda_i,\mu_j)} \] on the power-sum basis (pλ)(p_\lambda). It is known that this operation preserves the subring SymmZ\mathbf{Symm}_{\mathbb Z} of symmetric functions with integer coefficients, and is Schur-positive on pairs of Schur functions. Indeed, it corresponds to induction of representations from Sn×SmS_n \times S_m to SnmS_{nm}. In this work, we consider the \emph{anti-arithmetic product} ♢\diamondsuit, which is defined by the same formula but with gcd⁡\gcd and lcm⁡\operatorname{lcm} interchanged. We show that it, too, preserves SymmZ\mathbf{Symm}_{\mathbb Z}, even though it lacks the Schur positivity property. This was conjectured on MathOverflow in 2014. Our method is a more intricate variant of the representation-theoretical interpretation of ⊡\boxdot. The anti-arithmetic product does not correspond to an operation on actual representations; but its adjoint can still be described as a map on characters, which (as we show) is a λ\lambda-ring morphism from the character ring of SmnS_{mn} to that of Sm×SnS_m \times S_n. Now, a 1975 theorem of Boorman shows that the representation ring of SnS_n is generated by the natural permutation representation Mn=QnM_n = \mathbb Q^n as a λ\lambda-ring. Thus, the proof of integrality boils down to only computing the image of MmnM_{mn} under this adjoint, which can be done using M\"obius inversion in the representation ring. This work is aimed at readers familiar with representation rings and the representation theory of symmetric groups. No prior knowledge of λ\lambda-rings is presumed. Three self-contained proofs of Boorman's theorem are given in the appendices, two of them lifting the theorem to the noncommutative symmetric functions (or Solomon's descent algebra), recovering a result of Schocker.

A mix of human-written and AI-generated textHuman understanding: all partsSpecht modulesdescent algebralambda-ringsnoncommutative symmetric functionssymmetric functionssymmetric group representations
Oct 03, 202650 pages
PDFView work

math.CO — Combinatorics

A counterexample to ordering-independence for chromatic operators

Contributed by Darij Grinberg

We give a 1010-vertex counterexample to a conjecture of Pawlowski asserting that the characteristic polynomial of a chromatic operator associated with a forest is independent of the ordering of its edges. The two operators already have different traces of fifth powers.

Primarily AI-generated textHuman understanding: all partsGraph coloringSpecht modulessymmetric group algebra
Sep 28, 20265 pages
PDFView work

math.AC — Commutative Algebra

Splitting a Polynomial into Linear Factors after an Injective Ring Extension

Contributed by Darij Grinberg

We show that each univariate polynomial P=p0+p1X+⋯+pmXm∈R[X]P = p_0 + p_1 X + \cdots + p_m X^m \in R[X] over a commutative ring RR can be factored into linear factors over a suitable commutative ring extension SS of RR. The proof proceeds by universal construction: SS is defined as the tensor product R⊗CmBmR \otimes_{C_m} B_m, where BmB_m is the polynomial ring $\ZZ[a_1, b_1, a_2, b_2, \ldots, a_m, b_m]$, and where CmC_m is its subring generated by its ``homogenized elementary symmetric polynomials'' Er=∑I⊆[m];∣I∣=r∏i∈Iai∏i∉IbiE_r=\sum_{\substack{I\subseteq [m];\\ |I|=r}} \prod_{i\in I}a_i\prod_{i\notin I}b_i for all 0≤r≤m0 \leq r \leq m. The injectivity of the structure homomorphism R→SR \to S is deduced from a combinatorial study of the diagonal subring of BmB_m. In the process, a homogeneous variant of the Garsia--Stanton basis is constructed, and some classical properties of symmetric polynomials are recovered.

A mix of human-written and AI-generated textHuman understanding: all parts
Sep 28, 202629 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations