REVIEW 4 major objections 5 minor 25 references
Generalized Theta Series of a Lattice
T0 review · 4 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash
Pith's one-line read The paper introduces a sublattice-volume theta series and uses it to disprove the secrecy gain conjecture for isodual lattices.
desk verdict A promising but under-specified new lattice invariant; the counterexample is potentially important but not proven. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The key object is the r-th generalized $\theta$ series, a lattice analogue of the generalized Hamming weight enumerator. It is defined as $\Theta_\Lambda^{(r)}(z)=\sum_{\{a_i\}_{i=1}^r\subseteq\Lambda\cap B(r\lambda_1^{(m)}),\,\mathrm{rank}(A)=r} q^{\det(AA^T)}$ with $q=e^{i\pi z}$ and $A^T=[a_1^T,\ldots,a_r^T]$, so each term contributes the squared volume of the generated sublattice and each unordered set is counted once. The argument is carried by the leading exponent of each series, the r-th generalized Euclidean norm $\nu_r(\Lambda)$, the minimum squared volume of an r-dimensional sublattice, which connects the invariant to the r-dimensional densest sublattice problem and lets the authors compute enough terms to pin down the ratio $\Delta_\Lambda(\tau)$ for their counterexamples.
What would settle it
An independent enumeration of the sublattices of Λ_{A_4}(C_3) could settle the disproof: if the second generalized $\theta$ series does not contain the term $144 q^{3/4}$ with the stated multiplicity, or if $\Delta_{\Lambda_{A_4}(C_3)}(1)$ computes to at most 1, the counterexample to the secrecy gain conjecture collapses.
Extended reading notes
Core claim
The central discovery is that the secrecy gain conjecture fails for isodual lattices and hence for formally unimodular lattices. The paper exhibits two six-dimensional Construction A lattices over Z4, obtained from isodual codes, and computes enough of their first and second generalized $\theta$ series to evaluate the $\theta$ series ratio ΔΛ(τ) = ΘΛ(iτ)/Θ_{Z^n}(iτ). For Λ_{A_4}(C_3), the ratio at τ = 1 is about 1.0026, strictly greater than one, and τ = 1 is the symmetry point where the ratio reaches its maximum; for Λ_{A_4}(C_4), the ratio still exceeds one for some τ even though its minimum sits at τ = 1. These volume-one isodual lattices therefore invalidate the conjecture that the global minimum of the ratio is always at τ = 1, as stated in the isodual and formally unimodular versions.
Load-bearing premise
The load-bearing premise is that the generalized theta series is a well-defined lattice invariant, meaning each term counts an unambiguous set of r-dimensional sublattices inside the stated ball and the result does not depend on arbitrary choices of vectors or the ordering of shortest vectors.
Editorial extensions
If this is right
- The invariant refines audibility: two lattices with the same ordinary theta series can be told apart when their generalized theta series differ, which the paper demonstrates for a pair of Construction A lattices from codes.
- Computing the leading term of each generalized theta series solves the r-dimensional densest sublattice problem, giving a computational handle on sublattice volumes.
- The generalized Euclidean norm hierarchy gives a necessary condition for stability, since a stable lattice must have all r-dimensional minimum sublattice volumes at least one.
- The isodual and formally unimodular counterexamples mean the secrecy gain claim cannot be used as a universal design guarantee for wiretap lattice codes from these families, and any such guarantee must be argued case by case or under extra hypotheses.
- For the exhibited lattices, the symmetry point of the theta series ratio is not always its minimum, so the weak secrecy gain at τ = 1 does not automatically bound the eavesdropper's error probability in the intended way.
Reading between the lines
- Editorial inference: if the generalized theta series is as sensitive as the examples suggest, it gives a natural fingerprint for the lattice isomorphism problem, though the paper itself notes the computations are too costly to threaten cryptographic schemes.
- Editorial inference: the role of the index m in the ball radius rλ_1^{(m)} is not fully pinned down in the paper; a direct check of whether the series is independent of the chosen ordering of shortest vectors would decide whether coefficients beyond the leading term are canonical.
- Editorial inference: the counterexamples suggest that the secrecy gain conjecture might survive only for restricted subfamilies such as stable or extremal lattices; a systematic scan of all isodual lattices in small dimension would show how often τ = 1 is actually the minimum.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces a lattice analog of the generalized Hamming weight of linear codes, called the generalized theta series, together with the r-th generalized Euclidean norm (r-th minimum sublattice volume). The authors claim this series is a new lattice invariant with applications to stable-lattice detection and to the lattice isomorphism problem. They also present examples of isodual (and hence formally unimodular) lattices for which the theta series ratio exceeds 1 at the symmetry point tau=1, and claim this disproves the secrecy-gain conjecture for isodual lattices [14, Conj. 1] and its formal-unimodular generalization [12, Conj. 37].
Significance. If the generalized theta series were a well-defined isometry invariant, it would be a genuinely useful new tool, connecting the determinant and the theta series and potentially distinguishing non-isometric lattices that share the same ordinary theta series. The paper is commendably transparent that some displayed coefficients are numerical and not covered by Lemma 1, and it correctly credits [22] for the determinantal minima. The counterexample to the secrecy-gain conjecture for isodual lattices, if verified, would be a significant negative result for a conjecture that has been open for a decade. However, the central definition is not well posed as written, and the main counterexample is not self-contained, so the advertised claims are not presently established.
major comments (4)
- [Definition 6, Eq. (1)] The summation index m is not quantified in (1): the radius B(r*lambda_1^(m)) contains a free parameter m, but no summation over m or convention for choosing m is given, while the accompanying text identifies m with the position of a term in the ordered list of sublattice volumes. Since the radius is chosen from the same ordering of volumes it is supposed to define, the series is circular as written. Consequently the coefficients displayed in Examples 2 and 4 cannot be independently recovered from Definition 6, and the authors' own caveat in Example 4 that the boldfaced coefficients are only numerical and not guaranteed by Lemma 1 confirms that the higher terms are not pinned down. Because isometry invariance is asserted only for the (undefined) series, the applications in Section V-A to stable-lattice detection and to lattice hearing are not supported until Definition 6 is replaced by a well-posed definition with an explicit enumeration rule or diagonal convention.
- [Section V-B, Examples 5 and 6] The discussion of Conjecture 1 is logically misplaced. Conjecture 1 is quantified over stable lattices, but both Lambda_{A4}(C3) and Lambda_{A4}(C4) are shown to be non-stable in the same examples. The sentence in Example 5 that Delta_Lambda(1)>1 'demonstrates that Conjecture 1 is not true for isodual lattices' is therefore misleading, and Example 6's statement that Delta_Lambda(tau)>1 'reveals that Conjecture 1 does not hold for this isodual lattice' is not a violation of the conjecture as stated. The authors should either remove these remarks or clearly state that they concern a different, non-stable class of lattices.
- [Example 5] The central counterexample to Conjecture 2, and hence to [12, Conj. 37], is not self-contained. The key numerical fact Delta_{Lambda_{A4}(C3)}(1) approx 1.0026 is only referenced to [13], and the isoduality of the construction is asserted via [24, Lemma 2.4] and [25, p. 378] without reproducing the relevant details. Since the paper's main advertised result is the invalidation of the secrecy-gain conjecture, the manuscript should provide a checkable computation: for instance, the exact theta series coefficients used to plot Fig. 3, or a rigorous inequality Delta_{Lambda_{A4}(C3)}(1) > 1 derived from a finite initial segment with a bound on the tail.
- [Section II-B, Preliminaries] The sentence 'Given that formally unimodular lattices are also isodual' states the implication in the wrong direction; the true implication is that every isodual lattice is formally unimodular, and formally unimodular lattices need not be isodual. The extension of the counterexample to [12, Conj. 37] should be justified by the correct inclusion isodual subset formally unimodular, as is done later in Example 5, not by the stated inclusion.
minor comments (5)
- [Abstract] There is an extra space before the period in 'generalized theta series .'.
- [Example 3] The notation for the scaled lattice in Example 3 is visually unclear; please specify clearly which generator matrix is used for the equivalent lattice and how the scaling factor alpha enters Proposition 1.
- [Fig. 2 caption] The caption 'a = -8, n = 5' is cryptic; the parameters a and n should be explained so that the geometric meaning of the figure is self-contained.
- [Notation throughout Section V] The notation Lambda_{A4}(C3) is confusing because A4 may be read as the lattice A_4; consider writing Lambda_{A_4}(C3) or Lambda_{Z_4}(C3).
- [References [5] and [19]] References [5] and [19] are the same work by Regev and Stephens-Davidowitz; please unify the citation or explain why both versions are needed.
Circularity Check
No significant circularity: the counterexample is carried by an explicit lattice, its isoduality, and a prior peer-reviewed theta-ratio computation ([13]); the generalized theta series is not an input to that computation.
full rationale
The paper's main negative claim does not feed on its own definition. Example 5 specifies a Z4 code C3, forms the Construction A lattice ΛA4(C3), asserts isoduality from [25] and [13, Sec. III-B], and then uses the ordinary theta-series ratio to report Δ(1)≈1.0026>1, with the numerical computation deferred to [13]. That computation is not fitted to any parameter of the present paper and it does not assume the conjecture being disproved; [13] is a peer-reviewed, explicit-lattice computation and therefore counts as external evidence even though it is a self-citation. The generalized theta series and generalized Euclidean norms are used to exhibit instability and to illustrate the new invariant, but the counterexample's ratio is not derived from them, so no prediction reduces by construction to an input. The only serious weakness in the manuscript is Definition 6 / Eq. (1): the index m is never quantified, and the paper itself concedes in Example 4 that the non-minimum coefficients were obtained numerically and are not guaranteed by Lemma 1. This is a well-posedness and reproducibility concern, not a circular derivation, and it applies to the new invariant's applications rather than to the independent counterexample. Accordingly I find no significant circularity.
Assumptions & free parameters
assumptions (4)
- ad hoc to paper The r-th generalized theta series defined in Definition 6 is a well-defined lattice invariant.
- domain assumption The numerical values for theta series ratios in Examples 5 and 6, taken from [13], are exact enough to locate global extrema of Delta_Lambda(tau).
- standard math Construction A from an isodual bordered double circulant Z4 code yields an isodual lattice.
- standard math Lemma 1 of [15] justifies restricting attention to vectors up to length r*lambda_1.
Cite this review
Pith. "Pith review of Generalized Theta Series of a Lattice." pith.science (2026). https://pith.science/paper/4AIZAXPM
@misc{pith2026250703178,
author = {Pith},
title = {Pith review of: Generalized Theta Series of a Lattice},
year = {2026},
howpublished = {\url{https://pith.science/paper/4AIZAXPM}},
note = {Machine review of arXiv:2507.03178}
}
abstract
Mimicking the idea of the generalized Hamming weight of linear codes, we introduce a new lattice invariant, the generalized theta series. Applications range from identifying stable lattices to the lattice isomorphism problem. Moreover, we provide counterexamples for the secrecy gain conjecture on isodual lattices, which claims that the ratio of the theta series of an isodual (and more generally, formally unimodular) lattice by the theta series of the integer lattice $\mathbb{Z}^n$ is minimized at a (unique) symmetry point.
Figures
Reference graph
Works this paper leans on
-
[13]
Secrecy gain of formally unimodular lattices from codes over the integers modulo 4,
——, “Secrecy gain of formally unimodular lattices from codes over the integers modulo 4,” IEEE Trans. Inf. Theory , vol. 70, no. 5, pp. 3309–3329, May 2024
work page 2024
-
[22]
On approximating the covering radius and finding dense lat- tice subspaces,
D. Dadush, “On approximating the covering radius and finding dense lat- tice subspaces,” 2018, available at author’s website: https://homepages. cwi.nl/~dadush/papers/voronoi-slice.pdf
work page 2018
-
[1]
Generalized Hamming weights for linear codes,
V . K. Wei, “Generalized Hamming weights for linear codes,” IEEE Trans. Inf. Theory, vol. 37, no. 5, pp. 1412–1418, Sep. 1991
work page 1991
-
[2]
J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, 3rd ed. New York, NY , USA: Springer, 1999
work page 1999
-
[3]
J. H. Conway and F. Y . C. Fung, The Sensual (quadratic) Form . Mathematical Association of America, 2009
work page 2009
-
[4]
Ternary positive definite quadratic forms are determined by their theta series,
A. Schiemann, “Ternary positive definite quadratic forms are determined by their theta series,” Math. Ann., vol. 308, no. 3, pp. 507–517, Jul. 1997
work page 1997
-
[5]
O. Regev and N. Stephens-Davidowitz, “A reverse Minkowski theorem,” in Proc. 49th Annu. ACM Symp. Theory Comput. (STOC), Montreal, QC, Canada, June 19–23, 2017, pp. 941–953
work page 2017
-
[6]
A simple proof of a reverse Minkowski theorem for integral lattices
——, “A simple proof of a reverse Minkowski theorem for integral lattices,” Jun. 2023, arXiv:2306.03697v1 [math.MG]
work page Pith review arXiv 2023
Show all 25 references
-
[7]
Unimodular lattices for the Gaussian wiretap channel,
J.-C. Belfiore and P. Solé, “Unimodular lattices for the Gaussian wiretap channel,” in Proc. IEEE Inf. Theory Workshop (ITW) , Dublin, Ireland, Aug. 30 – Sep. 3, 2010
2010
-
[8]
On a conjecture by Belfiore and Solé on some lattices,
A.-M. Ernvall-Hytonen, “On a conjecture by Belfiore and Solé on some lattices,” IEEE Trans. Inf. Theory , vol. 58, no. 9, pp. 5950–5955, Sep. 2012
2012
-
[9]
Gaussian wiretap lattice codes from binary self- dual codes,
F. Lin and F. Oggier, “Gaussian wiretap lattice codes from binary self- dual codes,” in Proc. IEEE Inf. Theory Workshop (ITW) , Lausanne, Switzerland, Sep. 3–7, 2012
2012
-
[10]
A classification of unimodular lattice wiretap codes in small dimensions,
——, “A classification of unimodular lattice wiretap codes in small dimensions,” IEEE Trans. Inf. Theory , vol. 59, no. 6, pp. 3295–3303, Jun. 2013
2013
-
[11]
The Belfiore-Solé conjecture and a certain technique for verifying it for a given lattice,
J. Pinchak and B. A. Sethuraman, “The Belfiore-Solé conjecture and a certain technique for verifying it for a given lattice,” in Proc. Inf. Theory Appl. Workshop (ITA), Univ. California , San Diego, CA, USA, Feb. 9–14, 2014
2014
-
[12]
Formally unimodular pack- ings for the Gaussian wiretap channel,
M. F. Bollauf, H.-Y . Lin, and Ø. Ytrehus, “Formally unimodular pack- ings for the Gaussian wiretap channel,” IEEE Trans. Inf. Theory, vol. 69, no. 12, pp. 7755–7776, Dec. 2023
2023
-
[14]
Lattice codes for the wiretap Gaussian channel: Construction and analysis,
F. Oggier, P. Solé, and J.-C. Belfiore, “Lattice codes for the wiretap Gaussian channel: Construction and analysis,” IEEE Trans. Inf. Theory , vol. 62, no. 10, pp. 5690–5708, Oct. 2016
2016
-
[15]
Algorithms for the densest sub- lattice problem,
D. Dadush and D. Micciancio, “Algorithms for the densest sub- lattice problem,” in Proc. Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), New Orleans, LA, USA, Jan. 6–8, 2013, pp. 1103–1122
2013
-
[16]
Stability and new non-abelian zeta functions,
L. Weng, “Stability and new non-abelian zeta functions,” in Number Theoretic Methods , S. Kanemitsu and C. Jia, Eds. New York, NY , USA: Springer, 2002, pp. 405–419
2002
-
[17]
Extended and generalized weight enumera- tors,
R. Jurrius and R. Pellikaan, “Extended and generalized weight enumera- tors,” in Proc. Int. Workshop Coding Cryptography (WCC) , Ullensvang, Norway, May 10–15, 2009, pp. 76–91
2009
-
[18]
Zamir, Lattice Coding for Signals and Networks
R. Zamir, Lattice Coding for Signals and Networks . Cambridge, U.K.: Cambridge University Press, 2014
2014
-
[19]
A reverse Minkowski theorem,
O. Regev and N. Stephens-Davidowitz, “A reverse Minkowski theorem,” Ann. Math., vol. 199, no. 1, Jan. 2024
2024
-
[20]
On the maximum theta series over unimodular lattices,
M. F. Bollauf and H.-Y . Lin, “On the maximum theta series over unimodular lattices,” Mar. 2024, arXiv:2403.16932v2 [math.MG]
2024 arXiv
-
[21]
Micciancio and S
D. Micciancio and S. Goldwasser, Complexity of Lattice Problems: A Cryptographic Perspective. Boston, MA, USA: Springer, 2002
2002
-
[23]
On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography,
L. Ducas and W. van Woerden, “On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography,” in Proc. 41st Annu. Int. Conf. Theory Appl. Crypto. Techn. (EUROCRYPT) , Trond- heim, Norway, May 30 – Jun. 3, 2022, pp. 643–673
2022
-
[24]
Isodual codes over Z2k and isodual lattices,
C. Bachoc, T. A. Gulliver, and M. Harada, “Isodual codes over Z2k and isodual lattices,” J. Algebraic Combinatorics , vol. 12, no. 3, pp. 223–240, 2000
2000
-
[25]
W. C. Huffman and V . Pless, Fundamentals of Error-Correcting Codes. Cambridge, U.K.: Cambridge University Press, 2003
2003
Reviewed August 6, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.