Browse

Combinatorics

math.CO — Combinatorics

Works in math.CO

14 works

math.MG — Metric Geometry

A Fourier Consequence for Lattice Kissing Numbers and Average Contacts

Contributed by Scott Kominers

We deduce a new asymptotic upper bound Klat(n)≤(2e/π+o(1))nK_{\mathrm{lat}}(n)\leq\left(\sqrt{2e/\pi}+o(1)\right)^n on the maximal lattice kissing number Klat(n)K_{\mathrm{lat}}(n) in dimension nn, using the explicit auxiliary functions constructed in OpenAI's "Ten Advances" preprint. The same bound holds for the average contact degree of a finite packing of congruent balls. The bound's base-22 exponential rate rounds to 0.39560.3956, matching the value extrapolated empirically by Afkhami-Jeddi, Cohn, Hartman, de Laat, and Tajdini in 2020.

A mix of human-written and AI-generated textHuman understanding: all partsContact numbersDiscrete geometryEuclidean latticesFourier linear programming boundsGeometry of numbersKissing numbersSphere packing

math.CO — Combinatorics

An Exponent of 1.04273 for the Unit Distance Problem

Contributed by Eric Naslund

Let u(U)u(U) count the unordered pairs at distance one in a finite planar set UU. We construct finite sets UjU_j with ∣Uj∣→∞|U_j|\to\infty and u(Uj)/∣Uj∣1.04273→∞u(U_j)/|U_j|^{1.04273}\to\infty. The largest exponent previously claimed, 1.03581.0358, is in the author's unpublished manuscript. The method is the number-field construction of OpenAI and Sawin: unit distances come from elements of relative norm one in quadratic extensions, and the fields come from an infinite pro-22 class field tower. The new ingredients are quadratic extensions of mixed signature, with an exact average over their norm-one units, and a tower over the real quadratic field $\Q(\sqrt{241})$, in which 22, 33 and 55 split. Its Golod--Shafarevich function contains two copies of the local conditions at these primes but only one constant term, and the extra room lets the tower be ramified only above 22, 33 and 55; the root discriminant of its fields is about 286286. The relative zeta value is bounded through the zeta function of the degree-512512 field generated over $\Q(\sqrt{241})$ by the square roots of its {2,3,5}\{2,3,5\}-units, which is the product of the Dedekind zeta function of $\Q(\sqrt{241})$ and 255255 quadratic Hecke LL-functions. Finite facts and numerical inequalities are certified by exact computation and interval arithmetic. A significant portion of this work was verified in Lean, reducing the result with exponent 1.04271.0427 to an explicit zeta function inequality (Palomar registry, PALOMAR-2026-10-01-000018, version 1).

Primarily AI-generated textHuman understanding: some parts

math.CO — Combinatorics

Tilings of an equilateral triangle by at most five lattice trapezoids with 60° base angles: a complete structural classification

Contributed by Gonzalo Barria

We study tilings of an equilateral triangle of side n in the triangular grid by k lattice trapezoids with base angles 60°, the objects behind the OEIS sequences A389392 (k = 4) and A391498 (k = 5). We prove two angle identities valid for every such tiling and a lemma relating the number of boundary vertices to the number of pieces having a side on the boundary. With these tools we show that there are exactly 1, 2 and 13 combinatorial types of tilings for k = 3, 4, 5. For k = 3 every tiling is a pinwheel. For k = 4 every tiling belongs to one of the two categories used in A389392, a fact that had previously been taken for granted. For k = 5 the thirteen types refine the eight categories of A391498; in three of them a piece has no side on the boundary. As a consistency check, the volumes of the parameter polytopes together with the generic multiplicities reproduce the leading coefficient 7/36 of the conjectured quasi-polynomial for A391498. All lemmas were checked against an exhaustive enumeration of the tilings with pairwise distinct pieces for n ≤ 15. Finally, the classification turns the thirteen types into eight explicit families of sets of shapes, and an inclusion–exclusion over them reduces the conjectured generating function of A391498 to twelve elementary counting statements, and we settle all twelve: the resulting closed formula reproduces the sequence for every n ≤ 127.

A mix of human-written and AI-generated textHuman understanding: all partsOEIS A391498lattice trapezoidsquasi-polynomialrational generating functiontilings of an equilateral triangle

math.CO — Combinatorics

Collapsibility of Alexander duals for shade maps

Contributed by Darij Grinberg

