Pith. sign in

REVIEW 2 major objections 6 minor 24 references

When Do Subset Sums in Finite Abelian Groups Support $2$-Designs?

T0 review · 2 major / 6 minor · reviewed 2026-07-31 · grok-4.5

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

Pith's one-line read Subset-sum blocks form a nontrivial 2-design only when the underlying group is elementary abelian.

desk verdict Solid classification that settles Pavone’s question for every x, via clean character-sum constraints on the dual; the bookkeeping checks out. read the letter →

arxiv 2607.24426 v1 pith:PVIJTIVJ submitted 2026-07-27 math.CO

Hengfeng Liu , Chunming Tang , Cuiling Fan , Zhengchun Zhou This is my paper
classification math.CO MSC 05B0505E3020K0111B30
keywords subsetsumsfiniteabeliangroups2-designscharacterRamanujanadditivedesignselementaryp-groups
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper asks when the k-subsets of a finite abelian group G that sum to a fixed element x form the blocks of a combinatorial design. Earlier work settled the question for elementary abelian p-groups. Here the authors prove that no other finite abelian group can support a nontrivial 2-design of this type, for any sum value x. They obtain the result by translating the design condition into equalities among character sums, then reading those equalities as constraints on the dual group. Along the way they give a complete criterion for the weaker 1-design property and simple arithmetic necessary conditions (involving the exponent of G and k) that hold for arbitrary finite abelian groups. The result closes an open question of Pavone and fully classifies which groups can produce subset-sum 2-designs.

What carries the argument

A character-sum identity that expresses the squared block sums E_χ as a constant plus a weighted sum of Ramanujan sums over cyclic subgroups of the dual group containing ⟨χ⟩; constancy of E_χ for a 2-design then forces the weighted sum to be independent of the cyclic subgroup, which is inverted by Möbius techniques on the poset of cyclic subgroups.

What would settle it

Exhibit any non-elementary finite abelian group G, any x in G and any admissible k for which the family of k-subsets summing to x is nevertheless a 2-design with positive λ, or verify by direct computation that the character-sum identity of Theorem 3.6 fails for a small mixed-order group such as Z_2 × Z_4.

Watch

Extended reading notes

Core claim

For every finite abelian group G, every x in G and every k with 2 ≤ k ≤ |G|−1, the incidence structure whose points are the elements of G and whose blocks are the k-subsets summing to x is a nontrivial 2-design only if G is an elementary abelian p-group. Combined with the known classification inside the elementary abelian case, this completely determines when subset-sum families yield 2-designs.

Load-bearing premise

The derivation that isolates the character-dependent part of each squared block sum as exactly that explicit weighted sum of Ramanujan sums must be free of algebraic error; if the binomial coefficients or the grouping by cyclic subgroups are incorrect, the later structural constraints on the dual group collapse.

Editorial extensions

If this is right

  • No nontrivial t-design with t ≥ 2 can arise from subset-sum blocks over a group that is not elementary abelian.
  • The complete 1-design criterion for arbitrary finite abelian groups specializes to the earlier p-group characterization and supplies the necessary condition gcd(k, exp(G)) > 1.
  • Any 2-design forces the stronger arithmetic condition exp(G) divides k.
  • The only groups that can appear in strongly additive designs built from all zero-sum k-subsets are elementary abelian p-groups.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same character-sum constancy method may obstruct higher designs or partial geometries built from other additive constraints (e.g., fixed product of differences).
  • Because elliptic-curve codes realize subset sums in groups that are rarely elementary abelian, the theorem sharply limits when those codes can support 2-designs of minimum-weight words.
  • An algorithmic check of the Ramanujan-sum identity on all groups of order up to a few hundred would give an independent machine verification of the coefficient extraction.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 6 minor

