Browse

Rings and Algebras

math.RA — Rings and Algebras

math.RA RSS feed

Works in math.RA

69 works

math.GR — Group Theory

Which groups are automorphism groups of racks?

Contributed by G. Militaru

Every group is the automorphism group of a graph, of a magma, and even of a set-theoretic solution of the Yang-Baxter equation. We show that this fails for racks and quandles: the quaternion group of order eight is not the automorphism group of any rack, and it is the smallest group with this property. More generally, generalized quaternion groups and Hamiltonian groups are never automorphism groups of racks, and a dicyclic group is the automorphism group of a rack if and only if its order is not divisible by eight. On the positive side, dihedral, alternating and all finite abelian groups are automorphism groups of finite quandles.

Author comments: 19 pages + references. Comments are welcome.

A mix of human-written and AI-generated textHuman understanding: all partsHamiltonian groupautomorphism groupdicyclic groupquandlerackrepresentation problemset-theoretic Yang--Baxter equationuniversal categories
Nov 16, 202622 pages
PDFView work

math.RA — Rings and Algebras

Improving Razmyslov's (1974) bound: the Nagata–Higman index is at most n² − 2 for n ≥ 3

Contributed by Dave Goel

Let d(n)d(n) be the least mm such that every associative (not necessarily unital) algebra over a field of characteristic zero satisfying the identity xn=0x^n=0 also satisfies x1x2⋯xm=0x_1x_2\cdots x_m=0; this is the Nagata–Higman index. Razmyslov proved d(n)≤n2d(n)\le n^2 in 1974; Kuzmin proved d(n)≥n(n+1)/2d(n)\ge n(n+1)/2 and conjectured equality; this is the Kuzmin (1975) conjecture. We prove d(n)≤n2−2d(n)\le n^2-2 for n≥3n\ge3 (and, by a simpler case of the same method, d(n)≤n2−1d(n)\le n^2-1 for n≥2n\ge2); in particular d(6)≤34d(6)\le34. To our knowledge, n=6n=6 is the first case in which the new bound improves the known bounds, and this is the first improvement of Razmyslov's bound for general nn. For m=n2−1m=n^2-1 and m=n2−2m=n^2-2, Formanek's criterion reduces d(n)≤md(n)\le m to the statement that no nonzero linear combination of (m+1)(m+1)-cycles lies in one particular isotypic block of the group algebra of Sm+1S_{m+1}. For m=n2−1m=n^2-1 this statement follows from the branching rule; for m=n2−2m=n^2-2 we prove it using the Jucys–Murphy elements and a theorem of Frobenius on the characters of the alternating group. These bounds have also been proved in the Lean proof assistant.

Author comments: First version: October 28, 2026. The expanded version of this paper, "Improving Razmyslov's (1974) bound: the Nagata–Higman index is at most n² − 2 for n ≥ 3, and other miscellanea", is at https://doi.org/10.5281/zenodo.23624549 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsKuzmin's conjectureNagata-Higman theoremnil algebrasnilpotency indexpolynomial identitiessymmetric group
Nov 16, 202614 pages
PDFView work

math.QA — Quantum Algebra

Solutions of the set-theoretic quantum Yang--Baxter equation arising from posets

Contributed by G. Militaru

We extend Victoria Lebed’s construction of idempotent solutions of the braid equation by introducing four families of solutions associated with posets. We show that every group can be realized as the automorphism group of such a solution, and establish a classification of solutions that either preserve or interchange the components of each pair. We also characterize when two solutions arising from posets are isomorphic. Finally, for finite posets, we construct two families of involutive solutions whose automorphism groups are explicitly described in terms of the automorphisms and anti-automorphisms of the underlying posets.

A mix of human-written and AI-generated textHuman understanding: all partsYang–Baxter equationposet
Nov 15, 202619 pages
PDFView work

math.RA — Rings and Algebras

Local optimality of rank-47 schemes for 4×4 matrix multiplication over F2

Contributed by Tejasvi Singh Tomar

The tensor ⟨4,4,4⟩\langle 4,4,4\rangle of 4×44\times4 matrix multiplication has rank at most 47 over F2\mathbb{F}_2, and as it is not known whether 47 is optimal, we ask how far the known decompositions of rank 47 are from one of rank 46. A decomposition is locally optimal to depth DD if no DD or fewer of its rank-one terms can be replaced by fewer rank-one terms. We prove that five pairwise inequivalent decompositions of rank 47 over F2\mathbb{F}_2 are locally optimal to depth 18, as is every decomposition equivalent to one of them, so a decomposition of rank 46 over F2\mathbb{F}_2 shares at most 28 terms with any decomposition in these five classes. The five classes include the scheme of Fawzi et al. and every public decomposition of rank 47 over F2\mathbb{F}_2 known to us; one of them, found in our flip-graph searches, is new. The proof rests on a peeling lemma and, for four sets of terms that resist the other bounds, on a refinement of the substitution method, which we call substitution over subspaces with lifting. Local optimality to depth 18 is also proved in Lean 4.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23721965

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

math.RA — Rings and Algebras

The rank of 4×4 matrix multiplication over F2 is at least 35

Contributed by Tejasvi Singh Tomar

