Pith. sign in

REVIEW 3 major objections 2 minor 17 references

The two-point linear programming bound for five-dimensional sphere packings that fiber over translates of A3 is strictly larger than 1, so the bound cannot certify the conjectured center density in that case.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · deepseek-v4-flash

2026-08-01 02:56 UTC pith:FEDIINYR

load-bearing objection The D5/A3 gap and the E6/D4 collapse are real results, but the headline negative claim currently lives in the ancillary files. the 3 major comments →

arxiv 2607.25254 v1 pith:FEDIINYR submitted 2026-07-28 math.MG math.FAmath.OC

Linear Programming Bounds for Fibered Sphere Packings

Andrew Salmon This is my paper
classification math.MG math.FAmath.OC MSC 52C1711H3143A3590C48
keywords sphere packinglinear programming boundsfibered packingspositive definite functionsstrong dualitycomplementary slacknessBarnes–Wall latticediscrete reduction
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper develops a single linear programming (LP) framework for sphere packings that are fibered over translates of a fixed lattice—packings built from parallel layers, each a translate of a lower-dimensional packing. It proves that these LP bounds always have optimal primal and dual solutions satisfying complementary slackness, and it shows that in many low-dimensional cases the bounds are sharp, recovering the best known packing densities with prescribed translational symmetry, including a sharp bound for 16-dimensional packings fibered over E8. The central new result is negative: for the five-dimensional problem fibered over A3 (the D5/A3 case), the two-point translation-invariant colored LP has value at least 289801/288000, strictly above the conjectured optimal center density of 1. Consequently, this LP cannot prove the five-dimensional center-density conjecture, even though the conjecture may be true. The paper also shows that the two-point LP for the E6-over-D4 problem is sharp if and only if the ordinary two-dimensional sphere packing LP is sharp, tying a fibered problem to the unresolved planar case.

Core claim

On its own terms, the paper's central discovery is a pair of theorems. First, the C-constrained LP on X = R^k × A, where A is any compact abelian group, satisfies strong duality with attainment on both sides; the dual optimum is achieved by a positive-definite tempered measure, and any optimal pair satisfies complementary slackness. Second, applying this to the cylinder X = R^k × R^m/L and to finite phase groups, the paper constructs exact certificates: a triangular function certifies sharp bounds for one-dimensional aligned packing over every fiber lattice of dimension at most 7; for the 16-dimensional Barnes–Wall lattice fibered over E8, the E8 magic function serves as a sharp cylinder cer

What carries the argument

The central object is a single linear program on the group X = R^k × A, where A is a compact abelian group (a torus for cylinder problems, a finite group for colored problems). The primal minimizes f(0) over continuous, integrable, positive-definite functions f that are nonpositive on a closed forbidden-difference set C and have total integral 1. The dual maximizes the Fourier coefficient bμ({(0,1)}) over nonnegative tempered measures supported on {0}∪C with μ({0})=1. The paper proves strong duality, primal and dual attainment, and complementary slackness for every C, and uses functoriality of the bound under group homomorphisms to move certificates between finite color groups and tori. The

Load-bearing premise

The load-bearing premise is that the rational certificate for the D5/A3 discrete reduction obeys the no-wrap condition m ≥ 2s·max_δ d_δ, which prevents differences from wrapping around the quotient; the paper asserts this but does not display the certificate.

What would settle it