Summary. The paper studies when the incidence structure $(G,\mathcal B_k^x)$ of $k$-subsets of a finite abelian group $G$ summing to $x$ is a block design. The main result (Theorem 1.1) answers a question of Pavone in a stronger form: for any $x\in G$ and $2\le k\le |G|-1$, if $(G,\mathcal B_k^x)$ is a $2$-(|G|,k,\lambda)$ design with $\lambda>0$, then $G$ is elementary abelian. The proof is character-theoretic: constancy of the block character sums $E_\chi$ (Proposition 3.5) is expanded via character orthogonality into a sum over cyclic subgroups $C\le\widehat G$ containing $\langle\chi\rangle$, with explicit coefficients $A_d$ (Theorem 3.6, Eq. (11)). Möbius inversion on the poset of cyclic subgroups (Lemmas 2.4–2.5) then yields $\exp(G)\mid k$ (Proposition 3.7), elementary-abelianness of each Sylow component (Theorem 4.1, via the localization Proposition 4.2 and the binomial estimate Lemma 4.7), and finally a sign argument excluding multiple primary components. The same machinery gives a complete characterization of subset-sum 1-designs over arbitrary finite abelian groups (Theorem 3.2) and the arithmetic restrictions $\gcd(k,\exp G)>1$ and $\exp(G)\mid k$.

Significance. If correct — and I believe it is — this settles Pavone's 2023 open question in a strictly stronger form (all $x$, not just $x=0$) and, combined with Falcone–Pavone and Pavone's elementary-abelian results, completes the classification of subset-sum $2$-designs over finite abelian groups. The derivation is fully self-contained from standard tools (character orthogonality, primary decomposition, Ramanujan sums, poset Möbius inversion), involves no free parameters or case-specific numerics, and yields explicit, checkable arithmetic criteria ($\gcd(k,\exp G)>1$, $\exp(G)\mid k$) that are new at this generality. The complete 1-design characterization (Theorem 3.2), subsuming the recent $p$-group result of [14], is a useful byproduct. The character-theoretic method itself — converting the 2-design condition via the concurrence-matrix identity into constraints on the poset of cyclic subgroups of $\widehat G$ — appears genuinely new and is likely to have further applications to subset-sum and additive-design questions.

major comments (2)
  1. [Proposition 3.7 / Eq. (11)] Prop. 3.7 (and similarly Prop. 4.6, Lemma 4.8, and the a_j=1 case of Theorem 1.1) asserts 'A_q \neq 0 by Eq. (11)' for q | gcd(k,e). This is correct but not immediate from (11): one needs k \le n-q to guarantee binom(n/q-2, k/q-1) \neq 0. The needed argument is that q | gcd(k,e) and e | n imply q | gcd(k,n), so q | n-k, and k \le n-1 then forces n-k \ge q. Since the contradictions in Prop. 3.7 and Thm. 4.1 hinge on this nonvanishing, the one-line justification should be stated explicitly where first used (ideally as a remark after Eq. (11) giving the exact range on which A_d \neq 0).
  2. [Theorem 3.6, Eq. (11)] Eq. (11) uses the binomial coefficient binom(n/d-2, k/d-1). When d = n (i.e., G cyclic and chi a generator), the top parameter is -1 and the coefficient must be read as a generalized binomial coefficient; the extraction in (19)-(20) remains valid in that case, but the convention should be stated so that (11) is unambiguous for all nontrivial chi. A one-line convention suffices.
