arxiv: 2605.09871 · v1 · submitted 2026-05-11 · 🧮 math.CO

Recognition: 2 theorem links

· Lean Theorem

A proof of purely singular splitting conjecture

Ka Hin Leung, Tao Zhang

Pith reviewed 2026-05-12 05:03 UTC · model grok-4.3

classification 🧮 math.CO

keywords purely singular splittingfinite abelian groupscyclic groupsWoldar conjecturegroup splittingscombinatorial group theoryabelian group factorizations

0 comments

The pith

Finite abelian groups admit a purely singular splitting by {1,2,...,k} precisely when they are the cyclic groups of orders 1, k+1, and 2k+1.

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

The paper proves Woldar's 1995 conjecture by classifying exactly which finite abelian groups G have a subset S such that the products of elements from M={1,2,...,k} with S cover every non-zero element of G. Such a splitting is purely singular when every prime dividing the order of G divides at least one number in M. A sympathetic reader would care because the result gives a complete list of the groups for which this covering is possible, settling a question on the existence of these special transversals in abelian groups.

Core claim

The finite abelian groups admitting a purely singular splitting by the set {1,2,…,k} are precisely the cyclic groups of orders 1, k+1, and 2k+1. A splitting by M means there exists S subset G such that M·S = G minus the zero element, and it is purely singular if every prime divisor of the group order divides some element of M.

What carries the argument

The purely singular splitting condition on M = {1,2,...,k}, which requires both a covering subset S for the non-identity elements and that all primes dividing |G| divide some m in M.

If this is right

Only the three listed cyclic groups admit a purely singular splitting by {1,2,...,k}.
No non-cyclic finite abelian group admits such a splitting.
Cyclic groups whose orders differ from 1, k+1 and 2k+1 fail to admit the splitting.
The splitting exists precisely for the three cyclic cases named in the conjecture.

Where Pith is reading between the lines

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

The same classification approach may extend to other fixed sets M that satisfy similar arithmetic conditions.
Direct enumeration of small-order groups for small k supplies an independent computational check of the result.
The proof supplies a template for resolving existence questions about transversals in other classes of finite groups.

Load-bearing premise

The splitting condition and the purely singular prime-divisor requirement apply uniformly to every finite abelian group and every positive integer k without hidden exceptions.

What would settle it

A single finite abelian group G that is not cyclic of order 1, k+1 or 2k+1, yet possesses a subset S with M·S exactly equal to G minus zero and satisfying the prime-divisor condition on M, would disprove the classification.

read the original abstract

A set $M$ of nonzero integers is said to split a finite abelian group $G$ if there exists a subset $S\subseteq G$ such that $M\cdot S = G\setminus\{0\}$. Such a splitting is called purely singular if every prime divisor of $|G|$ divides some element of $M$. In 1995, Woldar \cite{W1995} conjectured that the finite abelian groups admitting a purely singular splitting by the set $\{1,2,\dots,k\}$ are precisely the cyclic groups of orders $1$, $k+1$, and $2k+1$. In this paper, we prove this conjecture.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper claims to prove a conjecture whose statement contradicts the definition it gives, so the central claim is false.

read the letter

The main thing here is that the conjecture as written cannot be true. The paper states that a splitting by M = {1, ..., k} is purely singular precisely when every prime dividing |G| divides some element of M. It then claims the only finite abelian groups that admit such a splitting are the cyclic ones of orders 1, k+1, and 2k+1. For any k > 1 where k+1 is prime, the group of order k+1 has prime factor p = k+1 > k, so p divides none of the elements in M. By the definition the paper itself supplies, this G cannot have a purely singular splitting at all, yet the claimed classification includes it. The same problem hits 2k+1 whenever that number is prime. This is not a boundary case; it rules out the statement for infinitely many k right from the start, before any proof is attempted. The abstract supplies no lemmas or case analysis, so there is no way to see how the argument was supposed to work around this. The full text may contain the details, but they would have to overcome a direct contradiction with the given definition. Nothing in the work looks new once the statement is recognized as false. The citation pattern is ordinary for the topic and does not change the issue. This paper is not useful to anyone working on splittings or abelian group decompositions. A reader would get more from the 1995 conjecture paper and a few small-k checks than from this. It does not merit sending out for refereeing.

