Browse

Metric Geometry

math.MG — Metric Geometry

math.MG RSS feed

Works in math.MG

64 works

math.CO — Combinatorics

Wills' (1981) conjecture holds if and only if the dimension is at most 4, and other miscellanea

Contributed by Dave Goel

Let PP be a lattice polytope in Rn\mathbb R^n that is symmetric about the origin and has the origin as its only interior lattice point. In 1981 Wills conjectured that each coefficient gi(P)g_i(P) of the Ehrhart polynomial of PP is at most the corresponding coefficient of the cube [−1,1]n[-1,1]^n, that is, gi(P)≤2i(ni)g_i(P)\le 2^i\binom ni. Wills proved this for n≤3n\le3, and Henze showed in 2014 that it fails for every n≥7n\ge7; the dimensions 44, 55 and 66 remained open. We settle them. In dimension 44 the conjecture holds; the new bounds are g1(P)≤8g_1(P)\le8 and g2(P)≤24g_2(P)\le24, and, up to unimodular equivalence, g1(P)=8g_1(P)=8 only for the cube, one explicit 2424-cell and one explicit cross-polytope. In dimension 55 we give a polytope with 5050 vertices in [−1,1]5[-1,1]^5 whose linear Ehrhart coefficient is 101/10>10101/10>10; products with segments then give counterexamples in every dimension n≥6n\ge6. Hence Wills' conjecture holds in Rn\mathbb R^n if and only if n≤4n\le4. The proof in dimension 44 combines Ehrhart reciprocity, the lower bound theorem for triangulated 33-spheres and an exhaustive computer enumeration of about three million sets of lattice points, listed up to symmetry. This expanded version also gives a second proof of the case in which the integer functionals bounded by 11 on PP do not span R4\mathbb R^4, determines the second largest value of g2g_2 in dimension 44, discusses a width-two approach, describes the computer search for the counterexample, and describes all computations used in the proofs.

Author comments: First version: November 3, 2026. This is the expanded version of the paper "Wills' (1981) conjecture holds if and only if the dimension is at most 4", which is at https://hexagonmath.org/2611.00540 on Hexagon.

A mix of human-written and AI-generated textHuman understanding: some partsEhrhart polynomialWills' conjecturecentrally symmetric polytopeinterior lattice pointlattice polytope
Nov 16, 202626 pages
PDFView work

math.CO — Combinatorics

Wills' (1981) conjecture holds if and only if the dimension is at most 4

Contributed by Dave Goel

Let PP be a lattice polytope in Rn\mathbb R^n that is symmetric about the origin and has the origin as its only interior lattice point. In 1981 Wills conjectured that each coefficient gi(P)g_i(P) of the Ehrhart polynomial of PP is at most the corresponding coefficient of the cube [−1,1]n[-1,1]^n, that is, gi(P)≤2i(ni)g_i(P)\le 2^i\binom ni. Wills proved this for n≤3n\le3, and Henze showed in 2014 that it fails for every n≥7n\ge7; the dimensions 44, 55 and 66 remained open. We settle them. In dimension 44 the conjecture holds; the new bounds are g1(P)≤8g_1(P)\le8 and g2(P)≤24g_2(P)\le24, and, up to unimodular equivalence, g1(P)=8g_1(P)=8 only for the cube, one explicit 2424-cell and one explicit cross-polytope. In dimension 55 we give a polytope with 5050 vertices in [−1,1]5[-1,1]^5 whose linear Ehrhart coefficient is 101/10>10101/10>10; products with segments then give counterexamples in every dimension n≥6n\ge6. Hence Wills' conjecture holds in Rn\mathbb R^n if and only if n≤4n\le4. The proof in dimension 44 combines Ehrhart reciprocity, the lower bound theorem for triangulated 33-spheres and an exhaustive computer enumeration of about three million sets of lattice points, listed up to symmetry.

Author comments: First version: November 3, 2026. The expanded version of this paper, "Wills' (1981) conjecture holds if and only if the dimension is at most 4, and other miscellanea", is at https://doi.org/10.5281/zenodo.23955454 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsEhrhart polynomialWills' conjecturecentrally symmetric polytopeinterior lattice pointlattice polytope
Nov 16, 202613 pages
PDFView work

math.DG — Differential Geometry

Smooth isometric bending of a closed sphere

Contributed by Boyang Hu

We construct a smooth embedded sphere Σ⊂R3\Sigma\subset\mathbb R^3 together with a smooth one-parameter family of isometric embeddings of Σ\Sigma whose images are not all congruent. The family is periodic; an inner disk and a complementary cap stay fixed pointwise; and the area, the enclosed volume and the total mean curvature do not change. This gives a flexible closed surface in the smooth category. The mechanism is elementary. A disk whose metric is rotationally symmetric, but whose embedding is not, can be turned inside a fixed shell provided it is exactly planar near its rim. The whole difficulty is to produce such a disk. This reduces to a scalar equation of Monge–Ampère type on an annulus, the Darboux equation, for a height function which must be nonradial and yet constant to infinite order at both boundary circles. We solve this equation by a Nash–Moser argument around an infinitesimal bending of a radial profile. The profile is forced to change the sign of its curvature infinitely often near each boundary circle, so the linearized equation changes type on infinitely many circles accumulating at both ends. We build the profile from explicitly solvable one-dimensional models, describe its accumulating ends by an exact three-term recurrence, and invert the linearized operator on the whole annulus. Two modifications of the linearization, each proportional to an unsolved equation, keep the type-change circles and the characteristic return maps fixed during the iteration, so that all linearized operators act on one domain.

Author comments: 119 pages. The main theorem (Theorem A) has been formalized in Lean 4 with Mathlib: https://github.com/Rogerhu12/continuous-flexibility. The folder anc/ contains four Python scripts which check explicit identities of the text, and the script which draws Figure 2.

Primarily AI-generated textHuman understanding: some partsDarboux equationNash–Moser iterationflexible surfacesisometric deformations
Nov 16, 2026119 pages
PDFView work

math.CO — Combinatorics

The Lee (2026) conjecture on the diameters of order and chain polytopes fails in both directions, and other miscellanea

Contributed by Dave Goel

For a finite poset PP, Stanley's order polytope O(P)\mathcal O(P) and chain polytope C(P)\mathcal C(P) have the same number of vertices and, by a theorem of Hibi, Li, Sahara and Shikama, the same number of edges. J. Lee recently conjectured that for a connected poset the diameters of their graphs differ by at most 11. We show that this fails in both directions. For every k≥1k\ge1 we describe a connected poset BkB_k with 3k3k elements on three consecutive antidiagonals of the grid Z2\mathbb Z^2, for which the graph of O(Bk)\mathcal O(B_k) has diameter exactly kk, while the graph of C(Bk)\mathcal C(B_k) has diameter exactly ⌊2k/3⌋+1\lfloor2k/3\rfloor+1. Their difference is therefore ⌈k/3⌉−1\lceil k/3\rceil-1, and their ratio tends to 3/23/2. Hence no constant bounds diam⁡O(P)−diam⁡C(P)\operatorname{diam}\mathcal O(P)-\operatorname{diam}\mathcal C(P) on connected posets. In the other direction, for every n≥4n\ge4 we construct a connected poset PnP_n with 2n2+5n+12n^2+5n+1 elements such that diam⁡O(Pn)=2\operatorname{diam}\mathcal O(P_n)=2 and diam⁡C(Pn)=4\operatorname{diam}\mathcal C(P_n)=4. We also show that diam⁡O(P)≤2\operatorname{diam}\mathcal O(P)\le2 implies diam⁡C(P)≤4\operatorname{diam}\mathcal C(P)\le4 for every finite poset PP, so a difference of 22 is the largest possible at order diameter 22.

Author comments: First version: October 23, 2026. This is the expanded version of the paper "Diameters of the order and chain polytopes of a connected poset", which is at https://hexagonmath.org/2611.00523 on Hexagon.

A mix of human-written and AI-generated textHuman understanding: some partsLee conjecturechain polytopediameterfinite posetgraph of a polytopeorder polytope
Nov 16, 202631 pages
PDFView work

math.CO — Combinatorics

Diameters of the order and chain polytopes of a connected poset

Contributed by Dave Goel

For a finite poset PP, Stanley's order polytope O(P)\mathcal O(P) and chain polytope C(P)\mathcal C(P) have the same number of vertices and, by a theorem of Hibi, Li, Sahara and Shikama, the same number of edges. On disconnected posets the diameters of their graphs can differ by any amount, since both diameters add over disjoint unions and already differ on small examples, but on connected posets a computer search of Lee found no difference larger than 11. We show that on connected posets, too, the two diameters can be far apart. For every k≥1k\ge1 we describe a connected poset BkB_k with 3k3k elements whose order polytope has graph diameter kk and whose chain polytope has graph diameter at most ⌊3(k+1)/4⌋\lfloor3(k+1)/4\rfloor; hence the first diameter can exceed the second by any amount. For every n≥4n\ge4 we construct a connected poset PnP_n with 2n2+5n+12n^2+5n+1 elements whose order polytope has graph diameter 22 and whose chain polytope has graph diameter 44. Finally, for every finite poset PP, if the graph of O(P)\mathcal O(P) has diameter at most 22, then the graph of C(P)\mathcal C(P) has diameter at most 44; so 22 is the largest possible difference when the order polytope has graph diameter 22.