minor comments (6)
  1. [Proposition 3.5] Proof of Prop. 3.5 ends with 'E_\chi = (r-\lambda)n,' — comma instead of period, and the sentence reads as truncated.
  2. [Notation] The symbol d is overloaded: ord(eta) in Theorem 3.6, d_p for p-rank in Section 2.2, and d = exp(\widehat G^{(p)}) in Section 4 (where A_{dp} then means A evaluated at d·p). Renaming the Section 4 quantity (e.g., d^{(p)}) would ease reading.
  3. [Theorem 3.6] In the proof of Theorem 3.6, the 'Consequently' clause (constancy of (13) over nontrivial cyclic C_0) could use one clause of justification: each nontrivial cyclic C_0 equals <chi> for a nontrivial chi, and Proposition 3.5 makes E_chi constant over nontrivial chi.
  4. [Proof of Theorem 4.1] Eq. (27) (N \ge \ell^2) would benefit from one extra line: |S|/p^\alpha = p^{\sum \alpha_i - \alpha_r} \ge p^{2(r-1)} since \alpha_i \ge 2 for i < r.
  5. [References] Reference [14], on which the recovered 1-design specialization (Remark 3.4) depends, is an arXiv preprint by (partially) the same authors; please indicate its publication status at revision.
  6. [Lemma 4.3] In Lemma 4.3, the count |R(D)| = \phi(p^s)|S[p]|/\phi(p^{s+1}) is compressed; spelling out that the kernel of y \mapsto y^p is S[p] (already invoked) would make the display self-contained.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the 2-design classification is a self-contained character-sum derivation, not a fit or self-citation loop.

full rationale

Theorem 1.1 is obtained by converting the 2-design axiom into constancy of E_χ (Proposition 3.5), expanding that quantity via generating functions and Ramanujan sums (Theorem 3.6), then applying poset/Möbius arguments and primary decomposition to force exp(Ĝ_p)=p and a single prime (Section 4). None of these steps defines the conclusion into the hypothesis: the binomial coefficients A_d, the grouping by cyclic subgroups, and the absorption of χ-independent terms into β are algebraic identities derived in-place. Prior work (Falcone–Pavone, Pavone, Li–Wan, Kosters, and the authors’ p-group 1-design paper [14]) appears only as motivation or as special cases recovered by the new criteria (Remark 3.4, Proposition 3.3); none is invoked as a uniqueness theorem that already contains Theorem 1.1. There is no parameter fitting, no ansatz smuggled via citation, and no renaming of a known empirical pattern. The derivation chain is therefore independent and non-circular.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

Pure existence/classification theorem in finite abelian groups. No fitted parameters. Load-bearing background is standard character theory, primary decomposition, Ramanujan sums, and Möbius inversion on finite posets, plus the already-published elementary-abelian classifications used only for context.

assumptions (5)
  • standard math Orthogonality of characters of a finite abelian group and the Fourier inversion formula on G.
    Used throughout §§2–3 to convert design constancy into vanishing of nontrivial Fourier coefficients (Eqs. (1)–(4), Thm 3.2, Prop 3.5).
  • standard math Primary decomposition of finite abelian groups and the structure of p-torsion subgroups (including p-rank).
    Invoked in §2.2 and throughout §4 to split Ĝ = Ĝ_p × Ĝ_{(p)} and reduce to elementary p-groups.
  • standard math Möbius inversion for the upper zeta transform on a finite poset (Lemmas 2.4–2.5).
    Applied to the poset of nontrivial cyclic subgroups of Ĝ to pass from constant upper sums to pointwise vanishing or the (1−|R(a)|)κ formula (Prop 3.7, Lem 4.4).
  • standard math Elementary evaluation of Ramanujan sums on cyclic subgroups of prime-power order (Remark 2.3).
    Supplies the nonzero values R_C(x) ∈ {p−1,−1} and the bound |R_C| ≤ φ(p^a) used in the contradictions of §§3–4.
  • domain assumption Known classification of subset-sum 2-designs over elementary abelian p-groups (Falcone–Pavone; Pavone).
    Cited to complete the ‘if and only if’ picture once Theorem 1.1 forces G to be elementary abelian; not used inside the proof of the necessity statement itself.

how reviews work

0 comments
Cite this review

Pith. "Pith review of When Do Subset Sums in Finite Abelian Groups Support $2$-Designs?." pith.science (2026). https://pith.science/paper/PVIJTIVJ

@misc{pith2026260724426,
  author       = {Pith},
  title        = {Pith review of: When Do Subset Sums in Finite Abelian Groups Support $2$-Designs?},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PVIJTIVJ}},
  note         = {Machine review of arXiv:2607.24426}
}
abstract