We prove that the rank of the 4×44\times4 matrix multiplication tensor over F2\mathbb{F}_2 is at least 3535; the previous lower bound was 3434. The bound follows by substitution from RF2(⟨3,3,4⟩)≥27\mathrm{R}_{\mathbb{F}_2}(\langle 3,3,4\rangle)\ge27, which also gives RF2(⟨3,4,4⟩)≥31\mathrm{R}_{\mathbb{F}_2}(\langle 3,4,4\rangle)\ge31. Each of the three bounds is one more than what follows from RF2(⟨3,3,3⟩)=23\mathrm{R}_{\mathbb{F}_2}(\langle 3,3,3\rangle)=23. A flattening argument reduces the bound for ⟨3,3,4⟩\langle 3,3,4\rangle to lower bounds for two quotients of the tensor, by the span of a matrix of rank two and by the span of a matrix of rank three. These come from exhaustive searches over the possible patterns of a short decomposition, pruned by lower bounds for quotients by larger subspaces. The whole argument, including every step of the searches, is checked in the proof assistant Lean 4, with one compiled evaluation of a verified certificate checker.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23749576

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 12, 202611 pages
PDFView work

math.MG — Metric Geometry

On the local geometry of the tight 39-point code in the octonionic projective plane

Contributed by Robert R. MacGregor

Cohn, Kumar and Minton constructed a four-parameter family of tight 3939-point codes in the octonionic projective plane. We show that near each member outside a closed nowhere-dense set of resonant parameters, the labeled tight codes modulo F4F_4 form exactly four ten-dimensional families, any two meeting in the four-parameter family, although the first-order deformations of the member form a 2828-dimensional space modulo F4F_4. The originally constructed code is resonant, and we do not determine the tight codes near it; but every neighborhood of it in the space of unlabeled tight 3939-point codes modulo F4F_4 contains a nonempty open subset homeomorphic to an open subset of R10\mathbb R^{10}, so any neighborhood of it that is a manifold has dimension ten.

Author comments: 55 pages, 5 figures. Ancillary files: anc/native-data.json holds the exact coefficients of Appendix C, and anc/finite-identities.py replays the finite identities of Proposition 6.5 from it in exact arithmetic. Lean source: https://github.com/macgregor-sudo/tight-39-code at commit 46f01c1.

Primarily AI-generated textHuman understanding: no partsAlbert algebraF4Leandeformationmutually unbiased basesoctonionic projective planetight code
Nov 12, 202655 pages
PDFView work

math.CO — Combinatorics

Positivity for Weighted Linear Laurent Phenomenon Algebras

Contributed by Qiyue Tang

We prove Laurent positivity for ordinary Laurent phenomenon algebras whose initial exchange polynomials are nonconstant affine linear polynomials with positive constant terms and nonnegative numerical coefficients.

Author comments: By posting this manuscript on this platform, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in preparing a finished account or checking the arguments; the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: some parts
Nov 11, 202644 pages
PDFView work

math.CO — Combinatorics

Positive bases and polytopes for Laurent phenomenon algebras

Contributed by Qiyue Tang

We prove that the cluster monomials of every graph Laurent phenomenon algebra form an atomic positive basis. For every finite normalized Laurent phenomenon algebra over a unique factorization domain, we construct a simple lattice polytope with unimodular normal fan whose polar realizes the cluster complex. We also prove that cluster monomials form a basis of the upper algebra in the finite case. In particular, every linear Laurent phenomenon algebra admits such a polyhedral realization.

Author comments: By posting this manuscript on this platform, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in preparing a finished account or checking the arguments; the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: some parts
Nov 11, 202626 pages
PDFView work

math.RA — Rings and Algebras

A Counterexample to the Subtraction-Free Conjecture for Bounded Ratios of Minors

Contributed by Qiyue Tang

We disprove the subtraction-free conjecture of Boocher and Froehle for bounded ratios of minors of totally positive matrices. We construct products (P,M,Q) of ordinary minors of a matrix of order (3207) such that [ 0<\frac{P}{MQ}\leq\frac1{64} ] throughout the totally positive locus, whereas (MQ-P) has a coefficient equal to (-1) in the standard bidiagonal parameters.

Primarily AI-generated textHuman understanding: some parts
Nov 11, 202616 pages
PDFView work

math.QA — Quantum Algebra

Prime factors of fusion-category dimensions: weak group-theoreticity, rank and decomposition

Contributed by Sebastian Burciu, Jingcheng Dong, Sebastien Palcoux

Let DD be the Frobenius–Perron dimension of a weakly integral fusion category and Q(D)Q(D) its square-full part. For a divisor-minimal braided obstruction to weak group-theoreticity, we bound the conductors of character fields by formal codegrees and relate residue blocks to primary twists through local Weyl operators. For primes p<q<r<sp<q<r<s these restrictions give weak group-theoreticity whenever Q(D)Q(D) divides p5qarbp^5q^ar^b or p3q3rasbp^3q^3r^as^b, with a,ba,b arbitrary. Fixing the cofactor of a prime power gives a finite test even when its exponent is unrestricted. A braided category is weakly group-theoretical for Q(D)<29 160 000Q(D)<29\,160\,000 and solvable for odd Q(D)<6 087 156 075Q(D)<6\,087\,156\,075. The corresponding bounds without a braiding are D<5400D<5400 and odd D<121 275D<121\,275. Combining the dimension families with an exhaustive degree search gives rank at least 3232 for a non-pointed simple integral modular category, at least 3333 in nonsquare dimension, 5757 in odd dimension and 7575 in odd nonsquare dimension. We also obtain rank bounds without simplicity and prime-divisor criteria for a braided product decomposition.