Author comments: First version: October 28, 2026. The expanded version of this paper, "The Lee (2026) conjecture on the diameters of order and chain polytopes fails in both directions, and other miscellanea", is at https://doi.org/10.5281/zenodo.23351398 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partschain polytopediameterfinite posetgraph of a polytopeorder polytope
Nov 16, 202619 pages
PDFView work

math.NT — Number Theory

Geometric Equivalence of the Riemann Hypothesis

Contributed by FELIPE MARTINS SANTOS

We study the complex rational extensions of two sequences, called SeqImpar and SeqPar, and the way their geometric images relate to the nontrivial zeros of the Riemann zeta function. We prove that I(z) = 5 − 4/(z − 1) maps the critical line Re(z) = 1/2 to the circle |w − 9| = 4, and that, for w = I(ρ), rational inversion recovers exactly the coordinates Re(ρ) and γ = Im(ρ). We show that SeqPar induces a second rational curve and that its extension is injective in the half-plane Re(z) > 0. To distinguish points corresponding to zeta zeros from the other points on these curves, we use a Dirichlet series weighted by the convergence errors of the sequences and prove the correspondence between its poles and the nontrivial zeros. This yields a geometric criterion rigorously equivalent to the Riemann Hypothesis: all relevant poles of the transformed function must lie on the indicated circle. We present formulas for extracting ordinates using residues and contour integrals, together with numerical checks involving the first five known zeros. The results constitute an exact reformulation of the hypothesis, not a proof of its truth or an independent algorithm for computing new zeros.

Author comments: A parallel construction holds for SeqPar’s curve CP . These characterizations do not prove RH; they make the geometric equivalence explicit and locate the remaining difficulty in independently determining the poles of the transform. https://doi.org/10.5281/zenodo.24247902

A mix of human-written and AI-generated textHuman understanding: all partsRiemann Hypothesis
Nov 15, 202610 pages
PDFView work

math.NA — Numerical Analysis

Geometric Root Calculators: Radical supports of orders five and nine and real-degree enclosures in the Pandrosion rectangle

Contributed by Ivan BESEVIC

We study ruler-and-compass iterations for the positive root X1/pX^{1/p} that share one rectangle, one power stage and one readout, and differ only in a support line. Every support approximates the same target function κ∗(t)=(t−1)/(t1/p−1)\kappa_*(t)=(t-1)/(t^{1/p}-1) of the residual tt, and the contact order of the approximation fixes the order of the iteration. Besides the classical supports of orders one to four we treat three radical supports. A decentered arc gives a globally monotone fifth-order iteration. Two supports have local order exactly nine for every real p>2p>2 and converge monotonically from every positive start: a support built from two successive mean proportionals, with error constant 7/6487/648 for cube roots, and a combination of the arithmetic mean, the geometric mean and one conic mean of 11 and tt, with error constant 23/2073623/20736 for cube roots, drawn with three arcs. For integer p≥3p\ge 3 one step costs at most 10p+910p+9 elementary traces for the decentered arc, 10p+1110p+11 for the three-mean support and 10p+5910p+59 for the nested support; measured by the efficiency index, and under the stated counting conventions, the three-mean support is preferable for every p≥3p\ge3. We then separate what is a finite construction from what is only a scalar statement: the fast iterations are finite constructions for rational degrees, whereas for irrational pp a single step is not. For arbitrary real p≠0p\neq 0 a power-free subdivision with one final Padé readout encloses the root with relative width at most z5/256z^5/256 in at most 15n+6315n+63 traces after nn subdivisions (for X>1X>1, p≥1p\ge 1). Global convergence and the local orders with their constants, for the three radical supports and every real p>2p>2, are checked in Lean, as are the degree, approximation and efficiency statements; the drawing inventories are written protocols.

Author comments: Version 29, a revision of V28. New in this version: the three-mean support of Section 5, with its Lean proofs, its construction and its inventory; the comparisons of Section 6 are updated. The verifier anc/verify_v29.py recomputes the constants, identities and tables (SymPy, mpmath). LaTeX sources, verifiers and the Lean 4 / Mathlib formalization: https://github.com/ivan-fr/pandrosion

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

math.MG — Metric Geometry

An upper bound of 2√2 for the three-dimensional sofa problem in a snake-shaped corridor

Contributed by Tejasvi Singh Tomar

The moving sofa problem in a snake-shaped corridor, posed by O'Rourke and by Georgiev, Gómez-Serrano, Tao and Wagner, asks for the largest volume of a connected body that can be moved through a corridor of unit-square cross-section with two turns that are far apart, one in the xx–yy plane and one in the yy–zz plane. The largest reported body has volume at least 1.85584041.8558404, and Tang obtained upper bounds for this problem, the best of which is 3.40833.4083. We prove by hand that the largest volume is at most 222\sqrt2 whenever the straight section between the turns is longer than 2+22+\sqrt2. The main new tool is a sharp bound: two infinite tubes of unit-square cross-section whose axes make an angle θ\theta meet in volume at most 1/sin⁡θ1/\sin\theta. With it, Hammersley's argument for the planar moving sofa problem carries over to three dimensions. The same argument gives explicit bounds for shorter straight sections; these and the main bound have also been proved in Lean 4 with Mathlib.

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

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

math.MG — Metric Geometry

A lower bound for Moser's worm problem with rotations and translations

Contributed by Tejasvi Singh Tomar

In its convex form, Moser's worm problem asks for the least area of a convex set in the plane that contains a copy of every arc of length 11. For the version in which the copies may be rotated and translated but not reflected, we prove that this least area M+M^{+} satisfies M+≥0.2414M^{+}\ge0.2414; the best bound before, 0.2390.239, follows from Keller's bound for the version with reflections. The proof bounds the area of the convex hull of copies of five polygonal arcs, among them two zigzags that turn in opposite directions, so that without reflections the hull must contain a zigzag turning each way. A branch and bound over the placements of the arcs, with second-order Taylor bounds for signed areas of polygons, produces a certificate, which is checked in ball arithmetic and in the Lean proof assistant.

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

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

math.MG — Metric Geometry

The Barker--Larman problem in dimension three A counterexample to the Barker--Larman problem in dimension three

Contributed by Sihan Chen

We construct an origin-symmetric convex body of revolution in R3\R^3, with real-analytic boundary and positive principal curvatures, whose planar sections tangent to a concentric inner ball all have the same area. The body is nonspherical and has the same section data as a centered ball. The construction bifurcates from the unit ball at height 1/31/\sqrt{3}, where degree two is the only even Legendre resonance. We construct approximate solutions to arbitrary order and correct them by a Newton iteration on nested closed parameter sets. A finite-order reduction of the linearized section operator and measure estimates for its small divisors provide the inverse bounds needed for convergence.

Primarily AI-generated textHuman understanding: some partsBarker--Larman problemLegendre polynomialsgeometric tomographyparallel sectionssmall divisor
Nov 15, 202628 pages
PDFView work

math.MG — Metric Geometry

Fixed points of the polar projection body operator and its square

Contributed by Sihan Chen

Let TK=(ΠK)∘TK=(\Pi K)^\circ be the polar projection body of a convex body KK in Rn\R^n. In dimension n≥3n\ge3, we prove that TKTK is a positive dilate of KK exactly when KK is an origin-centred ellipsoid, settling Petty's polar projection conjecture. The same classification holds under the weaker assumption that T2KT^2K is a positive dilate of KK. The proof uses a distributional Laplacian identity to compare two integrals of central section volumes. Equality supplies contractive hyperplane projections with every kernel direction, and James's theorem gives ellipsoidal rigidity. The argument applies to arbitrary convex bodies and yields the translative constant volume conjecture of Horv\'ath and L\'angi.

Primarily AI-generated textHuman understanding: some partsFixed and Periodic PointsPetty’s Polar Projection ProblemPolar Projection Bodies
Nov 12, 20265 pages
PDFView work

math.MG — Metric Geometry

The 24-cell conjecture in the all-contact case and near D4

Contributed by Tejasvi Singh Tomar