Let EE be a nonempty finite set. A shade map on EE is a map T:P(E)→P(E)T:\mathcal{P}(E)\rightarrow\mathcal{P}(E) such that toggling an element u∉T(F)u\notin T(F) in the input FF does not change T(F)T(F). We prove that, if TT is an inclusion-reversing shade map and G⊆EG\subseteq E, then the simplicial complex \[ \{F\subseteq E\mid G\subseteq T(F)\} \] is collapsible. Equivalently, if SS is an inclusion-preserving shade map, then the Alexander dual of \[ \{F\subseteq E\mid G\not \subseteq S(F)\} \] is collapsible. This is an Alexander-dual companion to the shade-map collapsibility theorem in \emph{The Elser nuclei sum revisited}. The proof first matches all faces on which T(F)≠ET(F)\neq E by a toggle. The remaining faces, characterized by T(F)=ET(F)=E, form the free convex set complex of an associated antimatroidal quasi-closure operator. We give a self-contained recursive acyclic matching on this complex. For ordinary convex geometries, Korte--Lovász--Schrader prove the stronger fact that the free convex set system is non-evasive.

A mix of human-written and AI-generated textHuman understanding: all partsantimatroidsconvex geometriesdiscrete Morse theorygraphssimplicial complexes

math.CO — Combinatorics

Coefficientwise positivity for alternating sums of qq-factorials

Contributed by David Anderson

We prove that the alternating sum ∑i=0k(−1)i(ki)[m−i]!q\sum_{i=0}^{k}(-1)^i\binom ki[m-i]!_q has nonnegative coefficients whenever m≥2k−1m\ge 2k-1. For k≥3k\ge3, this range is exact. The case m=2km=2k proves a conjecture of Lewis and Morales arising from the enumeration of invertible matrices with prescribed zero entries. After removing a common qq-factorial, we express the sum in a Gaussian-binomial basis whose coefficients are independent of the ambient size. Their positivity follows from a coefficientwise domination argument using convexity of ordinary binomial coefficients.

Primarily AI-generated textHuman understanding: all parts

math.CO — Combinatorics

Signed seeds and G-gradings on cluster algebras

Contributed by Lauren Williams, Alan Yan

The theory of cluster algebras is closely connected to the theory of total positivity; indeed, the desire to better understand total positivity was one of the main motivations for Fomin and Zelevinsky’s introduction of cluster algebras [FZ02]. In particular, any cluster variety whose coordinate ring has a cluster structure has a natural notion of positive part: the subset of the variety where all cluster variables are positive. In this paper, we explain that there are other signed cells contained in cluster varieties that are equally natural from a cluster-theoretic point of view. These come from signed seeds, which can be thought of as a Z/2Z-grading on cluster variables, and which were introduced in [EZLP+ 23] in the context of the amplituhedron. More generally, given any abelian group G, we introduce the notion of a G-graded seed for a cluster algebra, which is a way of assigning elements of G to each cluster variable which is compatible with the cluster structure. When G is the multiplicative group {−1, 1}, this recovers the above notion of signed seed; when G = C∗ , this recovers the notion of cluster automorphism group [GSV10] or cluster dilation group [NS26]; and when G = Zd , this recovers the notion of graded cluster algebra studied by Grabowski-Launois [GL14], Grabowski [Gra15] and Gekhtman-Shapiro-Vainshtein [GSV10, Section 5.2] (which had previously appeared in special cases in work of Fomin-Zelevinsky [FZ07]). The examples we study include the space of square matrices, symmetric matrices, skew-symmetric matrices, positroid varieties, and amplituhedron tiles. We also connect this notion to tropical mutation when G = R or Z.

Primarily human-written textHuman understanding: all partsGrassmanniansamplituhedroncluster algebras

math.CO — Combinatorics

On a non-basis of the coinvariant algebra

Contributed by Darij Grinberg

A conjecture arising from a question of Procesi proposes a basis of the coinvariant algebra of SnS_n consisting of column-antisymmetrized monomials indexed by pairs of standard Young tableaux. We show that the proposed family need not even span an SnS_n-subrepresentation: for n=8n=8, a generator of degree 1515 is sent outside the span by the adjacent transposition (4,5)(4,5). The proof is an exact finite computation with an explicit separating functional, requiring neither a rank computation nor Gr\"obner reduction. We also retain an explicit relation for n=7n=7, where the basis assertion first fails, although the span is still invariant.

A mix of human-written and AI-generated textHuman understanding: all partsSpecht modulesYoung tableauxcoinvariant algebrahigher Specht polynomialsrepresentations of the symmetric group

math.RA — Rings and Algebras

A Universal Noncommutative Splitting Algebra for Polynomials

Contributed by Darij Grinberg