Author comments: Strengthened the general rank bound to 32, incorporating the optimized degree search with dimension-family pruning. Unified verification code and certificates through rank 31, refreshed the manuscript–GitHub links, and preserved the 252-page length.

Primarily AI-generated textHuman understanding: some partsFusion categoriesmodular categoriesweak group-theoreticity
Nov 10, 2026252 pages
PDFView work

math.RA — Rings and Algebras

Actual images and local fibers in the second commutator layer

Contributed by Shengyong Pan

Let KK be an algebraically closed field of characteristic zero and let JJ be the commutator ideal of the free associative algebra. We prove that, for every proper multilinear polynomial f∈J2∖J3f\in J^2\setminus J^3 and every n≥3n\ge3, the set of values of ff on Mn(K)M_n(K) is sln(K)\mathfrak{sl}_n(K) if $\tr f\equiv0$, and Mn(K)M_n(K) otherwise. In the first case the evaluation map is smooth at an input with nonzero rank-one square-zero value. In the second case it is flat at such an input, with a local complete-intersection fiber of the expected dimension. The theorem allows arbitrary proper multilinear corrections of the same degree in J3J^3. We use restrictions to two active variables with commuting passive inputs and detect the first nonzero trace term on the exact fiber of the traceless projection.

Primarily human-written textHuman understanding: all parts
Nov 10, 202649 pages
PDFView work

math.RA — Rings and Algebras

A family of finite dimensional Hopf algebras over C\mathbb{C} with varying algebra structure

Contributed by Pavel I Etingof

We construct an algebraic one-parameter family of complex Hopf algebras of dimension 10241024, with fixed coalgebra, whose underlying associative algebras vary in a continuous family of isomorphism classes. Four multiplication lines in the second radical layer of a distinguished block recover the jj-invariant of the elliptic curve given by the equation y2=x(x−1)(x−t2).y^2=x(x-1)(x-t^2). This answers negatively the finiteness question of Etingof and Gelaki concerning algebra types of Hopf algebras of fixed dimension.

Primarily AI-generated textHuman understanding: some parts
Nov 10, 20268 pages
PDFView work

math.RA — Rings and Algebras

Spectrally Simple Spectra without Irreducible Nonnegative Realizations

Contributed by Yair Lavi

We give a counterexample to a conjecture of Johnson, Marijuán, and Pisonero: we show that the spectrum {1,1/2,±i/3}\{1,1/2,\pm i/\sqrt3\} is realizable and spectrally simple, but has no irreducible nonnegative realization. More generally, we prove their nonexistence conjecture for an order-four boundary family.

A mix of human-written and AI-generated textHuman understanding: all partsIrreducible matricesIrreducible realizationNonnegative inverse eigenvalue problemPerron rootSpectrally simple spectrumnonnegative matrices
Nov 10, 20265 pages
PDFView work

math.RA — Rings and Algebras

A Zariski-Open Family of Proper Septic Polynomials with Full Traceless Images

Contributed by Y. T. Miah

Let KK be an algebraically closed field of characteristic zero. We identify a 762762-dimensional space of proper multilinear degree-seven polynomials in the third power of the commutator ideal, with zero formal cyclic trace and annihilated by every repeated-input identification of type (3,3,1)(3,3,1). A nonempty Zariski-open subset of this space consists of polynomials pp whose sets of individual matrix values satisfy p(Mn(K)7)=sln(K)p(M_n(K)^7)=\mathfrak{sl}_n(K) for every n≥3n\geq3. The ambient proper and formal trace-zero spaces have dimensions 12601260 and 10491049, respectively. An explicit polynomial certifies nonemptiness of this coefficient-open family. The proof combines a symmetric-group decomposition, exact finite determinant witnesses, an additive-size argument and a separate 3×33\times3 matrix argument.

A mix of human-written and AI-generated textHuman understanding: some partsL'vov–Kaplansky problemcommutator idealsmatrix Jacobiansmultilinear polynomial imagesnoncommutative algebrarepeated-input kernels
Nov 10, 202612 pages
PDFView work

math.RA — Rings and Algebras

Images of Multilinear Polynomials with a Standard-Polynomial Unit Specialization

Contributed by Y. T. Miah

For r=3,4,5r=3,4,5, consider an ordinary multilinear polynomial f(Y,X1,…,X2r)f(Y,X_1,\ldots,X_{2r}) whose specialization at Y=IY=I is a nonzero scalar multiple of the standard polynomial s2rs_{2r}. Over an algebraically closed field KK of characteristic zero, we prove that for every n≥r+1n\ge r+1 the set of its individual values on Mn(K)M_n(K) is sln(K)\mathfrak{sl}n(K) if its trace vanishes identically, and Mn(K)M_n(K) otherwise. This includes arbitrary proper perturbations of s7,s9,s11s_7,s_9,s{11}. The proof combines exact standard-polynomial core constructions, additive size transfer, and a mixed-frame compatibility lemma with a local lifting criterion of Pan.

A mix of human-written and AI-generated textHuman understanding: some partsL'vov–Kaplansky conjecturematrix algebrasmultilinear polynomialsnoncommutative algebrapolynomial imagesstandard polynomials
Nov 10, 20269 pages
PDFView work

math.RA — Rings and Algebras

The L’vov–Kaplansky Conjecture for Matrices of Sufficiently Large Order