Run the exact-arithmetic verification of the ancillary certificate: check the chosen s and m satisfy m ≥ 2s·max(√2, √(5/4), 1, √(5/4)) and that bμ(η,χ) ≥ 0 for all (η,χ) in (Z/mZ)^k × Z/4; if either fails, the D5/A3 lower bound is invalid. Alternatively, search numerically for a two-point colored LP feasible function with value ≤1; a certified counterexample would falsify Theorem 26.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • If the paper's framework is correct, any optimal aligned packing in the solved k=1 cases must have its centers on an arithmetic progression with gap g and consecutive phases differing by deep holes of the fiber lattice; this gives an unconditional classification of tight one-dimensional aligned packings up to isometry.
  • The collapse theorem implies that a sharp magic function for the two-dimensional hexagonal packing would immediately yield a sharp cylinder LP for D4-fibered packings in R6, and conversely any sharpness of the E6/D4 colored LP would produce a planar magic function.
  • The Barnes–Wall lattice is certified as the optimal 16-dimensional packing among those fibering over E8 translates, with base density 1 and ambient center density 1/16.
  • In the D5/A3 problem, since the two-point colored LP value is strictly greater than 1, no two-point translation-invariant certificate of the center-density bound exists; proving the conjecture requires higher-point bounds or additional assumptions.
  • The general duality theorems imply that for any prescribed translational symmetry, the corresponding LP bound is a well-posed optimization problem with an attained optimum, so numerical or analytic searches for optimal certificates are guaranteed to converge to a true bound.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The D5/A3 gap is only as strong as the ancillary certificate: because the paper does not show the chosen s, m, or the rational function, an independent reader should run the exact verification before relying on Theorem 26; this is an expositional gap, not a mathematical one.
  • The collapse theorem for E6 over D4 raises the possibility that other flexible colorings (e.g., larger elementary abelian groups over the hexagonal lattice) also force the two-point LP to collapse to a lower-dimensional problem; this could be tested numerically with high-degree polynomial certificates.
  • The discrete-reduction method likely extends to other fibered problems where the phase group is finite, such as D7-fibered packings in dimension 8 or other root-lattice fibers; exact rational lower bounds might reveal additional non-sharp cases.
  • If the planar two-dimensional LP is ever proven sharp, then the E6/D4 bound and its cylinder analogue become sharp as well; conversely, if the planar LP is non-sharp, the fibered problem inherits that non-sharpness, making the two problems equivalent.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 2 minor

Summary. The paper develops a linear programming (LP) framework for sphere packings on R^k × A, where A is a compact abelian group, specializing to fibered packings with prescribed translational symmetry. It claims primal and dual attainment, strong duality, functoriality, and complementary slackness for these programs. The paper presents exact sharpness results for k=1 aligned fibered packings, a D8 fluid-diamond family, periodizations from E8 and E24 magic functions, and a Barnes–Wall torus certificate. It proves a collapse theorem for the E6-over-D4 problem, linking its two-point colored LP to the planar Cohn–Elkies LP. Finally, using Li's discrete reduction framework, it claims that the two-point colored LP for D5/A3 has value at least 289801/288000 > 1, and therefore cannot prove Cohn–Rajagopal's Conjecture 4.1.

Significance. If the main claims hold, the paper provides a broad duality framework for a natural class of packing problems and several new sharpness results, including the D5/A3 negative result, which would be a notable limitation on two-point LP approaches. Strengths include the detailed treatment of complementary slackness and the use of exact rational certificates (though the certificate itself is not shown). However, the central negative claim rests on an external certificate that is not described in the text, and one advertised sharpness theorem appears to contain a concrete numerical error. The paper would be significant after the certificate is made available and the Barnes–Wall proof is corrected.

major comments (3)
  1. [§5.1, Theorem 26] The proof of the advertised gap consists of invoking 'the exact rational certificate supplied in the accompanying reproducibility package.' The manuscript does not display the certificate, the chosen scale s, the modulus m, the function μ, or the verification of the no-wrap condition m ≥ 2s max_δ d_δ, which for the D5/A3 data means m ≥ 2√2 s. Since Theorem 25's conclusion requires all four hypotheses and the no-wrap inequality, and since the stated lower bound is an exact rational number, the numerical claim cannot be checked from the text. Please include the certificate and the chosen parameters in the manuscript or an appendix.
  2. [§3.4, Theorem 16] The proof asserts that the covering radius of L = √2 E8 is √2. With the paper's standard normalization (E8 root lattice with minimal squared norm 2), the covering radius of E8 is √2, so that of √2 E8 is 2, not √2. Therefore from d_X ≥ 2 one cannot deduce |x| ≥ √2; indeed |x|^2 ≥ 4 − d_T^2 may be 0. Consequently f(x,y) = F_E8(x) is not shown to be nonpositive on the cylinder, and the claimed sharp Barnes–Wall certificate is invalid. This is a load-bearing error in an advertised result; a correct covering-radius computation or a different certificate is needed.
  3. [§5 and §6.2] The discrete-reduction lower bound (and hence Theorem 26) relies on Proposition 6, whose proof uses the strong duality theorem, Theorem 3. Theorem 3 is imported from the preprint [3] and not proved; Section 6.2 only reconciles normalizations. Given that the central negative claim depends on this theorem, the manuscript should state the relevant result from [3] and verify all hypotheses, or give a self-contained proof. Otherwise the chain of implications has an unverified link.
minor comments (2)
  1. [Throughout] There are typographical issues such as 'in factequivalent' in the abstract and formatting artifacts in the references (e.g., 'Ga´ al'). A careful proofreading pass is needed.
  2. [Data Availability] The Data Availability statement mentions ancillary files, but no URL or file list is given. Referees and readers cannot access the certificates; please provide a stable link or include the essential data in the paper.

