Pith. sign in

REVIEW 3 minor 24 references

Sharp Asymptotics for Abelian Covers of Groups with Bounded Noncommutativity

T0 review · 0 major / 3 minor · reviewed 2026-08-27 · deepseek-v4-flash

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

Pith's one-line read The paper proves that the worst-case number of abelian subgroups needed to cover a group with no pairwise noncommuting set larger than $n$ grows like $\sqrt{2}^{\,n}$, up to a sharply quantified error.

desk verdict Sharp base sqrt(2) for h(n) is likely right; the p=3 scalar-clique check is the one load-bearing hand computation. read the letter →

arxiv 2608.20507 v1 pith:D5BT6Z4Q submitted 2026-08-20 math.GR math.CO

Guillaume Lecomte This is my paper · ORCID
classification math.GRmath.CO MSC 20D6020D1505C1505C69
keywords noncommutinggraphabeliancoverfinitep-groupsalternatingbilinearformsisoclinismchromaticnumberextremalcombinatoricsnilpotentgroups
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

Every finite group has two natural measures of noncommutativity: the size $\omega(G)$ of its largest pairwise noncommuting subset and the least number $a(G)$ of abelian subgroups needed to cover it. A long-standing quantitative problem asks how the worst-case covering number grows as a function of the allowed clique size. This paper proves that the extremal function satisfies $\log_2 h(n)=n/2+O(\sqrt{n}\,(\log(n+2))^3)$, and in particular $h(n)^{1/n}\to\sqrt{2}$: the worst case grows like $(1.414\ldots)^n$. The lower bound comes from extraspecial $2$-groups, and the upper bound is obtained by reducing to finite $p$-groups, reading noncommutation as alternating bilinear forms, and then passing from arbitrary finite groups to a nilpotent subgroup at negligible cost. A sympathetic reader should care because the result settles the exponential scale of the problem, and it also shows that asymptotically extremal examples must be essentially $2$-groups.

What carries the argument

The load-bearing object is a finite $p$-group $P$ together with a normal series $1=K_0<K_1<\cdots<K_L=P'$ whose successive quotients have order $p$ and lie in the centre. At each level, commutation modulo $K_{L-j-1}$ induces a nondegenerate alternating bilinear form $\phi_j$ on $V_j=A_j/R_j$, an $\mathbb{F}_p$-vector space; its rank $\rho_j$ is the unit of account. Two complementary constructions do the work: a spread cover by isotropic subspaces shows that the group can be covered by about $p^{\rho_j/2}$ subgroups, while orthogonal-anchor composition builds pairwise nonorthogonal sets of size roughly $\kappa_p\rho_j$ that force a clique of that size. Balancing the two gives the per-rank coefficient $\alpha_p=(\log_2 p)/(2\kappa_p)$, with $\kappa_2=1$, $\kappa_3=2$, $\kappa_p=p/2$ for $p\ge5$, so $\alpha_p\le1/2$ with equality only at $p=2$. Around this core, a nested-anchor estimate controls weak interaction between stages and an exact-centralization product argument controls strong interaction.

What would settle it

A reader could compute the 78 upper-triangular symplectic pairings among the 13 vectors listed in Lemma 4.4; if any pairing is zero, the $p=3$ clique-credit constant collapses and the upper-bound proof breaks. Alternatively, an exhaustive search over 13-element subsets of the 728 nonzero vectors of $\mathbb{F}_3^6$ for the displayed form would settle whether such a clique exists.

Watch

Extended reading notes

Core claim

The central claim is that the extremal exponential base is exactly $\sqrt{2}$: for $h(n)=\sup\{a(G):\omega(G)\le n\}$ one has $\log_2 h(n)=n/2+O(\sqrt{n}(\log(n+2))^3)$. Extraspecial $2$-groups provide the matching lower bound, so the constant cannot be lowered. On the upper-bound side the proof decomposes a finite group along a central series of its derived subgroup; each step produces a nondegenerate alternating form over $\mathbb{F}_p$, and the ratio between the logarithmic covering cost and the clique forced by one unit of symplectic rank is maximized at $p=2$. For every odd prime this ratio is strictly below $1/2$, which is why asymptotic extremality is confined to $2$-groups: any sequence of groups with $\log_2 a(G_r)=\omega(G_r)/2-o(\omega(G_r))$ must eventually have exactly one nonabelian Sylow subgroup, a $2$-group.