Contributed by Qiyue Tang

For each positive degree, the L’vov–Kaplansky conjecture holds over arbitrary fields in all matrix sizes beyond a threshold depending only on the degree. In these sizes the image of a nonzero multilinear polynomial is the traceless subspace if every cyclic coefficient sum vanishes, and the full matrix algebra otherwise.

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, 202633 pages
PDFView work

math.CO — Combinatorics

Complex and real counterexamples to an inequality arising from Drury's conjecture

Contributed by Yair Lavi

We give counterexamples to the following inequality, stated by Zhang as a consequence of Drury's 2016 permanent conjecture: if A=(ajk)j,k=1nA=(a_{jk})_{j,k=1}^n is a Hermitian positive semidefinite matrix of order n≥2n\geq2, then ∑j=1n−1∣ajn∣2per⁡A[ ȷ^,n^ ]≤per⁡A \sum_{j=1}^{n-1}|a_{jn}|^2\operatorname{per} A[\,\hat{\jmath},\hat{n}\,]\leq\operatorname{per} A where A[ ȷ^,n^ ]A[\,\hat{\jmath},\hat{n}\,] is the principal submatrix obtained by deleting indices jj and nn. Our complex example has order twelve and rank two; our real example has order twenty-one and rank three.

A mix of human-written and AI-generated textHuman understanding: all partsDrury's permanent conjectureMatrix inequalityPositive semidefinite matrixcounterexamplepermanent
Nov 10, 202610 pages
PDFView work

math.CO — Combinatorics

A Dittert-like inequality for homogeneous stable polynomials

Contributed by Yair Lavi

We prove a coefficient inequality for every homogeneous real stable polynomial P(s,x1,…,xn)P(s,x_1,\ldots,x_n) of degree n≥1n\ge1 with nonnegative coefficients. If P(1,0,…,0)=1P(1,0,\ldots,0)=1, ri=∂xiP(1,0,…,0)r_i=\partial_{x_i}P(1,0,\ldots,0), and ∑iri=n\sum_i r_i=n, the following inequality holds, where brackets denote coefficient extraction: [x1⋯xn]P(0,x1,…,xn)+2−∏iri−P(0,1,…,1)≥n!nn[x_1\cdots x_n]P(0,x_1,\ldots,x_n)+2-\prod_i r_i-P(0,1,\ldots,1)\ge \frac{n!}{n^n}. Equality holds exactly for P=(s+∑ixi/n)nP=(s+\sum_i x_i/n)^n. The normalizations can be removed by rescaling PP and the xix_i. We give applications to permanents, mixed discriminants, subpermanents, and stable combinatorial measures. In particular, the theorem gives an independent proof of Dittert's conjecture for nonnegative matrices in every dimension.

A mix of human-written and AI-generated textHuman understanding: all partsDittert conjectureMixed discriminantsReal stable polynomialspermanents
Nov 10, 202625 pages
PDFView work

math.RA — Rings and Algebras

The L’vov–Kaplansky conjecture in degrees three and four over arbitrary fields

Contributed by Qiyue Tang

We prove that for every field (K) and every positive integer (n), the image of each multilinear noncommutative polynomial of degree three or four on (M_n(K)) is a (K)-linear subspace.

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, 202659 pages
PDFView work

math.RT — Representation Theory

Self-injective dimensions under stable equivalences of Morita type

Contributed by Qiyue Tang

Stable equivalences of Morita type preserve the left and right self-injective dimensions of Artin algebras. The defining tensor functors can send injective modules to noninjective modules.

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, 20264 pages
PDFView work

math.CO — Combinatorics

Counterexamples to Source–Sink Recursions for Denominator Vectors

Contributed by Qiyue Tang

Reading and Stella’s source–sink recursions for denominator vectors, Conjectures 2.7 and 2.8, fail for an infinite family of four-vertex exchange matrices. The member realized by an unpunctured annulus with one marked point on one boundary and three on the other also refutes their Theorem 2.11.

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 07, 20265 pages
PDFView work

math.RA — Rings and Algebras

The L’vov–Kaplansky Conjecture for Standard Polynomials

Contributed by Y. T. Miah

The L'vov–Kaplansky conjecture asks whether the image of a multilinear polynomial on a full matrix algebra is a vector subspace. For the unnormalized standard polynomial sds_d over an algebraically closed field KK of characteristic zero, the sets of individual matrix values are determined in every degree and order. The image of s2r−1s_{2r-1} is zero when n<rn<r and all of Mn(K)M_n(K) when n≥rn\ge r; the image of s2rs_{2r} is zero when n≤rn\le r and sln(K)\mathfrak{sl}_n(K) when n≥r+1n\ge r+1. The odd-degree proof uses explicit linear slices and Jordan forms. The even-degree argument combines a uniform nilpotent construction and an additive transfer for admissible cores with generic-nullity results of Brassil–Reichstein and Lin–Tang–Zhao, extending a method of Qiyue Tang to obtain actual polynomial values.

A mix of human-written and AI-generated textHuman understanding: some partsL'vov–Kaplansky conjecturematrix algebrasmultilinear polynomialsnoncommutative algebrapolynomial identitiesstandard polynomials
Nov 07, 202630 pages
PDFView work

math.RA — Rings and Algebras

The Lu–Wenzel Conjecture

Contributed by Qiyue Tang