Referee Report

2 major / 0 minor

Summary. The manuscript claims to prove Woldar's 1995 conjecture: the finite abelian groups G that admit a purely singular splitting by the set M = {1, 2, ..., k} are precisely the cyclic groups of orders 1, k+1, and 2k+1. A splitting requires a subset S ⊆ G with M · S = G ∖ {0}, and it is purely singular when every prime dividing |G| divides some element of M.

Significance. The result, if correct, would resolve a 30-year-old conjecture in combinatorial group theory with a complete characterization. However, the stated conjecture is internally inconsistent with the paper's own definition of 'purely singular,' rendering the central claim false for infinitely many k (e.g., whenever k+1 or 2k+1 is prime). This undermines any significance.

major comments (2)

[Abstract and §1] Abstract and §1 (conjecture statement): The characterization includes cyclic groups of order p = k+1 when p is prime. By the definition of purely singular splitting (every prime divisor of |G| must divide some m ∈ M), this is impossible because p > k cannot divide any integer in {1, ..., k}. The same holds for order 2k+1 when prime. This directly falsifies the conjecture as stated, before any proof is considered. The manuscript supplies no correction or restriction on k that would resolve the contradiction.
[Definition section] Definition of purely singular splitting (likely §2): The condition is load-bearing for the entire characterization, yet the listed groups C_{k+1} and C_{2k+1} violate it by construction for prime cases. No case analysis or exception handling appears to address this; the proof cannot establish a false statement.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for identifying the inconsistency between the stated conjecture and the definition of a purely singular splitting. We agree that the current formulation requires correction, and we will revise the manuscript to resolve this issue.

read point-by-point responses

Referee: [Abstract and §1] Abstract and §1 (conjecture statement): The characterization includes cyclic groups of order p = k+1 when p is prime. By the definition of purely singular splitting (every prime divisor of |G| must divide some m ∈ M), this is impossible because p > k cannot divide any integer in {1, ..., k}. The same holds for order 2k+1 when prime. This directly falsifies the conjecture as stated, before any proof is considered. The manuscript supplies no correction or restriction on k that would resolve the contradiction.

Authors: We agree that the referee has correctly identified an inconsistency. When k+1 or 2k+1 is prime, the corresponding cyclic group cannot satisfy the purely singular condition because its unique prime divisor exceeds k. In the revised manuscript we will restate the conjecture to include the cyclic groups of orders k+1 and 2k+1 only when these orders are composite. This restriction ensures that every prime divisor of |G| is at most k and therefore divides an element of M. We will add an explanatory remark in the introduction clarifying the adjustment and its necessity for consistency with the definition. revision: yes
Referee: [Definition section] Definition of purely singular splitting (likely §2): The condition is load-bearing for the entire characterization, yet the listed groups C_{k+1} and C_{2k+1} violate it by construction for prime cases. No case analysis or exception handling appears to address this; the proof cannot establish a false statement.

Authors: We acknowledge that the definition section does not currently contain case analysis for prime-order groups or explicit restrictions. In the revision we will expand the discussion of the purely singular condition to include these cases, state the corrected characterization, and adjust the proof to establish the revised statement. The core arguments of the paper remain applicable once the statement is restricted to the consistent cases. revision: yes

Circularity Check

0 steps flagged

No circularity: proof of external 1995 conjecture

full rationale

The paper is a direct proof of Woldar's externally stated conjecture from 1995 (cited as W1995). The derivation consists of group-theoretic arguments establishing which finite abelian groups admit a purely singular splitting by M={1,...,k}. No parameters are fitted to data, no result is renamed as a prediction, and no self-citation or ansatz is used to justify the central characterization. The logic does not reduce by construction to its own inputs; the claim is independent of the present paper's definitions or prior results by the same authors. This is a standard self-contained mathematical proof.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The claim rests on the standard axioms of finite abelian groups and the given definitions of splitting and purely singular splitting. No free parameters, new entities, or ad-hoc assumptions appear in the abstract.

axioms (1)

standard math Standard axioms of finite abelian groups together with the definitions of splitting and purely singular splitting.
The entire statement is phrased inside ordinary group theory; no additional axioms are invoked in the abstract.