Circularity Check

0 steps flagged

No circular reduction found; central D5/A3 gap is a verification-gap (unshown ancillary certificate), not a circular step.

full rationale

The paper's derivation chain is largely self-contained. The general duality theorems (Sections 2 and 6) are proved in-text; the self-citations to [4] and [8] are pointers to proof techniques (e.g., "This is [4, Proposition 3.5] with a mollifier adapted...") and are not load-bearing premises, since the arguments are reproduced. The exactly solved cases (Theorems 11, 13, 15, 16) use explicit constructions verified against external magic functions (Viazovska, Cohn-Elkies), not fitted to target values. The E6/D4 collapse (Theorem 20) is a genuine equivalence proved from complementary slackness and coloring flexibility, not a renaming. The D5/A3 gap (Theorem 26) is a lower bound from a dual certificate; this is not circular because the certificate is asserted to be checked exactly and the reduction in Theorem 25 is general. Flagged as missing support rather than circularity: the certificate, the scale s, the integer m, and \hat\mu are not displayed in the text; Theorem 26's proof is the sentence "The exact rational certificate supplied in the accompanying reproducibility package satisfies the hypotheses of Theorem 25..." so the central numerical claim depends on an ancillary file. This affects verifiability, not circularity. No fitted parameter is renamed as a prediction, and the paper does not presuppose Conjecture 17 or 22. Score 2 reflects only non-load-bearing self-citations and the verification gap; no circular reduction was found.

Axiom & Free-Parameter Ledger

1 free parameters · 5 axioms · 0 invented entities

The paper's central claims rest on several standard cited results: the magic functions for E8 and the Leech lattice, the general duality theorem of [3], and the discrete reduction framework. No new physical entities or ad-hoc model parameters are introduced; the only algorithmic choices are the scale and modulus in the discrete reduction, which are not specified in the text.

free parameters (1)
  • scale s and modulus m in discrete reduction (D5/A3)
    These are chosen to satisfy the no-wrap condition m >= 2s max_delta d_delta for the D5/A3 certificate. The values are not stated in the paper; they are implicit in the ancillary certificate. The proof of Theorem 26 depends on their existence and correctness.
axioms (5)
  • standard math Existence of Viazovska's E8 magic function and the Leech-lattice magic function
    Used in Theorem 15, 16, and elsewhere as certified upper bounds for Euclidean packing. These are established results from the literature.
  • standard math Strong duality for the Delsarte problem on locally compact abelian groups (Berdysheva, Farkas, Gaál, Ramabulana, Révész [3])
    Theorem 3 is a specialization of [3, Theorem 5.3]. The paper does not prove this duality theorem itself.
  • standard math Continuity of the Fourier transform on positive definite measures (Moody–Strungaru [13])
    Used in Proposition 30 to pass to the limit in the dual attainment proof.
  • standard math Loeschian number counting (Bernays [2])
    Used in Theorem 20 to bound the number of zeros of the character channels.
  • standard math Discrete reduction framework of Li [11]
    Theorem 25 builds on this framework; the paper extends it to retain the color group.

pith-pipeline@v1.3.0-alltime-deepseek · 21910 in / 14681 out tokens · 138630 ms · 2026-08-01T02:56:30.179373+00:00 · methodology

0 comments
read the original abstract

We study linear programming (LP) bounds for sphere packings that fiber over translates of a fixed lattice of lower rank, as well as their dual formulations. In doing so, we place the work of Conway and Sloane on fibered packings in the context of linear programming bounds for packing problems on $\mathbb{R}^k \times A$, where $A$ is a compact abelian group. For these programs we prove that the primal and the dual both attain their optima, so that every instance has an optimal pair satisfying complementary slackness. We study cases in which the LP bounds considered here achieve the best known sphere packing densities in dimensions $\le 9$ with prescribed translational symmetry, recovering analogues of Propositions 2, 3, 5, and 8 of Conway and Sloane, and we show that the Barnes-Wall lattice achieves the optimal sphere packing density for any $16$-dimensional packing that fibers over translates of $E_8$. In dimension $6$, we show that the natural LP bound fibering over translates of $D_4$ is in fact equivalent to the LP bound in dimension $2$ for ordinary sphere packing, while the LP bound for $4$-dimensional packings that fiber over $A_2$ translates is implied by the LP bound in dimension $2$ but has additional rigid structure that may make it more tractable. Finally, using the discrete reduction framework of Li, we show that the linear programming bound for packings fibering over translates of $A_3$ is strictly above $1$, so the linear programming bound alone cannot prove Conjecture 4.1 of Cohn and Rajagopal.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