The 24-cell conjecture states that every Voronoi cell of a packing of unit balls in R4\mathbb{R}^4 has volume at least 88, the volume of the regular 24-cell. It implies that no packing of equal balls in R4\mathbb{R}^4 is denser than the lattice packing D4D_4. We prove the conjecture for two classes of cells; in each class, equality holds only for the D4D_4 root configuration. The first consists of the cells whose ball touches every ball centred at distance less than 222\sqrt2 from its centre, and its proof uses a certificate at the second level of the Lasserre hierarchy. The second consists of the cells whose 2424 nearest centres lie in an explicit neighbourhood of the D4D_4 configuration, whatever the other centres are. For them the volume is at least 88 plus a fixed multiple of the total outward displacement of the 2424 centres, which we prove by a quantitative rigidity estimate and a second-order expansion of the volume about D4D_4. Our proofs for both classes are computer-assisted and partly formalised in Lean.

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

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

math.MG — Metric Geometry

A lower bound of 0.8366 for Lebesgue's universal covering problem

Contributed by Tejasvi Singh Tomar

A universal cover is a convex set in the plane that contains a congruent copy of every set of diameter at most 11. Lebesgue asked in 1914 for a universal cover of least area; before this work, the infimum Λ\Lambda of the areas of universal covers was known to satisfy 0.83474≤Λ≤0.84410.83474\le\Lambda\le0.8441. Lower bounds come from test sets: Λ\Lambda is bounded below by the least area of a convex hull of congruent copies of given sets of diameter at most 11. The best earlier lower bounds used the disk, the Reuleaux triangle and the Reuleaux pentagon, but these three bodies are known to admit a placement with hull area below 0.834790.83479, so they cannot give a much better bound. Adding the regular Reuleaux heptagon and nonagon of width 11, we improve the lower bound to Λ≥0.8366\Lambda\ge0.8366. Without the nonagon, the other four bodies already give Λ≥0.836\Lambda\ge0.836. The proof is a computer-assisted branch and bound over the relative placements of the bodies. Its certificates are checked in interval arithmetic, and separate proofs of both bounds in Lean 4, with their own certificates, are checked entirely by Lean's kernel.

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

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

math.PR — Probability

Lower bounds for the Beardwood–Halton–Hammersley constant

Contributed by Tejasvi Singh Tomar

Let β\beta be the Beardwood–Halton–Hammersley constant: the shortest tour through nn independent uniform random points in the unit square has length asymptotic to βn\beta\sqrt n almost surely. Dong and Cao proved β≥0.6421\beta\ge0.6421 from an inequality β≥5/8+∑k=3KCk\beta\ge5/8+\sum_{k=3}^{K}C_k, where CkC_k is an integral over configurations of kk points in the plane that form a connected graph when points at distance at most 11 are joined. For C3C_3, C4C_4 and C5C_5, sharper bounds come from a first-order expansion of the area of the union of the unit disks on boxes of configurations. For C6+⋯+C22C_6+\dots+C_{22}, which Dong and Cao did not use, a lower bound comes from comparing each point only with the three points before it in the order of their first coordinates. We obtain β≥0.6496\beta\ge0.6496, and β≥0.6508\beta\ge0.6508 if the exponential function of the C library used to evaluate the bound for C6+⋯+C22C_6+\dots+C_{22} has a relative error below 10−910^{-9}. The proofs are computer-assisted; the bound 0.64960.6496 is proved in Lean 4, with finite checks evaluated by compiled code, from the inequality of Dong and Cao and two statements about unions of disks that we prove but do not formalize.

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

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

math.CO — Combinatorics

The Steiner ratio is at least 0.8564

Contributed by Tejasvi Singh Tomar

The Steiner ratio is the infimum, over finite sets of points in the Euclidean plane, of the length of a Steiner minimal tree divided by the length of a minimum spanning tree. Gilbert and Pollak conjectured in 1968 that it equals 3/2≈0.8660\sqrt3/2\approx0.8660, and the conjecture is open. We prove that it is at least 2141/2500=0.85642141/2500=0.8564, improving the bound 0.85590.8559 of Ke, Huang, Shu, He, Gai and Wang. Their method reduces the induction step of Du and Hwang's 1983 proof of the bound 0.80.8 to finitely many inequalities on boxes in a space of local configurations of a Steiner minimal tree, which are checked by computer. These inequalities use estimates for the positions of terminals outside the local configuration. We prove all the geometric lemmas that our certificate uses, filling gaps in two proofs of Ke et al., and we add two such estimates that hold for more parameter values than the published ones. Within this method some new estimate is necessary: with the published estimates, no certificate of this kind reaches 0.8560.856, whatever the boxes. The computer-assisted part is also verified in Lean 4, by a proof whose checks all run in Lean's kernel; the rest of the argument enters the formal proof as hypotheses.

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

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

math.MG — Metric Geometry

The kissing numbers in dimensions five and seven are at most 43 and 132

Contributed by Tejasvi Singh Tomar

The kissing number τn\tau_n is the largest number of non-overlapping unit balls in Rn\mathbb{R}^n that can touch a common unit ball. The best bounds so far were 40≤τ5≤4440\le\tau_5\le44 and 126≤τ7≤134126\le\tau_7\le134; both upper bounds come from high-precision floating-point computations of the three-point bound by Mittelmann and Vallentin. We prove τ5≤43\tau_5\le 43 and τ7≤132\tau_7\le132. Each proof is an exact rational solution of the second level of the Lasserre hierarchy for spherical codes at degrees (d1,d2,δ)=(14,20,20)(d_1,d_2,\delta)=(14,20,20). We use the formulation of de Laat, Leijenhorst and de Muinck Keizer and check the solutions with their verification program. Each certificate is obtained by rounding a convex combination of two dual iterates of the interior-point method, one on each side of the target value. Exact certificates for the same hierarchy also give A(4,arccos⁡13)≤14A(4,\arccos\frac13)\le14, A(5,arccos⁡13)≤22A(5,\arccos\frac13)\le22 and A(6,arccos⁡13)≤34A(6,\arccos\frac13)\le34 for spherical codes, improving the previous bounds 1515, 2323 and 3535; with a known code, A(4,arccos⁡13)=14A(4,\arccos\frac13)=14. The largest number of points at angle π/3\pi/3 from a point of a kissing configuration in Rn\mathbb{R}^n equals A(n−1,arccos⁡13)A(n-1,\arccos\frac13), so in R5\mathbb{R}^5 this number is 1414. We also prove the five bounds in the Lean proof assistant, assuming only the positivity of the zonal kernels given by the zonal polynomial files: once by checking the exact certificates with compiled code, and once, with every computation done by Lean's kernel, from the certificates rounded to 3030 decimal places.

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

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

math.CO — Combinatorics

The independence number of the generalized Johnson graph J(13,5,3)J(13,5,3)

Contributed by Mustafa Stanikzai

Let J(13,5,3)J(13,5,3) be the graph on the 5-element subsets of a 13-element set, two subsets being adjacent when they share exactly 3 elements. We prove that α(J(13,5,3))=33\alpha(J(13,5,3)) = 33. The graph is an explicit unit-distance graph in R12\mathbb{R}^{12}, so χ(R12)≥⌈1287/33⌉=39\chi(\mathbb{R}^{12}) \ge \lceil 1287/33 \rceil = 39; earlier bounds from explicit finite graphs give at most 38. A recent preprint of Davies gives much larger bounds, none from an explicit finite graph. An explicit independent set gives α≥33\alpha \ge 33. For the upper bound, a symmetry reduction splits the problem into 200 clique subproblems, and a certifying solver refutes each one with a proof log that the checker VeriPB accepts. An uncertified computation reproduces the value α(J(13,6,4))=46\alpha(J(13,6,4)) = 46 reported by Exoo and Ismailescu, which gives χ(R12)≥38\chi(\mathbb{R}^{12}) \ge 38.

Author comments: 16 pages. Programs, certificates and proof logs: https://doi.org/10.5281/zenodo.24145863 Changes from version 1: 28 cross-references to lemmas, propositions, claims, definitions and corollaries were printed with the word "Theorem" (for example "Theorem 2.4" for Lemma 2.4). They now carry the correct names. The reference numbers were already correct. Statements, proofs, results and bibliography are unchanged.

A mix of human-written and AI-generated textHuman understanding: all partschromatic number of Euclidean spacegeneralized Johnson graphindependence numbermaximum cliqueproof loggingunit-distance graph
Nov 12, 202616 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.MG — Metric Geometry

Classification of fixed points of the centroid body operator

Contributed by Sihan Chen

We classify the fixed points, up to dilation, of the classical volume-normalized centroid body operator in every dimension. We prove that ΓK = cK holds precisely for ellipsoids centered at the origin. The proof combines a signed spherical moment-gap argument in low dimensions with boundary integral operators, compact-group structure, and quantitative regression estimates in higher dimensions. Affine eigenfunctions force a large rotation subspace; curvature and log-concave regression bounds then exclude every proper such subspace. The remaining finite comparisons are certified by exact rational inequalities. The manuscript supplies proofs of the auxiliary analytic estimates and explicitly identifies the external results used.