Load-bearing premise

The decisive load-bearing premise is a finite check in the $p=3$ case: the 13 listed vectors in $\mathbb{F}_3^6$ are pairwise nonorthogonal for the displayed alternating form, and if a single pairing vanished the claimed constant $\kappa_3=2$ would fail, leaving a gap in the upper bound.

Editorial extensions

If this is right

  • The worst-case covering number $h(n)$ satisfies $\log_2 h(n)=n/2+O(\sqrt{n}(\log(n+2))^3)$, so $h(n)^{1/n}\to\sqrt{2}$.
  • The least possible index $\iota(G)$ of an abelian subgroup obeys the same rate: $\log_2 i(n)=n/2+o(n)$, so $i(n)^{1/n}\to\sqrt{2}$.
  • Any sequence of groups reaching the extremal rate must asymptotically have exactly one nonabelian Sylow subgroup, and that subgroup must be a $2$-group.
  • For noncommuting graphs, the sharp asymptotic chromatic-versus-clique growth is $\sup\{\chi(\Gamma_G):\omega(\Gamma_G)\le n\}=2^{n/2+o(n)}$.
  • Within nilpotent groups, if at least two Sylow subgroups are nonabelian the rate drops to at most $n/3+o(n)$, so extremality is essentially confined to one nonabelian $2$-primary factor.