17 extracted references · 7 linked inside Pith

  1. [1]

    Argabright and J

    L. Argabright and J. Gil de Lamadrid,Fourier analysis of unbounded measures on locally compact abelian groups, Mem. Amer. Math. Soc., no. 145, American Mathematical Society, Providence, RI, 1974. 26

    1974

  2. [2]

    P. Bernays, ¨Uber die Darstellung von positiven, ganzen Zahlen durch die primitiven, bin¨ aren quadratischen Formen einer nicht-quadratischen Diskriminante, Dissertation, G¨ ottingen, 1912

    1912

  3. [3]

    E. E. Berdysheva, B. Farkas, M. Ga´ al, M. D. Ramabulana, and Sz. Gy. R´ ev´ esz,Duality for Delsarte’s extremal problem on locally compact Abelian groups, arXiv:2603.18287v3

    Pith/arXiv arXiv

  4. [4]

    H. Cohn, D. de Laat, and A. Salmon,Three-point bounds for sphere packing, arXiv:2206.15373v1

    Pith/arXiv arXiv

  5. [5]

    Cohn and N

    H. Cohn and N. Elkies,New upper bounds on sphere packings I, Ann. of Math.157(2003), 689–714

    2003

  6. [6]

    H. Cohn, A. Kumar, S. D. Miller, D. Radchenko, and M. Viazovska,The sphere packing problem in dimension 24, Ann. of Math.185(2017), 1017–1033

    2017

  7. [7]

    Cohn and I

    H. Cohn and I. Rajagopal,Variations on five-dimensional sphere packings, Discrete Comput. Geom. (2026),https://doi.org/10.1007/s00454-026-00841-x; arXiv:2412.00937

    Pith/arXiv arXiv 2026

  8. [8]

    Cohn and A

    H. Cohn and A. Salmon,Sphere packing bounds via rescaling, arXiv:2108.10936

    Pith/arXiv arXiv

  9. [9]

    J. H. Conway and N. J. A. Sloane,What are all the best sphere packings in low dimen- sions?, Discrete Comput. Geom.13(1995), no. 3–4, 383–403,https://doi.org/10.1007/ BF02574051

    1995

  10. [10]

    Gon¸ calves, D

    F. Gon¸ calves, D. Oliveira e Silva, and S. Steinerberger,Hermite polynomials, linear flows on the torus, and an uncertainty principle for roots, J. Math. Anal. Appl.451(2017), no. 2, 678–711; arXiv:1602.03366,https://doi.org/10.1016/j.jmaa.2017.02.030

    Pith/arXiv arXiv 2017

  11. [11]

    Li,Dual linear programming bounds for sphere packing via discrete reductions, Adv

    R. Li,Dual linear programming bounds for sphere packing via discrete reductions, Adv. Math. 460(2025), Paper No. 110043; arXiv:2206.09876

    Pith/arXiv arXiv 2025

  12. [12]

    Lov´ asz,On the Shannon capacity of a graph, IEEE Trans

    L. Lov´ asz,On the Shannon capacity of a graph, IEEE Trans. Inform. Theory25(1979), 1–7

    1979

  13. [13]

    R. V. Moody and N. Strungaru,Almost periodic measures and their Fourier transforms, in: Aperiodic Order, Vol. 2: Crystallography and Almost Periodicity (M. Baake and U. Grimm, eds.), Cambridge University Press, Cambridge, 2017, pp. 173–270

    2017

  14. [14]

    M. S. Osborne,On the Schwartz–Bruhat space and the Paley–Wiener theorem for locally compact abelian groups, J. Functional Analysis19(1975), 40–49

    1975

  15. [15]

    Spindeler and N

    T. Spindeler and N. Strungaru,On the (dis)continuity of the Fourier transform of measures, J. Math. Anal. Appl.499(2021), no. 2, Paper No. 125062; arXiv:2002.01544

    Pith/arXiv arXiv 2021

  16. [16]

    Schwartz,Th´ eorie des distributions, Hermann, Paris, 1966

    L. Schwartz,Th´ eorie des distributions, Hermann, Paris, 1966

    1966

  17. [17]

    Viazovska,The sphere packing problem in dimension 8, Ann

    M. Viazovska,The sphere packing problem in dimension 8, Ann. of Math.185(2017), 991– 1015. 27

    2017