Primarily AI-generated textHuman understanding: some partsCentroid bodycompact transformation groupellipsoidfixed pointlog-concavity
Nov 12, 202630 pages
PDFView work

math.DS — Dynamical Systems

Singular perpendicular orbits and complete periodicity in rational triangles

Contributed by Joshua Boorstein

Let Δ\Delta be a triangle whose angles are rational multiples of π\pi. A billiard path leaving a side σ\sigma at a right angle either meets a vertex first — its starting point is then singular — or meets a side at a right angle again: σ\sigma itself, at a new point, or another side, where it retraces itself. The singular points cut σ\sigma into finitely many intervals, and each interval retraces or is carried onto another by the return map, reversing orientation (a mirror pair) or preserving it (a translation pair). We count these intervals exactly. The singular points of the sides perpendicular to a direction class are in bijection with the slots — a vertex with a direction of the class pointing inward — whose path meets a side at a right angle before any vertex, so the number of intervals is v+S−2p−s′v + S - 2p - s': SS slots, vv perpendicular sides, pp pairs of mutually reverse vertex-to-vertex paths meeting no side at a right angle, and s′s' slots whose path never reaches a vertex. This bounds the retracing bands and translation pairs, sharply on isosceles triangles, and makes s′=0s' = 0 equivalent to complete periodicity of the class. Our main theorem is that p=0p = 0 forces complete periodicity: a minimal component needs a swapped pair. The converse fails. In every isosceles triangle (a,a,b)(a, a, b) with NN even and a≥3a \geq 3 the class of the base direction has p≥1p \geq 1, and it is completely periodic, by a companion paper (computer-assisted in part), whenever b≥4b \geq 4 and NN has at most one odd prime factor. At odd NN, two infinite families of scalene triangles have p≥1p \geq 1 and are completely periodic in the checked range.

Author comments: First version. Companion papers: "The orphan theorem" (hexagon:2611.00191), "The necklace of a rational right triangle" (hexagon:2611.00213) and "No arrivals" (hexagon:2611.00250), whose results this paper imports. Code: https://doi.org/10.5281/zenodo.24093456

Primarily AI-generated textHuman understanding: some partsBoshernitzan conjecturecomplete periodicityinterval exchange transformationsisosceles trianglesperpendicular orbitsrational billiardsrational trianglessaddle connectionstranslation surfaces
Nov 11, 202626 pages
PDFView work

math.DS — Dynamical Systems

Non-perpendicular periodic orbits in mirror directions of right triangles

Contributed by Joshua Boorstein

Let TT be a right triangle with an acute angle aa. A direction is a mirror direction of TT if it is the axis of a reflection in the group generated by the reflections in the sides of TT — for instance, any direction parallel or perpendicular to a side. A billiard path that meets a side at a right angle retraces itself, its directions are mirror directions, and it is periodic as soon as it meets a side at a right angle a second time. We ask whether every periodic billiard path in a mirror direction is of this kind. When cos⁡2a\cos 2a is transcendental it is: every such path meets a side at a right angle, and in the directions parallel to the hypotenuse there is no periodic path at all. The proof is a holonomy computation on Hooper's chain of rhombi, and it bounds the degree of cos⁡2a\cos 2a for any exception. When cos⁡2a\cos 2a is algebraic and a/πa/\pi irrational, exceptions can occur: we construct non-perpendicular periodic cylinders in mirror directions explicitly — among them an infinite family indexed by the solutions of u2−2v2=−1u^2 - 2v^2 = -1 — and show that the triangles carrying them form a countable dense set in each of the four classes of mirror directions. Corollaries include the absence of odd-period orbits in right triangles and the existence of one-way periodic paths in every right triangle (answering two questions of Holt), a description of the odd orbits of isosceles triangles, and the statement that Ruijgrok's third conjecture, read for right triangles, fails on a countable dense set of triangles, all with cos⁡2a\cos 2a algebraic, and holds whenever cos⁡2a\cos 2a is transcendental.

Author comments: First version. Companion paper: "The necklace of a rational right triangle" (hexagon:2611.00213). Code: https://doi.org/10.5281/zenodo.24037744

Primarily AI-generated textHuman understanding: some partsHooper's rhombiRuijgrok's conjecturebilliardsholonomyirrational billiardsmirror directionsodd-period orbitsperiodic orbitsperpendicular orbitsright triangles
Nov 11, 202635 pages
PDFView work

math.FA — Functional Analysis

Improved scaling in the metric cotype inequality

Contributed by Manor Mendel

Let 2≤q<∞2\le q<\infty. It is proved that every Banach space with Rademacher cotype qq satisfies the metric cotype qq inequality with scaling parameter m=O(n1/2+1/q)m=O(n^{1/2+1/q}). The improved bound on the scaling is achieved by reducing the metric cotype problem to a smoothing and approximation criterion on the continuous torus. For a single unconditional kernel, the criterion is controlled by its mean ℓ∞\ell_\infty radius and its variation in the main diagonal direction. The construction fits the universal smoothing and approximation scheme of Giladi, Mendel, and Naor. The proofs were generated by GPT~6 Astra with the help of the author.

Author comments: 17 pages

Primarily AI-generated textHuman understanding: all parts
Nov 10, 202617 pages
PDFView work

math.CO — Combinatorics

A bigon-free dichotomy for pseudoline arrangements, after a note of Grothendieck

Contributed by Michel Hua

A pseudoline of an arrangement in the real projective plane is bigonal when it carries exactly two vertices of the arrangement. In an undated folder of working notes from the early 1980s, Grothendieck states that every arrangement without bigonal pseudolines is either four pseudolines in general position or contains one of three configurations: five pseudolines in general position, a pencil of three and a pencil of two without the line joining their centres, or the complete quadrangle. The notes derive this from a statement that is false as written, and they give no independent proof. We give a short proof, together with the ordering of the pseudolines that the notes ask for, and we deduce that for n ≥ 6 the near-pencils are the only arrangements of n pseudolines containing none of the three configurations. The dichotomy has been checked by an exhaustive enumeration of all arrangements of at most nine pseudolines, and it is formalised in the proof assistant Lean for a combinatorial model of arrangements, generalised maps of Euler characteristic one.

Primarily AI-generated textHuman understanding: some partsGrothendieckLean 4MathlibMontpellier archiveSylvester–Gallaicomplete quadrangleformalisationgeneralised mapsnear-pencilpseudoline arrangements
Nov 07, 20267 pages
PDFView work

math.CO — Combinatorics

A new proof of van der Waerden's inequality, and beyond

Contributed by Suvrit Sra

We give a new, self-contained proof of van der Waerden's permanent inequality via a monotone-averaging argument. Specifically, we show that the minimum total correlation of a random permutation with prescribed doubly stochastic marginals never decreases when two rows or two columns of the marginal matrix are averaged. This quantity is largest at the uniform matrix, which yields van der Waerden's bound. The monotone-averaging rests on the quadratic Alexandrov–Fenchel inequality, which lets us extend the argument to many other problems. In this way we also prove the Friedland–Tverberg inequalities and Gurvits's coefficient bound for Lorentzian polynomials.

A mix of human-written and AI-generated textHuman understanding: all partsAlexandrov-Fenchel inequalityFriedland-Tverberg inequalityLorentzian polynomialscapacitydoubly stochastic matricesentropymixed volumespermanenttotal correlationvan der Waerden inequality
Nov 05, 202631 pages
PDFView work

math.CO — Combinatorics

A composite modulus and Frobenius digits in the Heilbronn triangle construction

Contributed by David Niedbala Giraudin

OpenAI proved that for every sufficiently large n there are n points in the unit square all of whose triangles have area at least c n^(-2+eta), with an explicit but extremely small eta (of order 10^(-235)). Subsequent public work lowered the cost of the construction, the latest claimed exponent being eta = 2/100866719, about 1.98*10^(-8). We introduce two changes. First, the digit base is taken to be a multiple of the label prime r and the main modulus is h = r B^(k-1) instead of B^k; this reduces the ratio h/tau between the modulus and the excluded determinant window from about B to about r, which allows the extension degree d = 3. Second, the norm polynomial is placed in the digits by a digit-wise convolution along the Frobenius expansion of the exponents, with a trace digit in a polynomial basis, giving k = 1440 positions. The result is Delta(n) >= c n^(-2+eta) with eta = 1/177022 > 5.64*10^(-6), for every sufficiently large n. The finite identities are checked by exact computation in the ancillary files.

Primarily AI-generated textHuman understanding: no partsHeilbronn triangle problemfield normfinite fieldslattice point countingprobabilistic method
Nov 04, 202611 pages
PDFView work

math.GT — Geometric Topology

A certified upper bound for the distortion of the trefoil knot

Contributed by David Niedbala Giraudin