Reading between the lines

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

  • Beyond the paper, the location of the extremal constant in $p=2$ suggests that every near-extremal group should contain a large extraspecial $2$-section; the paper proves concentration at the Sylow level but does not fully extract such a structural embedding.
  • Beyond the paper, the finite $\mathbb{F}_3^6$ clique used to get $\kappa_3=2$ may be one member of an infinite family of small cliques in alternating spaces over odd fields; finding such families could replace the slack odd-prime bound by the exact constant.
  • Beyond the paper, the same central-series/alternating-form scheme should apply to other covering parameters such as covers by centralizers, where an analogous symplectic-rank constant would govern the growth.
  • Beyond the paper, the quasipolynomial extension via the centralizer of the derived subgroup is likely not optimal; a sharper bound on $[G:C_G(G')]$ would shrink the $O(\sqrt{n}(\log n)^3)$ error and may improve the qualitative error term.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Request a human review

A listed scientist reviews the paper for a fee and the review publishes here regardless of verdict. See the reviewers or get listed.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

0 major / 3 minor

Summary. The paper studies the extremal function h(n), the supremum over groups G with at most n pairwise noncommuting elements of the least number of abelian subgroups needed to cover G. Its main theorem, Theorem 2.2, states that log_2 h(n) = n/2 + O(sqrt(n) (log(n+2))^3), so h(n)^{1/n} tends to sqrt(2). The proof combines an isoclinism reduction to finite groups, a BFC-based control of conjugacy classes and the derived subgroup, a central-factor descent for finite p-groups using alternating forms and isotropic subspace covers, interaction estimates via nested-anchor and exact-centralization constructions, a Sylow-product analysis for nilpotent groups, and a quasipolynomial reduction to the nilpotent subgroup C_G(G'). The lower bound comes from extraspecial 2-groups. The paper also derives the same exponential rate for the minimum index of an abelian subgroup and shows that asymptotic extremality is concentrated in 2-groups.

Significance. If correct, the result settles the sharp exponential scale of Erdős's covering problem, improving Pyber's uniform exponential bounds to the exact base sqrt(2). The proof is modular and the main structural arguments are coherent: the finite reduction, the symplectic toolkit, the branch-cover bound, the weak- and strong-interaction mechanisms, and the final error balance are independently checkable. I specifically checked the load-bearing p=3 finite verification in Lemma 4.4: the displayed 78 upper-triangular Gram entries are all nonzero and match the listed vectors, so the claimed value kappa_3 = 2 is valid. The lower and upper bounds are derived by independent mechanisms, so the matching constant is not fitted. The corollaries on the least index of an abelian subgroup and on extremality concentration in 2-groups are natural and well supported by the proof.

minor comments (3)
  1. [Lemma 4.6] As typeset in the submitted text, the statement a(E_m)=2m+1 is inconsistent with the proof, which correctly proves a(E_m)=2^m+1; likewise, '2m+1 Lagrangian members' and 'at most 2m-1 nonzero vectors' should read 2^m+1 and 2^m-1 respectively. The displayed arithmetic (2^{2m}-1)/(2^m-1)=2^m+1 shows the intended meaning, but the notation should be fixed in the final version.
  2. [Throughout] The plain-text version flattens many superscripts, for example 'order 2 1+2m' and 'log2h(n)>= n2', which makes the main theorem and Lemma 4.6 unnecessarily hard to read. The published version should restore consistent superscript typesetting.
  3. [Lemma 4.4] The finite verification for p=3 is load-bearing because a single zero pairing would break the odd-prime coefficient in Theorem 6.1. I checked the 78 displayed Gram entries and they are all nonzero, so the proof is correct; nevertheless, adding a sentence that the table was machine-checked, or including a short verification script, would make this step easier for readers to certify.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the lower and upper bounds are derived independently from external benchmarks and universal constants.

full rationale

The paper's central estimate log_2 h(n) = n/2 + O(sqrt(n)(log n)^3) is obtained from two independent directions. The lower bound (Lemma 4.6) is computed exactly for extraspecial 2-groups, giving omega(E_m) = a(E_m) = 2m+1, an external benchmark not tuned to the upper bound. The upper bound proceeds through a chain of independent reductions: isoclinism (Lemma 2.1), global BFC estimates from Pyber and Neumann-Vaughan-Lee (Lemmas 3.1-3.2), a symplectic cover and clique-credit toolkit (Lemmas 4.1-4.4), a central-factor descent for p-groups (Section 5), and the assembled p-group bound (Theorem 6.1). No fitted parameter is renamed as a prediction: the constants kappa_p, c_p, R, C0 are universal choices that do not depend on the group and do not enter the main coefficient. The odd-prime coefficients alpha_3 = (log_2 3)/4 and alpha_p = (log_2 p)/p are strictly below 1/2 because of the explicit 13-vector construction in Lemma 4.4 and the hyperbolic-plane construction for p >= 5; these are concrete combinatorial inputs, not restatements of the conclusion. The p=3 Gram table is hand-listed rather than machine-verified, and a single zero pairing would indeed jeopardize the odd-prime upper bound; however, this is an unverified finite computation and therefore a correctness risk, not a circularity. The paper does not rely on self-citations: all load-bearing cited results (Neumann, Hall, Pyber, Neumann-Vaughan-Lee, Podoski-Szegedy) are external and stated with explicit assumptions that do not include the theorem being proved. In particular, no 'uniqueness theorem' from the author's own prior work is invoked, no ansatz is smuggled in by citation, and the known exponential bounds are used only as coarse inputs, not as a source of the sharp base sqrt(2). Under the review rule that unverified load-bearing computations be flagged, the manuscript itself does not claim machine verification of the 78 pairings; that omission lowers the certifiability of the proof but does not make the derivation equivalent to its inputs. The honest finding is therefore no significant circularity, score 0.

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

The proof is self-contained except for standard external theorems (Neumann, Hall, Schur, Pyber, Neumann-Vaughan-Lee). No free parameters are fitted to data; the explicit constants (C0=100, A, Q=(log n)^10) are universal choices that do not affect the final bound. No new entities are postulated.

assumptions (6)
  • standard math B.H. Neumann's theorem: finiteness of a largest pairwise noncommuting set forces G/Z(G) finite.
    Used in Lemma 2.1 to reduce to finite stem groups; cited as [20].
  • standard math Hall's stem-group theorem: every group is isoclinic to a group H with Z(H) <= H'.
    Used in Lemma 2.1; cited as [21,22].
  • standard math Schur's theorem: if G/Z(G) is finite then G' is finite.
    Used in Lemma 2.1 to show the stem group is finite.
  • standard math Pyber's BFC lemma: every conjugacy class of a finite group with omega(G)=N has size at most (2N+1)^2.
    Used in Lemma 3.1 as the global compression estimate; cited as [23, Lemma 3.1].
  • standard math Neumann-Vaughan-Lee BFC bound: |G'| <= r^((3+5 log_2 r)/2) for r-BFC groups.
    Used in Corollary 3.2 to bound the derived subgroup quasipolynomially; cited as [24].
  • standard math Pyber's theorem: |G:Z(G)| <= C^N for an absolute constant C.
    Used in Theorem 8.2 to bound the size of H/(H∩Z(G)) and make the coset-domination cost N^{O(1)}; cited as [23].

how reviews work

0 comments
Cite this review

Pith. "Pith review of Sharp Asymptotics for Abelian Covers of Groups with Bounded Noncommutativity." pith.science (2026). https://pith.science/paper/D5BT6Z4Q

@misc{pith2026260820507,
  author       = {Pith},
  title        = {Pith review of: Sharp Asymptotics for Abelian Covers of Groups with Bounded Noncommutativity},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/D5BT6Z4Q}},
  note         = {Machine review of arXiv:2608.20507}
}
abstract

We determine the sharp exponential growth rate of the minimum number of abelian subgroups required to cover a group with bounded pairwise noncommutativity. Let $\omega(G)$ denote the largest size of a pairwise noncommuting subset of a group $G$, let $a(G)$ be the least size of an abelian cover, and define $h(n)=\sup\{a(G):\omega(G)\le n\}$. We prove the quantitative estimate $\log_2 h(n)=n/2+O(\sqrt{n}\,(\log(n+2))^3)$, and hence $h(n)^{1/n}\to\sqrt{2}$. Extraspecial $2$-groups give the matching lower bound. For the upper bound, we reduce to finite groups by isoclinism, analyze finite $p$-groups through a central series of the derived subgroup and alternating commutator forms, control interactions between central factors, and then pass through Sylow decomposition and the Fitting subgroup at polynomial cost. The argument also determines the same sharp exponential rate for the least possible index of an abelian subgroup and shows that asymptotic extremality is concentrated in $2$-groups. This result resolves Erd\H{o}s Problem #117 at the level of its sharp exponential asymptotics.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages

  1. [1]

    Erdős, Some of my favourite unsolved problems, in A

    P. Erdős, Some of my favourite unsolved problems, in A. Baker, B. Bollobás and A. Hajnal (eds.),A Tribute to Paul Erdős, Cambridge University Press, 1990, 467–478.https: //doi.org/10.1017/CBO9780511983917.039

    work page doi:10.1017/cbo9780511983917.039 1990

  2. [2]

    Erdős, Some unsolved problems, in B

    P. Erdős, Some unsolved problems, in B. Bollobás and A. Thomason (eds.),Combinatorics, Geometry and Probability, Cambridge University Press, 1997, 1–10.https://doi.org/10. 1017/CBO9780511662034.004

    work page 1997

  3. [3]

    Abdollahi, S

    A. Abdollahi, S. Akbari and H. R. Maimani, Non-commuting graph of a group,J. Algebra 298 (2006), 468–492.https://doi.org/10.1016/j.jalgebra.2006.02.015

    work page doi:10.1016/j.jalgebra.2006.02.015 2006

  4. [4]

    A. Azad, M. A. Iranmanesh, C. E. Praeger and P. Spiga, Abelian coverings of finite general linear groups and an application to their non-commuting graphs,J. Algebraic Combin.34 (2011), 683–710.https://doi.org/10.1007/s10801-011-0288-2

    work page doi:10.1007/s10801-011-0288-2 2011

  5. [5]

    Berkovich, Coverings of finite groups by few proper subgroups,Glas

    Y. Berkovich, Coverings of finite groups by few proper subgroups,Glas. Mat. Ser. III45(65) (2010), 415–429.https://doi.org/10.3336/gm.45.2.09

    work page doi:10.3336/gm.45.2.09 2010

  6. [6]

    Erdős and E

    P. Erdős and E. G. Straus, How abelian is a finite group?,Linear Multilinear Algebra3 (1976), 307–312.https://doi.org/10.1080/03081087608817122

    work page doi:10.1080/03081087608817122 1976

  7. [7]

    B. H. Neumann, A problem of Paul Erdős on groups,J. Austral. Math. Soc. Ser. A21 (1976), 467–472.https://doi.org/10.1017/S1446788700019303

    work page doi:10.1017/s1446788700019303 1976

  8. [8]

    Faber, R

    V. Faber, R. Laver and R. McKenzie, Coverings of groups by abelian subgroups,Canad. J. Math.30 (1978), 933–945.https://doi.org/10.4153/CJM-1978-081-1

    work page doi:10.4153/cjm-1978-081-1 1978

Show all 24 references
  1. [9]

    D. R. Mason, On coverings of a finite group by abelian subgroups,Math. Proc. Cambridge Philos. Soc.83 (1978), 205–209.https://doi.org/10.1017/S0305004100054463

    1978 doi

  2. [10]

    E. A. Bertram, Some applications of graph theory to finite groups,Discrete Math.44 (1983), 31–43.https://doi.org/10.1016/0012-365X(83)90004-3

    1983 doi

  3. [11]

    Brown, Minimal covers ofSn by abelian subgroups and maximal subsets of pairwise noncommuting elements,J

    R. Brown, Minimal covers ofSn by abelian subgroups and maximal subsets of pairwise noncommuting elements,J. Combin. Theory Ser. A49 (1988), 294–307.https://doi.org/ 10.1016/0097-3165(88)90057-X. 17

    1988 doi

  4. [12]

    Brown, Minimal covers ofSn by abelian subgroups and maximal subsets of pairwise noncommuting elements, II,J

    R. Brown, Minimal covers ofSn by abelian subgroups and maximal subsets of pairwise noncommuting elements, II,J. Combin. Theory Ser. A56 (1991), 285–289.https://doi. org/10.1016/0097-3165(91)90037-H

    1991 doi

  5. [13]

    Podoski and B

    K. Podoski and B. Szegedy, Bounds in groups with finite abelian coverings or with finite derived groups,J. Group Theory5 (2002), 443–452.https://doi.org/10.1515/jgth.2002. 015

    2002 doi

  6. [14]

    A. Y. M. Chin, On non-commuting sets in an extraspecialp-group,J. Group Theory8 (2005), 189–194.https://doi.org/10.1515/jgth.2005.8.2.189

    2005 doi

  7. [15]

    Azad and C

    A. Azad and C. E. Praeger, Maximal subsets of pairwise noncommuting elements of three-dimensional general linear groups,Bull. Aust. Math. Soc.80 (2009), 91–104.https: //doi.org/10.1017/S0004972709000057

    2009 doi

  8. [16]

    Fouladi and R

    S. Fouladi and R. Orfi, Maximal subsets of pairwise noncommuting elements of somep- groups of maximal class,Bull. Aust. Math. Soc.84 (2011), 447–451.https://doi.org/10. 1017/S0004972711002401

    2011

  9. [17]

    Fouladi and R

    S. Fouladi and R. Orfi, Maximum size of subsets of pairwise non-commuting elements in finite metacyclicp-groups,Bull. Aust. Math. Soc.87 (2013), 18–23. https://doi.org/10. 1017/S0004972712000111

    2013

  10. [18]

    M. R. Darafsheh, M. Ghorbani and S. K. Prajapati, On maximal subsets of pairwise noncommuting elements in finitep-groups,Bull. Aust. Math. Soc.92 (2015), 380–389. https://doi.org/10.1017/S0004972715000830

    2015 doi

  11. [19]

    M. L. Lewis and R. McCulloch, Covering by centralizers,Monatsh. Math.210 (2026), 199–211.https://doi.org/10.1007/s00605-026-02165-7

    2026 doi

  12. [20]

    B. H. Neumann, Groups covered by permutable subsets,J. London Math. Soc.29 (1954), 236–248.https://doi.org/10.1112/jlms/s1-29.2.236

    1954 doi

  13. [21]

    Hall, The classification of prime-power groups,J

    P. Hall, The classification of prime-power groups,J. Reine Angew. Math.182 (1940), 130–141. https://doi.org/10.1515/crll.1940.182.130

    1940 doi

  14. [22]

    M. R. Pournaki and R. Sobhani, Probability that the commutator of two group elements is equal to a given element,J. Pure Appl. Algebra212 (2008), 727–734.https://doi.org/10. 1016/j.jpaa.2007.06.013

    2008

  15. [23]

    Pyber, The number of pairwise non-commuting elements and the index of the centre in a finite group,J

    L. Pyber, The number of pairwise non-commuting elements and the index of the centre in a finite group,J. London Math. Soc. (2)35 (1987), 287–295.https://doi.org/10.1112/ jlms/s2-35.2.287

    1987

  16. [24]

    P. M. Neumann and M. R. Vaughan-Lee, An essay on BFC groups,Proc. London Math. Soc. (3)35 (1977), 213–237.https://doi.org/10.1112/plms/s3-35.2.213. Statements and Declarations Funding.No funds, grants, or other support were received during the preparation of this manuscript. C...

    1977 doi

Pith tools

Reviewed August 27, 2026 · model on record in the stance chip above.