pith-pipeline@v0.9.0 · 5392 in / 1187 out tokens · 62488 ms · 2026-05-12T05:03:22.500656+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear
Conjecture 1. If S(k) splits a finite abelian group G purely singularly, then G is one of Z1, Z_{k+1}, or Z_{2k+1}.
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear
k - floor(k/p) = p^beta d m' with d=gcd(...) and subsequent valuation counting leading to beta=alpha-1

Reference graph

Works this paper leans on

43 extracted references · 43 canonical work pages

[1]

Buzaglo and T

S. Buzaglo and T. Etzion. Tilings withn-dimensional chairs and their applications to asymmetric codes.IEEE Trans. Inform. Theory, 59(3):1573–1582, 2013

work page 2013
[2]

T. Etzion. Product constructions for perfect Lee codes.IEEE Trans. Inform. Theory, 57(11):7473–7481, 2011

work page 2011
[3]

Etzion.Perfect codes and related structure

T. Etzion.Perfect codes and related structure. World Scientific, 2022

work page 2022
[4]

Galovich and S

S. Galovich and S. Stein. Splittings of abelian groups by integers.Aequationes Math., 22(2-3):249–267, 1981

work page 1981
[5]

S. W. Golomb and L. R. Welch. Perfect codes in the Lee metric and the packing of polyominoes.SIAM J. Appl. Math., 18:302–317, 1970

work page 1970
[6]

Z. Guan, H. Wei, and Z. Xiang. On lattice tilings of asymmetric limited-magnitude balls B(n,2, m, m−1). arXiv: 2501.08636

work page arXiv
[7]

Hamaker and S

W. Hamaker and S. Stein. Splitting groups by integers.Proc. Amer. Math. Soc., 46:322– 324, 1974

work page 1974
[8]

Hamaker and S

W. Hamaker and S. Stein. Combinatorial packing ofR 3 by certain error spheres.IEEE Trans. Inform. Theory, 30(2, part 2):364–368, 1984

work page 1984
[9]

Hickerson

D. Hickerson. Splittings of finite groups.Pacific J. Math., 107(1):141–171, 1983

work page 1983
[10]

Hickerson and S

D. Hickerson and S. Stein. Abelian groups and packing by semicrosses.Pacific J. Math., 122(1):95–109, 1986

work page 1986
[11]

P. Horak. On perfect Lee codes.Discrete Math., 309(18):5551–5561, 2009

work page 2009
[12]

P. Horak. Tilings in Lee metric.European J. Combin., 30(2):480–489, 2009

work page 2009
[13]

Horak and B

P. Horak and B. F. AlBdaiwi. Diameter perfect Lee codes.IEEE Trans. Inform. Theory, 58(8):5490–5499, 2012

work page 2012
[14]

Horak and D

P. Horak and D. Kim. 50 years of the Golomb-Welch conjecture.IEEE Trans. Inform. Theory, 64(4, part 2):3048–3061, 2018

work page 2018
[15]

Kløve, B

T. Kløve, B. Bose, and N. Elarief. Systematic, single limited magnitude error correcting codes for flash memories.IEEE Trans. Inform. Theory, 57(7):4477–4487, 2011. 9

work page 2011
[16]

Kløve, J

T. Kløve, J. Luo, I. Naydenova, and S. Yari. Some codes correcting asymmetric errors of limited magnitude.IEEE Trans. Inform. Theory, 57(11):7459–7472, 2011

work page 2011
[17]

Kløve, J

T. Kløve, J. Luo, and S. Yari. Codes correcting single errors of limited magnitude.IEEE Trans. Inform. Theory, 58(4):2206–2219, 2012

work page 2012
[18]

K. H. Leung, R. Tao, D. Wang, and T. Zhang. On lattice tilings ofZn by limited magnitude error ballsB(n,2, k 1, k2) withk 1 > k 2. arXiv: 2505.08495

work page arXiv
[19]

K. H. Leung and Y. Zhou. No lattice tiling ofZ n by Lee sphere of radius 2.J. Combin. Theory Ser. A, 171:105157, 20, 2020

work page 2020
[20]

Minkowski.Diophantische Approximationen

H. Minkowski.Diophantische Approximationen. Teubner, Leipzig, 1907

work page 1907
[21]