We prove the Lu–Wenzel conjecture for real and complex matrices.

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 07, 202614 pages
PDFView work

math.RT — Representation Theory

Disproof of Xi’s conjecture on the representation dimension of idempotent corners

Contributed by Qiyue Tang

We disprove Xi’s conjecture on the representation dimension of idempotent corners. Over every field and for each integer (L\ge3), we construct an algebra of representation dimension (L+1) with a corner of representation dimension (2L-1).

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 07, 202619 pages
PDFView work

math.RA — Rings and Algebras

The L'vov--Kaplansky conjecture for multilinear polynomials of degrees four to six

Contributed by Shengyong Pan

Let KK be an algebraically closed field of characteristic zero. We determine the images of ordinary multilinear polynomials of degrees four, five and six on matrix algebras. For n≥3n\geq3, a nonidentity has image sln(K)\mathfrak{sl}_n(K) when its cyclic class is zero and Mn(K)M_n(K) otherwise. In these degrees the only nonzero identity exception is the standard degree-six line on M3(K)M_3(K). The proof starts with proper sextics and treats arbitrary sextics by unit restrictions and local trace lifting. An image-preserving product substitution then gives degrees four and five as consequences. We also give cyclic and matrix lifting results applicable in arbitrary degree. The finite calculations are given by explicit matrix-unit identities.

Primarily human-written textHuman understanding: all parts
Nov 07, 202696 pages
PDFView work

math.CO — Combinatorics

Foregger's Conjecture on Minimum Permanents of Nearly Decomposable Doubly Stochastic Matrices

Contributed by Yair Lavi

We prove Foregger's conjecture: every nearly decomposable doubly stochastic matrix AA of order n≥2n\ge2 satisfies per⁡A≥21−n\operatorname{per}A\ge 2^{1-n}. Equality holds exactly for matrices obtained from 12(In+Pn)\tfrac12(I_n+P_n) by independent row and column permutations, where PnP_n is a single-cycle permutation matrix. In fact, for every fixed nearly decomposable support whose bipartite graph is not a single cycle, the minimum permanent on its closed doubly stochastic face is strictly larger than 21−n2^{1-n}.

Author comments: Version 2 adds citations to T. Maciejewski, "Foregger's Permanent Conjecture, Part IV" (Zenodo preprint, 2 June 2026, doi:10.5281/zenodo.20510494), in the introduction, after (3.7) and after Lemma 5.1. The results and proofs are unchanged.

A mix of human-written and AI-generated textHuman understanding: all partsForegger conjectureNearly decomposable matricesTight cutsdoubly stochastic matricespermanents
Nov 07, 202617 pages
PDFView work

math.RA — Rings and Algebras

The L'vov–Kaplansky conjecture for polynomials of degree four

Contributed by Qiyue Tang

We prove the L'vov–Kaplansky conjecture for multilinear polynomials of degree four over algebraically closed fields of characteristic zero.

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 partsL'vov–Kaplansky conjecture
Nov 05, 202628 pages
PDFView work

math.LO — Logic

Inertia and Elementary Theories of Hermitian Nilpotent Operators

Contributed by Zhenyu Sun, Jilin Wang

Let VV be a finite-dimensional Hermitian space over an algebraically closed field with a nonidentity involution, and suppose its form hh is nondegenerate. For a self-adjoint nilpotent operator NN, we recover the multiplicity of each signed Jordan block from finite differences of the ranks and signature differences of the forms h(x,Njy)h(x,N^j y). On a fixed Hermitian space these inertias classify unitary conjugacy. Across scalar fields they classify elementary equivalence in the four-sorted language of scalars, vectors, endomorphisms, and projective points with NN named. At fixed dimension each admissible inertia sequence isolates a complete theory. These theories are model complete and decidable, and none has the independence property. A bivariate generating function counts them by ambient signature. For two self-adjoint square-zero operators with a common image of fixed positive dimension and positive definite quotient forms, simultaneous unitary conjugacy on a fixed Hermitian space is classified by the ordered generalized eigenvalues. The associated Hermitian pencil recovers these eigenvalues even when all operator words have constant ranks and inertias. At fixed signature and rank the family theory is model complete and decidable. Its completions correspond to the ordered-field types of the spectrum, and each completion has the Turing degree of its type. We also characterize the Witt index by square-zero ranks over arbitrary fields with involution. For positive definite spaces we prove that finite-measurement sentences at fixed dimensions and outcome count have the same truth value over R(−1)R(\sqrt{-1}) as over C\mathbb C for every real closed field RR. The least Naimark dilation dimension of a measurement is the sum of its effect ranks.

Primarily human-written textHuman understanding: some partsHermitian forminertiamodel completenessquantum measurementreal closed fieldself-adjoint nilpotent operator
Nov 04, 202626 pages
PDFView work

math.RA — Rings and Algebras

Cartan determinants for almost laura, quasi-laura, semilinear clannish and piecewise Bäckström algebras

Contributed by Qiyue Tang

We prove the Cartan determinant conjecture for corners of finite global dimension in almost laura, quasi-laura and (m)-quasi-laura Artin algebras, finite-dimensional piecewise Bäckström algebras, and semilinear clannish Artin algebras of finite dimension over their defining division ring.

A mix of human-written and AI-generated textHuman understanding: some partsCartan determinant conjecture
Nov 04, 202618 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.RA — Rings and Algebras

A Koteljanskii inequality for permanents