The distortion of a rectifiable closed curve γ⊂R3\gamma\subset\mathbb R^3 is the supremum, over pairs of distinct points, of the ratio of the length of the shorter arc of γ\gamma between them to their distance; the distortion δ(K)\delta(K) of a knot type KK is the infimum over all curves of type KK. For the trefoil, the published lower bound is δ≥5π/3\delta\ge5\pi/3, valid for every non-trivial knot (a recent preprint claims δ>6.5321\delta>6.5321), and the only upper bound we found in the literature is the value 7.167.16 obtained by numerical simulation. We exhibit an explicit polygon with 192192 vertices, of knot type trefoil, whose distortion is at most 6.926.92. The proof is computer-assisted: the knot type is certified by an explicit piecewise-linear path of embedded polygons starting from a polygon on a torus, and the distortion by exact rational arithmetic on every pair of edges. Two separately written verifiers are supplied.

Primarily AI-generated textHuman understanding: no partsGromov distortioncomputer-assisted proofknot distortionpolygonal knotstrefoil
Nov 02, 20264 pages
PDFView work

math.MG — Metric Geometry

Improved and sharp bounds for illumination

Contributed by אלון שכטר

We prove improved ordinary illumination bounds and exact ordinary and fractional values for several classes of convex bodies. Every full-dimensional complex zonotope in $\C^2$ has illumination number five, except complex affine images of the bidisc, whose number is seven. For complex 11-symmetric non-polydiscs in $\C^3$, an explicit construction gives twelve illuminating directions. For real 11-symmetric non-cubes in Rn\R^n, connected domination in the cube graph gives the upper bound $2^{n-1}+\gamma_c(Q_{n-1})+n-1 =2^{n-1}(1+(1+o(1))/n)$; an explicit family has illumination number 2n−12^{n-1}. We also give a product boundary measure proving fractional lower bounds 2n2^n for bodies between specified inner and outer bodies, and attain these bounds along Minkowski interpolations with a positive inner summand. Finally, the least size UnU_n of a single family illuminating every normalized complex 11-unconditional body satisfies Un∼3n+1/πnU_n\sim3^{n+1}/\sqrt{\pi n}.

Primarily AI-generated textHuman understanding: no partsconvex geometry
Nov 02, 202619 pages
PDFView work

math.MG — Metric Geometry

Illumination of complex 1-unconditional convex bodies

Contributed by אלון שכטר

We study ordinary and fractional illumination of complex 11-unconditional convex bodies. In every complex dimension nn we give an explicit ordinary bound asymptotic to 3n+1/πn3^{n+1}/\sqrt{\pi n}, and prove $\ill^*(K)\le b_*^n$ and $\ill(K)=O(n\log(n+1)b_*^n)$, where b∗=2.4805534697…b_*=2.4805534697\ldots is defined by an explicit scalar equation. For normalized non-polydiscs in dimensions two, three and four, the sharp ordinary bounds are 66, 1414 and 3030. More generally, a full coordinate (n−1)(n-1)-polydisc gives the sharp bound 2n+1−22^{n+1}-2 in every dimension n≥2n\ge2. In dimension two we prove the fractional bound 44 and classify equality by the two maximal supporting coefficients at the coordinate axes. If every extreme point has all coordinates nonzero, we obtain the fractional bound 2n2^n, with equality exactly for the polydisc, and a quantitative strict bound otherwise. Appendices give the exact sizes of simultaneous illuminating families in dimensions one through five, the exact finite verification used in dimension four, and a numerical comparison of the general estimates through dimension 100100.

Primarily AI-generated textHuman understanding: some partsconvex geometry
Nov 02, 202634 pages
PDFView work

math.MG — Metric Geometry

Illumination of several families of complex convex bodies

Contributed by אלון שכטר

We determine ordinary and fractional illumination numbers for complex Hanner bodies and for bodies obtained as convex hulls of coordinate polydiscs indexed by the maximal independent sets of a graph. The formulas are sums over coordinate supports. For Hanner bodies we classify all equality cases in the ordinary and fractional dimension bounds, including the sharp ordinary bound for non-polydiscs. For graph bodies, fractional equality 2n2^n occurs exactly when the graph is a disjoint union of isolated vertices and edges; a vertex of degree at least two gives the strict bound 3⋅2n−23\cdot2^{n-2}. We also prove the fractional bound 2n2^n for bodies defined by nondecreasing submodular constraints on coordinate moduli. For finite systems of positive weighted inequalities satisfying an explicit condition on tight sets, we obtain the same fractional bound and an ordinary bound of (2+o(1))nlog⁡n 2n(2+o(1))n\log n\,2^n, together with an explicit estimate in every dimension. This includes bounded systems on laminar families with arbitrary positive coefficients. We conclude with a conjectural classification of fractional equality for normalized complex 11-unconditional bodies.

Primarily AI-generated textHuman understanding: some partsconvex geometry
Nov 02, 202616 pages
PDFView work

math.FA — Functional Analysis

The pp-Bures–Wasserstein distance via 3×33\times3 block matrices (with application to pp-Bures–Wasserstein barycenters)

Contributed by Suvrit Sra

We study the pp-Bures–Wasserstein distance Dp(A,B)=(tr Ap+tr Bp−2∥A1/2B1/2∥pp)1/2D_p(A,B)=(\mathrm{tr}\,A^p+\mathrm{tr}\,B^p-2\|A^{1/2}B^{1/2}\|_p^p)^{1/2} on positive semidefinite matrices; it equals the Bures–Wasserstein distance for p=1p=1, and the Hilbert–Schmidt distance for p=2p=2. We prove that DpD_p is a metric for every 1≤p≤21\le p\le2, by proving a stronger 2014 conjecture of Lin and van den Driessche on 3×33\times3 block matrices. Our main tool is a partition inequality for Schatten norms, proved by complex interpolation. We also characterize Fréchet means for DpD_p by a fixed-point equation and prove geometric convergence of the associated iteration.

A mix of human-written and AI-generated textHuman understanding: all partsBures-Wasserstein distanceLin-van den Driessche conjectureSchatten normbarycenterscomplex interpolationpartition inequalitypositive semidefinite block matrices
Nov 02, 202620 pages
PDFView work

math.PR — Probability

Beyond Small Balls: A Determinant Inequality for Functions of Matrix Gaussian Series

Contributed by Suvrit Sra

We prove a functional extension of Gaussian operator-norm small-ball inequalities. Let X=∑i=1dgiBiX=\sum_{i=1}^d g_iB_i, where g∼N(0,Id)g\sim N(0,I_d), the matrices Bi∈Rd×dB_i\in\mathbb{R}^{d\times d} are symmetric, and ∑iBi2⪯Id\sum_iB_i^2\preceq I_d. For every even log-concave f ⁣:R→[0,∞)f\colon\mathbb{R}\to[0,\infty), we obtain Edet⁡f(X)≥(Ef(κG))d\mathbb{E}\det f(X)\ge(\mathbb{E} f(\kappa G))^d at dilation κ=13/5\kappa=13/5, where GG is standard Gaussian. The proof reduces each function to one small-ball estimate, obtained from matrix-weighted Poincaré inequalities, and controls the rest by averages over the spectrum. We give an equivalent entropy formulation. An explicit counterexample shows that no universal dilation below π/2\sqrt{\pi/2} can work; we conjecture that this value is optimal.

A mix of human-written and AI-generated textHuman understanding: all partsdeterminant inequalitylog-concave functionsmatrix Gaussian seriesrandom matricessmall-ball probabilities
Nov 02, 202630 pages
PDFView work

math.DG — Differential Geometry

Closed three-manifolds as hypersurfaces of Euclidean fourspace: compactness, the homogeneous geometries, and total absolute curvature

Contributed by Jay Thrussell