Subset sums over finite abelian groups lie at the intersection of additive combinatorics, design theory, and coding theory. Let $G$ be a finite abelian group, and let $\cB_k^x$ be the family of $k$-subsets of $G$ whose elements sum to $x\in G$. This paper studies when the incidence structure $(G,\cB_k^x)$ is a block design. The elementary abelian $p$-group case was settled by Falcone and Pavone. Pavone (\emph{Des. Codes Cryptogr.} 91 (2023), 2585--2603) further asked whether, for an arbitrary finite abelian group $G$, the zero-sum incidence structure $(G,\cB_k^0)$ can be a nontrivial $2$-design only when $G$ is an elementary abelian $p$-group. We settle this open question in the stronger form that, for every $x\in G$, $(G,\cB_k^x)$ can be a nontrivial $2$-design only if $G$ is an elementary abelian $p$-group. The proof develops a character-theoretic approach to subset-sum designs, using character sums over the blocks to constrain the structure of the character group $\widehat G$. The approach also yields a complete characterization of subset-sum $1$-designs and general arithmetic restrictions on subset-sum designs over arbitrary finite abelian groups, extending the corresponding results previously known for finite abelian $p$-groups.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

24 extracted references · 12 canonical work pages

  1. [14]

    H. Liu, C. Tang, C. Fan, R. Luo, Combinatorial t-designs from finite abelian groups and their applications to elliptic curve codes, arXiv preprint arXiv:2506.00429, 2025. https://doi.org/10. 48550/arXiv.2506.00429

    arXiv doi:10.48550/arxiv.2506.00429 2025

  2. [1]

    T. Beth, D. Jungnickel, H. Lenz,Design Theory, vol. I, second ed., Cambridge University Press, Cambridge, 1999.https://doi.org/10.1017/CBO9780511549533

    work page doi:10.1017/cbo9780511549533 1999

  3. [2]

    Buratti, M

    M. Buratti, M. Galici, A. Montinaro, A. Naki´ c, A. Wassermann,EApqq-additive Steiner 2-designs, J. Algebr. Comb. 63 (2026) 50.https://doi.org/10.1007/s10801-026-01535-6

    work page doi:10.1007/s10801-026-01535-6 2026

  4. [3]

    Buratti, F

    M. Buratti, F. Merola, A. Naki´ c, Additive combinatorial designs, Des. Codes Cryptogr. 93 (2025) 2717–2740.https://doi.org/10.1007/s10623-025-01594-z

    work page doi:10.1007/s10623-025-01594-z 2025

  5. [4]

    Caggegi, G

    A. Caggegi, G. Falcone, M. Pavone, On the additivity of block designs, J. Algebr. Comb. 45 (2017) 271–294.https://doi.org/10.1007/s10801-016-0707-5. 15

    work page doi:10.1007/s10801-016-0707-5 2017

  6. [5]

    Cheng, Hard problems of algebraic geometry codes, IEEE Trans

    Q. Cheng, Hard problems of algebraic geometry codes, IEEE Trans. Inf. Theory 54 (2008) 402–406. https://doi.org/10.1109/TIT.2007.911213

    arXiv 2008

  7. [6]

    C. Ding, C. Tang,Designs from Linear Codes, second ed., World Scientific, Singapore, 2022. https://doi.org/10.1142/12697

    work page doi:10.1142/12697 2022

  8. [7]

    Falcone, M

    G. Falcone, M. Pavone, Binary Hamming codes and Boolean designs, Des. Codes Cryptogr. 89 (2021) 1261–1277.https://doi.org/10.1007/s10623-021-00853-z

    work page doi:10.1007/s10623-021-00853-z 2021