Contributed by Suvrit Sra

We prove a permanental analogue of Koteljanskii's inequality. If AA is an inverse MM-matrix that becomes symmetric after a positive diagonal similarity, then per(AS∪T) per(AS∩T)≥per(AS) per(AT)\mathrm{per}(A_{S\cup T})\,\mathrm{per}(A_{S\cap T})\ge\mathrm{per}(A_S)\,\mathrm{per}(A_T) for all S,T⊆[n]S,T\subseteq[n], where ASA_S is the principal submatrix indexed by SS. The proof expresses permanents as moments of a complex Gaussian vector and uses Ginibre's correlation inequality. Finally, an explicit counterexample shows that symmetry cannot be dropped.

A mix of human-written and AI-generated textHuman understanding: all partsFKG inequalityKoteljanskii inequalityM-matricescomplex Gaussianspermanents
Nov 02, 20269 pages
PDFView work

math.CO — Combinatorics

Asymptotic growth of rank-two scattering coefficients in the Badlands

Contributed by Qiyue Tang

We prove that the normalized logarithmic growth rate of ordinary wall-function coefficients in every wild rank-two cluster scattering diagram exists along all integer approaches to an interior Badlands slope and is continuous in that slope. This resolves Conjecture 9.2 of Burcroff, Lee, Mou, Musiker, and Reineke.

A mix of human-written and AI-generated textHuman understanding: some partsCluster Algebra
Oct 29, 202617 pages
PDFView work

math.CO — Combinatorics

A Spectral Blakley–Roy Inequality for Nonnegative Matrices

Contributed by Suvrit Sra

Let AA and BB be real symmetric matrices with nonnegative entries. We prove that ρ(AB)k≤ρ(AkBk)\rho(AB)^k\le\rho(A^kB^k) for the spectral radius ρ(⋅)\rho(\cdot) and every integer k≥1k\ge1; for B=uuTB=uu^T this is the Blakley–Roy inequality. We prove it via the more general inequality ∥(AB)m∥k≤∥(AkBk)m∥\|(AB)^m\|^{k}\le\|(A^kB^k)^m\| in the spectral norm, valid for all integers k,m≥1k,m\ge1. The even exponents case follows from standard tools; for odd exponents k=2r+1k=2r+1 the claim follows via the more general product inequality (uTC1⋯Ctv)k≤(uTu)r(vTv)r uTC1k⋯Ctkv(u^TC_1\cdots C_tv)^k\le(u^Tu)^r(v^Tv)^r\,u^TC_1^k\cdots C_t^kv for nonnegative symmetric CiC_i and nonnegative u,vu,v. Its proof is an entropy argument on paths that traverse each edge kk times, back and forth.

A mix of human-written and AI-generated textHuman understanding: all partsBlakley-Roy inequalitymatrix productsnonnegative matricesspectral radius
Oct 29, 202610 pages
PDFView work

math.FA — Functional Analysis

On Lin's Arithmetic–Geometric Means Conjecture for Singular Values

Contributed by Suvrit Sra

Let AA and BB be positive semidefinite, and let 0≤t≤10\le t\le 1. Lin (2017) conjectured that λj((1−t)A+tB)≥σj1/2(A2(1−t)B2t)\lambda_j((1-t)A+tB)\ge\sigma_j^{1/2}(A^{2(1-t)}B^{2t}) for j=1,…,nj=1,\ldots,n. The case t=1/2t=1/2 is Drury's theorem, which answered a long-standing question of Bhatia and Kittaneh. Lin remarked that Drury's method does not seem to reach other values of tt. We prove his conjecture for every t∈[0,1]t\in[0,1]. The proof builds on Drury's argument, but replaces his block-matrix step (unique to the midpoint t=1/2t=1/2) by an eigenvalue count based on an inertia identity and a one-variable inequality.

A mix of human-written and AI-generated textHuman understanding: all partsLin's conjecturearithmetic-geometric mean inequalitymatrix inequalitiessingular valuesunitarily invariant norms
Oct 29, 20265 pages
PDFView work

math.CO — Combinatorics

Factorial denominators of rank-two scattering coefficients

Contributed by Qiyue Tang

We prove that, for every pair of positive integers i,ji,j, the universal rank-two cluster scattering coefficient τ(i,j)\tau(i,j) satisfies max⁡(i,j)! τ(i,j)∈Z[b,c,g]\max(i,j)!\,\tau(i,j)\in\mathbb{Z}[b,c,g]. This resolves the factorial-denominator conjecture of Elgin, Reading, and Stella (Conjecture 4).

A mix of human-written and AI-generated textHuman understanding: some partsCluster Algebra
Oct 29, 202611 pages
PDFView work

math.RT — Representation Theory

The Mirković–Vilonen basis and cluster pointedness

Contributed by Qiyue Tang

We prove that the Mirković–Vilonen basis of C[N]\mathbb{C}[N] contains every cluster monomial and that each of its elements is gg-pointed in every cluster, where NN is a maximal unipotent subgroup of a complex semisimple group. This resolves Conjecture 6.6 in Kamnitzer’s ICM 2022 survey.

A mix of human-written and AI-generated textHuman understanding: some partsCluster Algebra
Oct 29, 202619 pages
PDFView work

math.NT — Number Theory

Integrality of iterated averages and pointwise prime powers

Contributed by Darij Grinberg