## Abstract Let (Σ,g)(\Sigma, g) be a closed Riemannian three-manifold, and let M=−G\mathbb M = -G be its negative Einstein endomorphism. Where det⁡M>0\det\mathbb M > 0, the companion paper [MA] reduces realizability as a hypersurface of E4E^4 to one equation, F(g)=0F(g) = 0, and studies it locally. Here we treat the global questions. - **Compactness.** A closed realization has det⁡M≥R−6\det\mathbb M \geq R^{-6} at a point farthest from any centre, where RR is that distance, and so max⁡det⁡M≥125/(8 diam6)\max\det\mathbb M \geq 125/(8\,\mathrm{diam}^6) by Jung's theorem. If det⁡M>0\det\mathbb M > 0 everywhere, the realization is a strictly convex embedded sphere, unique up to rigid motion. So a closed connected metric with det⁡M>0\det\mathbb M > 0 is realizable iff Σ\Sigma is simply connected and F(g)=0F(g) = 0. No closed three-manifold other than S3S^3 carries such a realizable metric. - **The homogeneous geometries.** A realizable closed metric with det⁡M>0\det\mathbb M > 0 and constant scalar curvature is round, and so is every compact locally homogeneous realization. Locally, constant M\mathbb M-eigenvalues with det⁡M>0\det\mathbb M > 0 force constant curvature, a case of Tsukada's classification. This recovers Agaoka and Hashinaga's list of the left-invariant metrics that embed locally. The eight Thurston geometries are worked as checks. - **Total absolute curvature.** J(g)=∫det⁡M dVJ(g) = \int\sqrt{\det\mathbb M}\,dV equals 2π22\pi^2 on every closed realizable metric with det⁡M>0\det\mathbb M > 0, so any other value excludes realizability. At the round sphere JJ is stationary. Its second variation on transverse-traceless tensors of level nn is −(μn+2)(μn+3)/16-(\mu_n + 2)(\mu_n + 3)/16 times the squared norm, μn=n2−3\mu_n = n^2 - 3, and its radical is exactly the conformal and Lie directions. On conformal rays JJ is flat to third order. Along the conformal path of [MA], J=2π2−π2t4/12+O(t6)J = 2\pi^2 - \pi^2t^4/12 + O(t^6). - **Non-convex realizations.** Embedded hypersurfaces of revolution are non-convex exactly around their necks. For the radial graphs r=1+εcos⁡2χr = 1 + \varepsilon\cos2\chi, convexity is lost at ε=1/5\varepsilon = 1/5 in a Whitney cusp of the Gauss map. With δ=ε−1/5\delta = \varepsilon - 1/5, the relative excess J/2π2−1J/2\pi^2 - 1 then grows as 500 δ3/2/(92 π)500\,\delta^{3/2}/(9\sqrt2\,\pi). - **Connectivity, and the round sphere.** Modulo isometry, the closed realizable metrics with det⁡M>0\det\mathbb M > 0 form a contractible family, contracted by an explicit equivariant path. The embedded hypersurfaces of revolution join the round sphere through the degenerate locus. We collect the characterisations of the round sphere, with their hypotheses. Every displayed result is reproduced by a script; Appendix V indexes them.

Primarily AI-generated textHuman understanding: no partsEinstein tensorGauss map singularitiesGauss–Codazzi equationsThurston geometrieshypersurfaces of Euclidean spaceisometric immersionsupport functiontotal absolute curvature
Oct 31, 202635 pages
PDFView work

math.NA — Numerical Analysis

Low-discrepancy quasi-uniform digital sequences in every dimension

Contributed by Leonhard Gruenschloss

A sequence of points in the unit cube is quasi-uniform if its first NN points are spread like a grid for every NN: no two of them are closer, and no empty ball between them is larger, than a constant times N−1/sN^{-1/s} in dimension ss. Dick, Goda and Suzuki asked for such sequences among the digital sequences of quasi-Monte Carlo integration, and Goda, Hofer and Suzuki asked whether any Halton-type sequence is quasi-uniform. We show that in dimension two and higher no Halton-type sequence, no Sobol' sequence, no classical Niederreiter sequence and no Faure sequence is quasi-uniform, and that linear scrambles of all coordinates but one do not help: a carry in the last digits of one coordinate leaves the leading digits of all others unchanged, giving explicit pairs of points that are far too close. We then show that one fixed linear scramble of a generalized Faure sequence, the same for all numbers of points, repairs this. In it, the digits of all coordinates at one scale are residues of one rational function, each taken at the coordinate's own point of the projective line, so the residue theorem ties the coordinates together and a carry in one coordinate is seen by the others. For every dimension ss and every prime base p>2sp>2^s this gives explicit quasi-uniform digital (0,s)(0,s)-sequences, hence of low discrepancy, whose first N=psK−1N=p^{sK-1} points are at least (1−2p−1/s)N−1/s(1-2p^{-1/s})N^{-1/s} apart, for every KK; in dimensions two and three, for every prime p≥5p\ge5, a variant keeps its first NN points at least (1−2/p)N−1/s(1-2/p)N^{-1/s} apart whenever NN is a power of ps2p^{s^2}. For such scrambles, exact linear rules that place every point inside its cell as a function of the last few digits of the cell's index can hold at no more than about one in ss of the sizes psKp^{sK}; with allowed ranges instead of exact rules we certify all of these sizes, with points at least (1−O(1/p))N−1/s(1-O(1/p))N^{-1/s} apart for large pp. Quasi-uniform digital sequences follow in every prime base p≥3p\ge3 in dimension three, and in every prime base in dimension two, base two included. Some steps are computer-assisted.

A mix of human-written and AI-generated textHuman understanding: some partsHalton sequencesLean 4 formalizationcovering radiusdigital sequenceslow discrepancyminimum distancequasi-Monte Carloquasi-uniformityresidue theorem
Oct 31, 2026102 pages
PDFView work

math.MG — Metric Geometry

Symmetric Volume Descent from U4 and a Four-Dimensional Lower Bound

Contributed by Hangang Wang

We explain a symmetric deformation that decreases the volume of the four-dimensional constant-width body U4U_4. The emphasis is on why the deformation works, rather than the size of the decrease. Oddness preserves width; convexity requires control of the curvature radii. A positive cap on one support branch is coupled to a negative correction on the adjacent branch. Their first-order volume contributions have different orders in the localization parameter, so the favorable contribution dominates. A small motion towards the ball makes the direction feasible for positive time. In a separate part we give a spectral lower bound for all four-dimensional bodies of constant width one, including an explicit positive refinement. A short projection argument using a three-dimensional theorem of Jiang gives the stronger lower bound 0.178722030.17872203. A substantial gap between the lower and upper bounds remains.

A mix of human-written and AI-generated textHuman understanding: all partsconstant widthspectral lower boundsvolume descent
Oct 29, 202616 pages
PDFView work

math.MG — Metric Geometry

Analytic symmetric floating bodies

Contributed by Liam Price, Tom de Groot

In every dimension d≥3d\ge3, we construct nonspherical, origin-symmetric, strictly convex bodies of revolution with real-analytic boundary that float in equilibrium in every orientation. Their densities tend to the unit-ball cap fraction at height (d+4)−1/2(d+4)^{-1/2}, where we prove that a degree-four spherical resonance is isolated. More generally, our construction applies at isolated even-degree resonances whose waterline angle is an irrational multiple of π\pi. Varying the density gives formal deformations. To obtain actual bodies, we use a finite-order diagonal reduction to establish inverse estimates away from small divisors. Newton iteration then corrects fixed-order truncations on closed parameter sets of asymptotically full measure.

A mix of human-written and AI-generated textHuman understanding: some partsUlam's floating body problembodies of revolutioncentral symmetryconvex geometryfloating bodiessmall divisors
Oct 29, 202611 pages
PDFView work

math.FA — Functional Analysis

Positive definite functions of noncommuting contractions, Hua-Bellman matrices, and a new distance metric

Contributed by Suvrit Sra