Show all 24 references
  1. [8]

    D. Han, Y. Ren, The maximal length of q-ary MDS elliptic codes is close to q{2, Int. Math. Res. Not. 11 (2024) 9036–9043.https://doi.org/10.1093/imrn/rnad271

    2024 doi

  2. [9]

    R. M. Karp, Reducibility among combinatorial problems, in: R. E. Miller, J. W. Thatcher (Eds.),Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85–103. https://doi.org/10.1007/978-1-4684-2001-2_9

    1972 doi

  3. [10]

    Kosters, The subset sum problem for finite abelian groups, J

    M. Kosters, The subset sum problem for finite abelian groups, J. Comb. Theory Ser. A 120 (2013) 527–530.https://doi.org/10.1016/j.jcta.2012.10.006

    2013 doi

  4. [11]

    J. Li, D. Wan, On the subset sum problem over finite fields, Finite Fields Appl. 14 (2008) 911–929. https://doi.org/10.1016/j.ffa.2008.05.003

    2008 doi

  5. [12]

    J. Li, D. Wan, Counting subset sums of finite abelian groups, J. Comb. Theory Ser. A 119 (2012) 170–182.https://doi.org/10.1016/j.jcta.2011.07.003

    2012 doi

  6. [13]

    J. Li, D. Wan, J. Zhang, On the minimum distance of elliptic curve codes, in: 2015 IEEE International Symposium on Information Theory (ISIT), IEEE, 2015, pp. 2391–2395. https: //doi.org/10.1109/ISIT.2015.7282884

    2015

  7. [15]

    H. Liu, C. Tang, Z. Zhou, D. Han, H. Chen, A generic construction of q-ary near-MDS codes supporting 2-designs with lengths beyond q` 1, IEEE Trans. Inf. Theory 72 (2026) 3899–3909. https://doi.org/10.1109/TIT.2026.3681279

    2026

  8. [16]

    R. C. Merkle, M. E. Hellman, Hiding information and signatures in trapdoor knapsacks, IEEE Trans. Inf. Theory 24 (1978) 525–530.https://doi.org/10.1109/TIT.1978.1055927

    1978

  9. [17]

    Pavone, Subset sums and block designs in a finite vector space, Des

    M. Pavone, Subset sums and block designs in a finite vector space, Des. Codes Cryptogr. 91 (2023) 2585–2603.https://doi.org/10.1007/s10623-023-01213-9

    2023 doi

  10. [18]

    K. G. Ramanathan, Some applications of Ramanujan’s trigonometrical sum Cmpnq, Proc. Indian Acad. Sci. Sect. A 20 (1944) 62–69.https://doi.org/10.1007/BF03048959

    1944 doi

  11. [19]

    Serre,A Course in Arithmetic, Springer-Verlag, New York, 1973

    J.-P. Serre,A Course in Arithmetic, Springer-Verlag, New York, 1973. https://doi.org/10. 1007/978-1-4684-9884-4

    1973

  12. [20]

    R. P. Stanley,Enumerative Combinatorics, vol. 1, second ed., Cambridge University Press, Cambridge, 2012.https://doi.org/10.1017/CBO9781139058520

    2012 doi

  13. [21]

    Wan, NP-hardness of SVP in Euclidean space, arXiv preprint arXiv:2603.27398, 2026

    D. Wan, NP-hardness of SVP in Euclidean space, arXiv preprint arXiv:2603.27398, 2026. https: //doi.org/10.48550/arXiv.2603.27398. 16

    2026 doi arXiv

  14. [22]

    Zhang, D

    J. Zhang, D. Wan, K. Kaipa, Deep holes of projective Reed–Solomon codes, IEEE Trans. Inf. Theory 66 (2020) 2392–2401.https://doi.org/10.1109/TIT.2019.2940962

    2020

  15. [23]

    Zhang, D

    J. Zhang, D. Wan, On deep holes of elliptic curve codes, IEEE Trans. Inf. Theory 69 (2023) 4498–4506.https://doi.org/10.1109/TIT.2023.3257320

    2023

  16. [24]

    Zhuang, Q

    J. Zhuang, Q. Cheng, J. Li, On determining deep holes of generalized Reed–Solomon codes, IEEE Trans. Inf. Theory 62 (2016) 199–207.https://doi.org/10.1109/TIT.2015.2496325. 17

    2016

Pith tools

Reviewed July 31, 2026 · model on record in the stance chip above.