Suppose that we repeatedly replace the values of an integer-valued function on Z\Z by averages over pp consecutive arguments, where pp is prime. If the first ℓ\ell rounds of averaging give integers, will this remain true when we begin with the ppth powers of the original values? We prove that the answer is yes for ℓ≤p\ell\le p. For p=2p=2 and p=3p=3, the answer is yes for every ℓ\ell, and therefore also when integrality is required at every stage. For larger primes, a known counterexample first fails at round p+1p+1. The proofs use finite differences and polynomial interpolation. We also explain connections with earlier work on divisibility of finite differences and Stirling numbers.

A mix of human-written and AI-generated textHuman understanding: some partsInteger SequencesInteger-valued polynomialsdivisibilityfinite differencessupercongruences
Oct 29, 202629 pages
PDFView work

math.RA — Rings and Algebras

The rank of 3×3 matrix multiplication over F2 is 23

Contributed by Tejasvi Singh Tomar

The rank of the tensor of 3×33\times 3 matrix multiplication over the field with two elements is at most 2323 by Laderman's algorithm, and Rudich and Rousseau recently proved that it is at least 2222. We prove that it equals 2323. Hence Laderman's algorithm uses the fewest multiplications among all bilinear algorithms over F2\mathbb{F}_2 and among all bilinear algorithms with integer coefficients. The proof uses the substitution method in the form developed by D'Ambrosio, Wang and Yang et al., which bounds the number of first factors of a decomposition that lie in a given subspace of the space of first factors. We sharpen these bounds for 111111 of Wang's 496496 classes of subspaces, constrain the ranks of the first factors through a 27×2727\times 27 flattening of the tensor, and list, up to symmetry, all sets of 2222 first factors that satisfy these constraints. An exact completion search shows that none of them is the set of first factors of a decomposition. The computation emits certificates, which are checked in the Lean 4 proof assistant. In one formal proof the largest checks are evaluated as compiled code, and in a second one the kernel evaluates every check, so that its final theorem depends only on the three standard axioms of Lean. The Lean proofs build on the formalization of Rudich and Rousseau and import their table of bounds and their reduction for block algorithms.

A mix of human-written and AI-generated textHuman understanding: all parts
Oct 26, 202618 pages
PDFView work

math.RT — Representation Theory

Multiplicative bases and deformations of representation-finite algebras

Contributed by Haruhisa Enomoto

Bautista, Gabriel, Roiter, and Salmer\'on proved that every finite-dimensional representation-finite algebra over an algebraically closed field admits a multiplicative basis, in which products of basis elements are zero or basis elements. Outside characteristic two, they also proved that such an algebra is standard: its category of indecomposable modules is presented by its Auslander--Reiten quiver and mesh relations. We give another proof of both theorems. For a basic algebra, grading morphisms between indecomposable modules by powers of the categorical radical and restricting to projectives yields its standard form, a standard algebra with the same Auslander--Reiten quiver. After constructing a multiplicative basis of the standard form, we recover the original algebra by filtered deformation. Positive-degree Hochschild cohomology embeds into cokernels measuring errors in mesh relations. In characteristic two, lifting derivations modulo four produces cocycles supported on zero basis products; the resulting polynomial family contains the original algebra with coefficients zero or one.

Primarily AI-generated textHuman understanding: some partsAuslander--Reiten theorydeformationmesh categorymultiplicative basisrepresentation-finite algebra
Oct 23, 2026102 pages
PDFView work

math.RA — Rings and Algebras

Maximal sublattices of finite semidistributive lattices: the complement need not be an interval

Contributed by Deep Bhattacharjee

Adams, Freese, Nation and Schmid proved that the complement of a maximal sublattice of a finite bounded lattice is an interval, and asked whether the same holds for finite semidistributive lattices; Adaricheva, Mata, Silberger and Zamojska-Dzienio conjectured that it does. It does not. In a 26-element semidistributive sublattice of the square of a 14-element semidistributive lattice, the diagonal is a maximal sublattice whose complement has two minimal elements.

A mix of human-written and AI-generated textHuman understanding: some partsbounded latticeformal verificationintervalmaximal sublatticesemidistributive lattice
Oct 23, 20268 pages
PDFView work

math.RA — Rings and Algebras

Maximal sublattices of convex geometries: four counterexamples

Contributed by Deep Bhattacharjee

Adaricheva, Mata, Silberger and Zamojska-Dzienio conjectured that in a finite convex geometry, and more generally in a finite join-semidistributive lattice, the complement of a maximal sublattice is a union of intervals with a common least element, and proved this for convex dimension two. We give convex geometries of convex dimension four and three in which such a complement has two and three minimal elements, so their theorem does not extend. The same examples refute their Hypothesis 4 and one half of their Question 2; an eleven-element convex geometry refutes the other half, and a ten-element lattice their Hypothesis 3.

A mix of human-written and AI-generated textHuman understanding: some partsconvex geometryformal verificationjoin-semidistributive latticemaximal sublatticemeet-irreducible element
Oct 23, 202611 pages
PDFView work

math.RA — Rings and Algebras

Nilpotent-free spaces of 3 x 3 matrices over the field with three elements

Contributed by Deep Bhattacharjee

Wigderson conjectured that for every finite field FF and every n≥1n\ge1 there is a space of n×nn\times n matrices over FF of dimension n2−(n2)n^2-\binom n2 whose only nilpotent element is zero. We show that every six-dimensional space of 3×33\times3 matrices over $\F_3$ contains a nonzero nilpotent matrix, so the conjecture fails for $F=\F_3$ and n=3n=3; the largest possible dimension is five.