Let RR be a commutative ring. We show that every homogeneous polynomial f∈R[x1,…,xm]f\in R[x_{1},\ldots,x_{m}] of degree nn splits into a product of nn homogeneous linear forms over a suitable noncommutative ring extension SS of RR (that is, over a noncommutative RR-algebra SS whose structure morphism R→SR\rightarrow S is injective). The algebra SS is universal for such factorizations and is free as an RR-module. The proof uses Bergman's Diamond Lemma: we define SS by generators and relations, and the relations form a terminating reduction system that has no ambiguities and thus is confluent. An analogous result is also shown for inhomogeneous polynomials (with inhomogeneous factors). This easily follows from the homogeneous case by homogenizing and then setting the homogenizing variable equal to 11.

A mix of human-written and AI-generated textHuman understanding: all partsBergman's diamond lemmaGröbner basescombinatorial algebranoncommutative polynomials

math.CO — Combinatorics

A counterexample to the Burman--Kulishov conjecture on Lie elements

Contributed by Darij Grinberg

Burman and Kulishov defined Lie elements in the group algebra k[Sn]\mathbf k[S_n] by comparing, on every exterior power of the reflection representation VV, the usual action of k[Sn]\mathbf k[S_n] with the infinitesimal action induced by its action on VV. They conjectured that the Lie algebra Ln\mathcal L_n of all Lie elements is generated by the Kirchhoff differences 1−(ij)1-(ij). We disprove this conjecture for n=4n=4 by exhibiting an explicit counterexample arising from the (2,2)(2,2)-block of k[S4]\mathbf k[S_4]. More generally, we describe Ln\mathcal L_n in terms of the Artin--Wedderburn decomposition of k[Sn]\mathbf k[S_n]: its hook blocks are determined by the action on VV, whereas its non-hook blocks are arbitrary. Consequently, the primitive central idempotents of the non-hook blocks yield linearly independent obstructions to the conjecture. We also identify the Lie algebra generated by the Kirchhoff differences in terms of the derived algebra of the Lie algebra generated by transpositions. Along the way, we give an integral, and hence characteristic-free, proof that the exterior powers of VV are the hook-shaped Specht modules.

A mix of human-written and AI-generated textHuman understanding: all partsLie algebrasymmetric group algebrasymmetric group representations

math.AC — Commutative Algebra

Polynomials over Symmetric Polynomials

Contributed by Darij Grinberg

Let k\mathbf{k} be a commutative ring, and let the symmetric group Sn\mathfrak{S}_{n} act on $P=\mathbf{k}\left[ x_{1} ,x_{2},\ldots,x_{n} \right] $ by permuting the variables. We prove four results that are known (at least in the case when k\mathbf{k} is a field) but not easily found in the literature. First, the coinvariant algebra (the quotient of PP by the ideal generated by the symmetric polynomials with constant term 00) is a free k\mathbf{k}-module of rank n!n!, with the residue classes of the Artin monomials as a basis. Second, PP is a free module of rank n!n! over the ring PSnP^{\mathfrak{S}_{n}} of symmetric polynomials, again with the Artin monomials as a basis. Third, if n!n! is invertible in k\mathbf{k}, the coinvariant algebra is the regular $\mathbf{k}\left[ \mathfrak{S}_{n} \right] $-module. Fourth, under the same hypothesis, PP is a free left PSn[Sn]P^{\mathfrak{S}_{n}}\left[ \mathfrak{S}_{n} \right] -module of rank 11. The first result follows from an elementary normal-form lemma for monic polynomials with pairwise relatively prime leading monomials. The second is proved by lifting the Artin basis. For the third, we use orbit harmonics with a strongly discrete point orbit, and the fourth follows by equivariantly lifting a regular basis of the coinvariant algebra.

A mix of human-written and AI-generated textHuman understanding: all partsArtin basisGröbner basescoinvariant algebraorbit harmonicssymmetric polynomials

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

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

math.CO — Combinatorics

A Counterexample to a Conjecture on Fused Specht Polynomials

Contributed by Darij Grinberg

Lafay, Peltola and Roussillon conjectured that their realization of simple modules of the fused Hecke algebra by fused Specht polynomials extends from Young diagrams with two columns to Young diagrams of arbitrary shape. We give a counterexample for \[ n=8,\qquad \lambda=(3,2,2,1),\qquad \varsigma=(2,2,2,2). \] More precisely, we exhibit an explicit linear dependence among three fused Specht polynomials indexed by row-strict Young tableaux. The same example also yields an infinite family of counterexamples.

Primarily AI-generated textHuman understanding: some partsSpecht modulesSpecht polynomialsYoung tableaux