K. A. Post. Nonexistence theorems on perfect Lee codes over large alphabets.Information and Control, 29(4):369–380, 1975

work page 1975
[22]

Schwartz

M. Schwartz. Quasi-cross lattice tilings with applications to flash memory.IEEE Trans. Inform. Theory, 58(4):2397–2405, 2012

work page 2012
[23]

Schwartz

M. Schwartz. On the non-existence of lattice tilings by quasi-crosses.European J. Combin., 36:130–142, 2014

work page 2014
[24]

S. Stein. Factoring by subsets.Pacific J. Math., 22:523–541, 1967

work page 1967
[25]

S. Stein. Packings ofR n by certain error spheres.IEEE Trans. Inform. Theory, 30(2, part 2):356–363, 1984

work page 1984
[26]

S. Stein. The notched cube tilesR n.Discrete Math., 80(3):335–337, 1990

work page 1990
[27]

S. K. Stein and S. Szab´ o.Algebra and tiling, volume 25 ofCarus Mathematical Monographs. Mathematical Association of America, Washington, DC, 1994. Homomorphisms in the service of geometry

work page 1994
[28]

S. Szab´ o. Some problems on splittings of groups.Aequationes Math., 30(1):70–79, 1986

work page 1986
[29]

S. Szab´ o. Some problems on splittings of groups. II.Proc. Amer. Math. Soc., 101(4):585– 591, 1987

work page 1987
[30]

U. Tamm. Splittings of cyclic groups and perfect shift codes.IEEE Trans. Inform. Theory, 44(5):2003–2009, 1998

work page 2003
[31]

Wei and M

H. Wei and M. Schwartz. On tilings of asymmetric limited-magnitude balls.European J. Combin., 100:Paper No. 103450, 21, 2022. 10

work page 2022
[32]

A. J. Woldar. A reduction theorem on purely singular splittings of cyclic groups.Proc. Amer. Math. Soc., 123(10):2955–2959, 1995

work page 1995
[33]

Xie and J

D. Xie and J. Luo. Asymmetric single magnitude four error correcting codes.IEEE Trans. Inform. Theory, 66(9):5322–5334, 2020

work page 2020
[34]

Xie and J

D. Xie and J. Luo. New results on asymmetric single correcting codes of magnitude four. IEEE Trans. Inform. Theory, 67(8):5079–5087, 2021

work page 2021
[35]

S. Yari, T. Kløve, and B. Bose. Some codes correcting unbalanced errors of limited mag- nitude for flash memories.IEEE Trans. Inform. Theory, 59(11):7278–7287, 2013

work page 2013
[36]

Z. Ye, T. Zhang, X. Zhang, and G. Ge. Some new results on Splitter sets.IEEE Trans. Inform. Theory, 66(5):2765–2776, 2020

work page 2020
[37]

Zhang and G

T. Zhang and G. Ge. New results on codes correcting single error of limited magnitude for flash memory.IEEE Trans. Inform. Theory, 62(8):4494–4500, 2016

work page 2016
[38]

Zhang and G

T. Zhang and G. Ge. Perfect and quasi-perfect codes under thel p metric.IEEE Trans. Inform. Theory, 63(7):4325–4331, 2017

work page 2017
[39]

Zhang and G

T. Zhang and G. Ge. On the nonexistence of perfect splitter sets.IEEE Trans. Inform. Theory, 64(10):6561–6566, 2018

work page 2018
[40]

Zhang and G

T. Zhang and G. Ge. On linear diameter perfect Lee codes with distance 6.J. Combin. Theory Ser. A, 201:Paper No. 105816, 26, 2024

work page 2024
[41]

Zhang, Y

T. Zhang, Y. Lian, and G. Ge. On lattice tilings ofZ n by limited magnitude error balls B(n,2,1,1).IEEE Trans. Inform. Theory, 69(11):7110–7121, 2023

work page 2023
[42]

Zhang, X

T. Zhang, X. Zhang, and G. Ge. Splitter sets andk-radius sequences.IEEE Trans. Inform. Theory, 63(12):7633–7645, 2017

work page 2017
[43]

Zhang and Y

T. Zhang and Y. Zhou. On the nonexistence of lattice tilings ofZ n by Lee spheres.J. Combin. Theory Ser. A, 165:225–257, 2019. 11

work page 2019