A mix of human-written and AI-generated textHuman understanding: some partsGerstenhaber's theoremfinite fieldsformal verificationnilpotent matricesspaces of matrices
Oct 22, 202612 pages
PDFView work

math.CO — Combinatorics

Two conjectures of Wormald on Hamilton cycles in tournaments

Contributed by Deep Bhattacharjee

A tournament is a complete graph in which every edge has been given a direction, and a Hamilton cycle in it is a directed cycle through all the vertices. Let h(n)h(n) be the largest number of Hamilton cycles that a tournament on nn vertices can have, and let g(n)=2−n(n−1)!g(n)=2^{-n}(n-1)! be the expected number of Hamilton cycles of a random tournament on nn vertices. Wormald obtained lower bounds for h(n)h(n) by replacing every vertex of a fixed regular tournament TT on dd vertices by a random tournament on nn vertices. The expected number of Hamilton cycles of the result is governed by a number HH, the determinant of the Hessian of a function defined implicitly by TT; the bound is d/H g(dn)\sqrt{d/H}\,g(dn), or e1/dd/H g(dn)e^{1/d}\sqrt{d/H}\,g(dn) when the blocks are regular. Wormald computed HH for a few small tournaments, found that d/Hd/H was the square of a rational number every time, and could not explain it. We prove that H=ddet⁡(d2I+S2)/det⁡(d2I−S2)H=d\det(d^2I+S^2)/\det(d^2I-S^2), where SS is the skew adjacency matrix of TT, so that H≠0H\neq0 and d/H=det⁡(dI−S)/det⁡(dI−iS)\sqrt{d/H}=\det(dI-S)/\det(dI-iS) is a ratio of two positive integers. This is his Conjecture~6. For the cyclic tournament on dd vertices the formula becomes d/H=((d+1)d+(d−1)d)/((d+i)d+(d−i)d)\sqrt{d/H}=\bigl((d+1)^d+(d-1)^d\bigr)/\bigl((d+i)^d+(d-i)^d\bigr), which tends to cosh⁡1/cos⁡1=2.8559578925…\cosh1/\cos1=2.8559578925\ldots as dd grows. This is his Conjecture~2, and it identifies the constant 2.8559582.855958 that he estimated by fitting polynomials; it also explains why the terms in 1/d1/d and 1/d31/d^3 of his fits were nearly zero. We add bounds for d/H\sqrt{d/H} over all regular tournaments on dd vertices, with equality in the lower bound exactly for doubly regular tournaments. Every statement is proved by hand.

A mix of human-written and AI-generated textHuman understanding: some partsHamilton cycleHessian determinantformal verificationrandom blow-upskew-symmetric matrixtournament
Oct 22, 202612 pages
PDFView work

math.RA — Rings and Algebras

Values of the Huang–Ma invariant

Contributed by Qiyue Tang

We prove the binary-value conjecture of Huang and Ma for integer matrices admitting a fixed positive diagonal skew-symmetrizer. We determine the exact set of values in every size and construct matrices realizing each value.

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 partsCluster Algebra
Oct 18, 20267 pages
PDFView work

math.RA — Rings and Algebras

The rank-one Dixmier conjecture for elements of mass at most six

Contributed by Idris Ali Shaik

Let K be a field of characteristic zero and let P,Q in A_1(K) satisfy [Q,P]=1. We prove that P,Q generate A_1(K) if either has mass at most six, meaning at most six nonzero homogeneous components for the grading deg X=1, deg Y=-1, with no degree bound on either element. This extends the four-component theorem of Guccione, Guccione and Valqui. The proof combines their Newton-polygon restrictions with a classification of polynomial pairs r,f satisfying an associated scalar differential equation under the condition that r^2 has at most six monomial terms. The scalar argument uses a two-dimensional Vandermonde kernel, Rolle's theorem, and a sign and parity obstruction. The scalar classification and the mass bound reduce the crossing cases to a binomial-power face. We exclude that face using at most one Newton cut, without a mass bound on the transformed pair. We also exclude a family of pure-power crossing faces with prime outer exponent, without a mass bound. A seven-term scalar solution shows that the scalar classification is sharp, although its associated Weyl face is excluded by the pure-power theorem. Theorem 1.1 is formalized in Lean 4 and registered as Palomar entry PALOMAR-2026-10-05-000006, version 2.

A mix of human-written and AI-generated textHuman understanding: all partsDixmier conjectureNewton polygonWeyl algebrahomogeneous componentssparse polynomials
Oct 15, 202618 pages
PDFView work

math.QA — Quantum Algebra

Finite quantum theta functions for skew-symmetrizable seeds

Contributed by Qiyue Tang

For integral compatible skew-symmetrizable seeds, finite quantum theta functions form a bar-invariant, mutation-compatible basis of an algebra between the cluster and upper cluster algebras. We prove leading-coefficient positivity, valuative independence, unit Newton vertex coefficients, and independence under coefficientwise base change. We obtain upper theta bases for large cluster complexes, reddening classes, and Markov matrices and their one-way acyclic extensions. In mutation-acyclic classes, these are also bases of the cluster algebra.

Primarily AI-generated textHuman understanding: no partsquantum cluster algebra
Oct 12, 202649 pages
PDFView work