We study positive definiteness of Hua-Bellman matrices (i.e., matrices of the form [det⁡(I−Ai∗Aj)−α]ij[\det(I-A_i^*A_j)^{-α}]_{ij}, where AiA_i and AjA_j are strict contractions and α∈Rα\in\mathbb{R}). We start by revisiting a 1959 work of Bellman (Representation theorems and inequalities for Hermitian matrices; Duke Mathematical J., 26(3), 1959) that studies positive definiteness of Hua-Bellman matrices and claims a strengthening of Hua's representation-theoretic results (Inequalities involving determinants; Acta Mathematica Sinica, 5 (1955)). We uncover a critical error in Bellman's proof that has surprisingly escaped notice to date, and we show by an explicit example that his claim itself is false. We then provide conditions under which det⁡(I−A∗B)−α\det(I-A^*B)^{-α} is a positive definite function. For complex contractions our condition is the known sharp one, with the integer exponents below Hua's range reached by an elementary argument. For real symmetric contractions we recover the part of Bellman's claims that survives. Building on our result, we introduce a new Poincaré-like distance metric on noncommuting strict contractions, and yet another `log-det' based distance in the appendix.

Primarily human-written textHuman understanding: all partsHua-Bellman matricesdistance metricnoncommuting contractionsoperator inequalitiespositive definite functions
Oct 29, 202612 pages
PDFView work

math.MG — Metric Geometry

Volume Computation and Comparison for Four-Dimensional Bodies of Constant Width

Contributed by Hangang Wang

We compute and compare the volumes of explicit four-dimensional bodies of constant width one. The original five-entry comparison consists of the simplex-symmetric projection body U4U_4, the canonical raised Meissner pair, the canonical raise of U3U_3, the body B5B_5, and M4M_4. We combine exact geometric formulas, numerical integration, interval enclosures and inscribed rational polytopes to obtain a certified strict ordering of their volumes. We also compare U4U_4 with the direct four-dimensional AMO peabody. The two raised Meissner bodies are proved noncongruent but exactly equal in volume. An introductory account explains why different constructions benefit from different computational methods, and distinguishes approximate volume estimates from inequalities certified by exact or outward-rounded arithmetic.

Primarily human-written textHuman understanding: all partsBodies of constant widthcertified comparisonfour-dimensional volumeinterval arithmetic
Oct 26, 202622 pages
PDFView work

math.MG — Metric Geometry

Finite Truncated Lattice-Length Data on Three-Dimensional Flat Tori

Contributed by Changxia Lin

We study what finite truncations of the lattice-length multiset can determine about a three-dimensional flat torus. For a full-rank lattice \Lambda \subset \mathbb{R}^3, let \lambda_1(\Lambda) \leq \lambda_2(\Lambda) \leq \lambda_3(\Lambda) be its successive minima, and let \mathcal{L}_T(\Lambda) record the lengths of all nonzero lattice vectors of norm at most T, counted with vector multiplicity. First, on the class defined by \lambda_1 = a and \lambda_2 > T, we prove an exact volume classification: the set of possible covolumes is (F(a,T), \infty), where F(a,T) = \frac{aT}{2}\sqrt{3T^2 - a^2}. The lower bound uses Oppenheim's classical determinant-minimization theorem for Minkowski-reduced ternary forms; an explicit perturbed basis proves every larger volume is attained. Second, we give a pair of positive-definite Gram matrices with equal diagonal entries and matching two-coordinate data but different determinants. This yields a quantitative obstruction to uniform finite identification and gives the lower bound \sqrt{3} for the worst-case identification-radius constant. Schiemann's finite theta-series determination theorem supplies the complementary upper bound \sqrt{7/2} after conversion from squared lengths to radii. We also record a cubic sign-product identity for the eight signed basis vectors and explain its limitations. All contributions are separated from classical inputs, and the possible optimality of the constant \sqrt{3} and the broader topological question are left open.

Primarily human-written textHuman understanding: all partslattice geometry; flat tori
Oct 26, 202611 pages
PDFView work

math.MG — Metric Geometry

Illumination of complex convex bodies

Contributed by אלון שכטר

For every complex 11-unconditional convex body K⊂CnK\subset\mathbb{C}^n, we prove \[ \operatorname{ill}(K)\le (2^{m+1}-1)\binom nm+\sum_{k=m+1}^{n}\binom nk-(n-m), \qquad m=\lceil2n/3\rceil. \] This bound is asymptotic to 3n+1/πn3^{n+1}/\sqrt{\pi n}. We further obtain ill⁡∗(K)≤b∗n\operatorname{ill}^*(K)\le b_*^n and ill⁡(K)=O(nlog⁡(n+1)b∗n)\operatorname{ill}(K)=O(n\log(n+1)b_*^n), where b∗=2.4805534697…b_*=2.4805534697\ldots is defined by an explicit scalar equation. For normalized bodies other than Dn\mathbb{D}^n that contain a full coordinate (n−1)(n-1)-polydisc, we prove the sharp bound ill⁡(K)≤2n+1−2\operatorname{ill}(K)\le2^{n+1}-2. We also prove the sharp bound 1414 for every normalized complex 11-unconditional body in C3\mathbb{C}^3 other than D3\mathbb{D}^3, and the sharp bound 3030 in C4\mathbb{C}^4 for every normalized non-polydisc. The four-dimensional proof includes one finite covering assertion verified by exact integer arithmetic; its complete verifier is included. Under full coordinate permutation symmetry, we improve the three-dimensional bound to 1212 by an explicit twelve-vector construction and an exact finite covering certificate. For complex Hanner bodies, we compute both illumination numbers exactly and determine the equality cases in their dimension bounds. If every extreme point has all coordinates nonzero, we prove ill⁡(K)≤2n+1−1\operatorname{ill}(K)\le2^{n+1}-1 and a quantitative strict fractional bound ill⁡∗(K)<2n\operatorname{ill}^*(K)<2^n for normalized non-polydiscs. For real 11-symmetric non-cubes we obtain bounds 1212 in dimension four, 2222 in dimension five, and 5⋅2n−35\cdot2^{n-3} for every n≥6n\ge6. We also determine the leading asymptotic maximum in the real 11-symmetric non-cube class: it is (1+o(1))2n−1(1+o(1))2^{n-1}. An explicit binary construction proves this without an external coding theorem. A connection to connected domination in cube graphs improves the upper estimate to 2n−1(1+(1+o(1))/n)2^{n-1}(1+(1+o(1))/n).

Primarily AI-generated textHuman understanding: some partsconvex geometry
Oct 26, 202645 pages
PDFView work

math.MG — Metric Geometry

Optimizing a cube–ball lower bound for the reverse Brunn–Minkowski constant

Contributed by Ricardo Pinho

We optimize a single term in the cube–Euclidean-ball construction of V. Patankar to obtain C_70 >= exp(1/(2e)) > 1.20194336847. The strongest public proposal located and reproduced in our dated source audit is Patankar's 1.201927, whose specified witness evaluates near 1.2019271425725. A separate finite-dimensional witness certifies 1.20194336. Two separately written arithmetic implementations, using Arb and rational logarithm/Stirling bounds respectively, verify the numerical comparisons and reject corrupted or excessive claims. The geometric reduction and passage to the limit are proved here. This unrefereed preprint is not peer reviewed and not formally verified; exhaustive priority is not asserted.

Primarily AI-generated textHuman understanding: some partscentrally symmetric convex bodiescube and Euclidean ballexact certificatesintrinsic volumesreverse Brunn–Minkowski inequalityrigorous arithmetic
Oct 26, 20263 pages
PDFView work

math.MG — Metric Geometry

Regular Morley tetrahedra from pp-secting planes

Contributed by Deep Bhattacharjee

Morley's theorem says that the adjacent angle trisectors of a triangle meet in the vertices of an equilateral triangle. Tran carried the construction to a tetrahedron by trisecting its six dihedral angles and, more generally, by pp-secting planes, with one parameter e,f,g>1e,f,g>1 for each pair of opposite edges; the resulting tetrahedron is denoted Me,f,g(ABCD)\mathcal M_{e,f,g}(ABCD). Tran showed that a regular Morley tetrahedron does not force the original tetrahedron to be regular, observed that in his examples some pair of opposite edges has four equal cross edges, and conjectured that this happens whenever Me,f,g(ABCD)\mathcal M_{e,f,g}(ABCD) is regular. We show that the conjecture is false. We place an isosceles tetrahedron in the box [−a,a]×[−b,b]×[−c,c][-a,a]\times[-b,b]\times[-c,c] and prove that Me,f,g(ABCD)\mathcal M_{e,f,g}(ABCD) is regular exactly when its vertex A′A' differs from the centre of the box and lies on one of the four lines through the centre in the directions (1,1,1)(1,1,1), (1,−1,−1)(1,-1,-1), (−1,1,−1)(-1,1,-1) and (−1,−1,1)(-1,-1,1). Every interior point of these lines other than the centre occurs for exactly one triple of parameters. When aa, bb and cc are pairwise different, no pair of opposite edges has four equal cross edges, so each of these tetrahedra is a counterexample. Two examples are given with the parameters in closed form. Finally, for quadrisecting planes, e=f=g=4e=f=g=4, an isosceles tetrahedron has a regular Morley tetrahedron only if it is regular.

A mix of human-written and AI-generated textHuman understanding: some parts$p$-secting planeMorley tetrahedronMorley's theoremdihedral angledisphenoidisosceles tetrahedron
Oct 23, 202610 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.MG — Metric Geometry

A counterexample to the table conjecture on the sphere

Contributed by Pablo Soberón

We disprove Matschke's table conjecture, which asserts that every continuous real-valued function on S2S^2 takes a common value on the vertices of some rotated copy of every prescribed inscribed square. The counterexample is the cubic polynomial H(x,y,z)=14z3−6z+y+xzH(x,y,z)=14z^3-6z+y+xz and a square contained in a plane at distance 1/71/\sqrt{7} from the origin. We give an elementary proof.

Primarily human-written textHuman understanding: all partscounterexamplefixed pointsquare-peg
Oct 23, 20265 pages
PDFView work

math.MG — Metric Geometry

Densest packings of two translates of a lattice in five dimensions

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

We prove that no packing of unit balls in R5\R^5 whose centres form two translates of a lattice is denser than the D5D_5 lattice packing. Up to congruence exactly three such packings attain this density: 2 D5\sqrt2\,D_5, a layered packing of Leech, and the packing with Szöllősi's kissing configuration.

A mix of human-written and AI-generated textHuman understanding: some parts$D_5$ latticeRyshkov polyhedronSphere packingVoronoi celldeep holeperiodic packing
Oct 22, 202618 pages
PDFView work

math-ph — Mathematical Physics

Beyond the Event Horizon: An Operator-First Theory of Persistent Geometry and Black Hole Dynamics

Contributed by Jeromie Beasley

A black hole carries one wall of each kind. Its horizon is a geometric fold: in the right coordinate it is smooth, and nothing breaks there. Its innermost stable circular orbit is a spectral wall, a Jordan block where steady circling turns into a plunge. This paper builds both kinds of wall exactly in a setting where every step can be proved and computed, and then compares them, structurally, with black holes. The setting is the shape space of four bodies. Its kinetic metric is the Bures metric of a real qutrit, and its one genuine wall, the coplanar configurations, is a fold at finite distance. Across it a tetrahedron meets its mirror image. The transport operator A(H) = TH + HT − 2Tr(TH)G is self-adjoint in the kinetic metric. Read in the Gram frame, its back-coupling vanishes like σ₃², and it forms a Jordan block whose square-root branch is exactly the orientation double cover. Lifted to the cover, it is analytic, and the wall point is a plain double point at the tip of a cone with slope 2|t₁−t₂|√(1−δ²). Both readings are exact. What a single eigenvector reports can fail at the wall; the eigenvalue pair and its trace-log ledger come through exact, and a loop through the mirror leaves a sign. New in edition 10 - Reflection and refraction on the projector metric. A wave meeting a step in the metric reflects through the metric along the step and the Clairaut constant C alone: Γ = (√(a₁−C) − √(a₂−C)) / (√(a₁−C) + √(a₂−C)). The transverse metric drops out at a sharp step. Total reflection begins exactly where a geodesic turns, so the optical threshold is a turning point. A change of spectral gap reflects with the peel coordinate tanh(½ ln Δ₂/Δ₁). - One Gram determinant does two jobs: it sets the wave admittance, and it caps the Berry curvature a path can feel (the angle safeguard of the intrinsic quantum geometric tensor). - Mirror and matched load. The polar stratum is a perfect mirror, |Γ| = 1. A Killing horizon, polar in the same sense, is a matched load, Γ = 0. - The photon ring, read by the same generator as the ISCO: each half orbit dims an image by e^−π = 0.0432, a value that belongs to the uncharged hole alone; charge lowers it. - The fermion record: its offset is a point on the same reflection chart, tanh(ħω/2k_BT_H). - The reflection tests were pre-registered before they ran, and each was pushed several ways: 400 random sharp steps, three smooth profiles, reciprocity, flux balance, the transverse metric in a thick layer, total reflection, and the gap form. Main results - The coplanar wall is a fold, and its distance is a Bures angle: arcsin√ε = arccos√F. - Quantum Fisher information on the shape space is eight times the shape kinetic energy wherever the rank is constant, and fidelity is blind to the mirror. - Two kinds of wall: spectral (a Jordan block in every frame) and geometric (a fold that a signed coordinate unfolds). The ISCO is spectral, at the point where gravity's effective power p = 2 + 6M/r reaches the inverse cube. The horizon is geometric. - Any distance potential is even across the wall, with stiffness 2∂V/∂w₃. A thin disk holds the shape at its own frequency ν. Gravity holds the square at ω = √(2(2√2−1)); its exact potential along the lifted square is given in closed form, and its stiffness turns over for a rhombus thinner than diagonal ratio k* = 0.144557. - Structural comparisons: Petrov types through Majorana stars (Kerr is type D), merging ringdown overtones, the horizon's surface resistance as a matched load (376.73 Ω), Bell violation by a Hawking pair, Ramanujan's mock theta functions, and the mirror rule for knots. The metric throughout is the intrinsic kinetic metric of the shape space, never a spacetime metric. Every statement about black holes is a structural comparison, and every claim carries its grade (derived, measured, cited, or structural) where it is made. Files - bh_paper_v10_1.pdf: the paper (56 pages). - bh_paper_v10_1.html: the web edition, with its cover; it runs no scripts. - bh_mixer_v10.html: the Event Horizon Mixer, edition 10. It runs offline in any browser and computes every curve live: the photon-ring orbits, the layered step, the reflection chart with the horizon and the fermion record, the sine guard, and the tip-and-tail matrices. Its Synchronize mode drives every eye from one wall dial, and its "Synchronize the universe" eye shows the connection energy draining as a ring of fields falls into step. - bh_v10_1_code_and_sources.zip: LaTeX source, figures, every check script with its saved output, the pre-registrations, the proof log and the ideas ledger, and a README. Each script states its kill condition before it runs (Python 3: numpy, scipy, sympy, mpmath, matplotlib). AI-assisted: the ideas and research direction are the author's; AI tools were used for literature search, computation, drafting and typesetting, and every number was checked by the scripts in the archive.

A mix of human-written and AI-generated textHuman understanding: some parts
Oct 20, 202656 pages
PDFView work

math.PR — Probability

Gaussian weights on fractals and Edelman's ghosts and shadows

Contributed by Djalil Chafaï

Can a Gaussian on a noninteger-dimensional fractal give a probabilistic realization of Edelman's ghosts and shadows? We distinguish a Gaussian-weighted Hausdorff measure, a radial Gaussian law, and a Gaussian random vector or field. For every real β>1\beta>1, we construct a closed cone of Hausdorff dimension β\beta whose Gaussian-weighted β\beta-dimensional Hausdorff measure has exactly the χβ\chi_\beta radial distribution. The construction relies on exact radial volume growth, not merely on a dimension calculation. We prove a metric obstruction below dimension one and explain why the cone does not supply ordinary Gaussian addition or a scalar algebra. A separate Gram-determinant argument rules out preserving all polynomially continued Euclidean Gaussian Gram identities in a positive model. We then give proofs of the angular beta-gamma identities, associativity of Bessel-Kingman convolution, and its Gaussian convolution semigroup for β≥1\beta\geq1. Squared Bessel processes, tridiagonal and bidiagonal matrix models, Dunkl Gaussians, and Gaussian fields on fractals provide complementary constructions with explicitly different meanings of dimension. None of these statements asserts the existence of a full noninteger-dimensional scalar algebra.

Primarily AI-generated textHuman understanding: no partsRandom matrices; fractals; hypergroups
Oct 18, 202611 pages
PDFView work

math.MG — Metric Geometry

An explicit finite cylinder cover of the regular tetrahedron saving 3.86×10−43.86\times10^{-4} below the half-area bound

Contributed by Ricardo Pinho

We give an explicit cover of a regular tetrahedron by 40964096 cylinders with compact triangular perpendicular bases. The sum of their base areas, divided by the tetrahedron's minimum orthogonal projection area, lies in [0.499613830783714148, 0.499613830783714149)[0.499613830783714148,\,0.499613830783714149). Thus the saving below 1/21/2 exceeds 0.0003861692162858510.000386169216285851. The construction uses a finite tilt in the angular-sector framework of OpenAI's September 2026 preprint and rationally specified radial cutoffs. Coverage is certified by exact linear-programming dual witnesses, and independently verified by exhaustive rational polyhedron clipping. We describe the geometric reduction, the certificate obligations, and reproducible verification of the full closed tetrahedron and the perpendicular base areas. No optimality is asserted.

Primarily AI-generated textHuman understanding: some parts
Oct 17, 20265 pages
PDFView work

math.MG — Metric Geometry

A converse to the discrete four-vertex theorem

Contributed by Kristoffer Josefsson

Tabachnikov asked whether every cyclic sequence of positive numbers with at least two local maxima and two local minima is the sequence of radii of the circles through consecutive vertex triples of a convex polygon whose circumcenters lie inside the corresponding vertex angles. We prove this for every n ≥ 4, with extrema counted as plateaus. This is the sharp form: by Dahlberg’s discrete four-vertex theorem the condition is also necessary for nonconstant sequences. Locally near every nonconstant admissible sequence the polygon can be chosen to depend continuously (indeed C1) on the sequence, but in general not globally: we give an explicit path of admissible hexagon data along which no continuous choice of realizing polygons exists. The existence and continuity results are formalized in Lean 4 with Mathlib. We also prove the corresponding characterization for circles tangent to three consecutive supporting lines, using a separate tangential-polygon construction and Wegner’s forward theorem.

A mix of human-written and AI-generated textHuman understanding: all partsfour-vertex theorempolygons
Oct 17, 202626 pages
PDFView work

math.CO — Combinatorics

No lattice tiling of Z35\mathbb{Z}^{35} or Z805\mathbb{Z}^{805} by Lee balls of radius three

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

We prove that there is no lattice tiling of Z35\mathbb{Z}^{35} or of Z805\mathbb{Z}^{805} by Lee balls of radius three. These were the only cases left open by Xiao and Zhou among the Lee balls of dimension at least three and radius at least two with fewer than 2302^{30} points, so the lattice Golomb--Welch conjecture holds for all of them.

A mix of human-written and AI-generated textHuman understanding: some partsGolomb-Welch conjectureLee metricgroup ringlattice tilingperfect code
Oct 17, 202613 pages
PDFView work