REVIEW 2 major objections 5 minor 25 references
The NNN-Property of Cyclic Groups
T0 review · 2 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read Cyclic groups do not have the NNN-property: no normal circulant has an isomorphic non-normal regular subgroup.
desk verdict A credible proof that cyclic groups lack the NNN-property, built on a substantial classification of regular subgroups of Hol(Z_{2^n}); one fixable gap in Section 4's use of Lemma 3.26. 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 central object is the holomorph $\mathrm{Hol}(G) = G_R \rtimes \mathrm{Aut}(G)$, viewed as a permutation group on $G$; whenever $\Gamma$ is normal for $G$, $\mathrm{Aut}(\Gamma)$ is a subgroup of $\mathrm{Hol}(G)$, so every regular subgroup of $\mathrm{Aut}(\Gamma)$ is a regular subgroup of $\mathrm{Hol}(G)$. For $G = \mathbb{Z}_{2^n}$, Theorem 1.4 gives a complete classification of those regular subgroups up to conjugacy: the right-regular group $G_R$, cyclic subgroups $\langle a y^{2^t}\rangle$, and the dihedral, quaternion, quasidihedral, and $M_n(2)$ groups. The other load-bearing device is the lemma that a circulant that is a lexicographic product of two nontrivial circulants has an automorphism group strictly larger than $\mathrm{Hol}(\mathbb{Z}_{2^n})$, so it cannot be normal; this converts the presence of W-subgroups into non-normality.
What would settle it
Find a normal circulant $\Gamma$ of a cyclic group $G = \mathbb{Z}_{2^k} \times B$ with $B$ odd and $k \geq 4$ whose automorphism group contains the automorphism $y^{2^{k-4}}$ (the map $a_1 \mapsto a_1^{5^{2^{k-4}}}$ fixing $B$). Theorem 4.3 asserts such a graph must be non-normal for $G$, so any concrete example would refute the theorem; for instance, a computer search over all inversion-closed connection sets of $\mathbb{Z}_{48}$ could check whether any normal circulant has $y$ in its automorphism group.
Extended reading notes
Core claim
The paper's central claim is Theorem 1.3: cyclic groups do not have the NNN-property. Concretely, for every finite cyclic group $G$, every circulant $\Gamma = \mathrm{Cay}(G,S)$ that is normal for $G$ has no regular subgroup $H$ with $H \cong G$, $H \neq G_R$, and $H$ not normal in $\mathrm{Aut}(\Gamma)$. The proof first handles $|G|$ not divisible by 8 via a uniqueness result for abelian regular subgroups, then for $|G|$ divisible by 8 classifies the regular subgroups of $\mathrm{Hol}(\mathbb{Z}_{2^n})$ (Theorem 1.4), determines which cyclic regular subgroups are normal in the holomorph (Theorem 3.24), and rules out the remaining candidates by showing that the automorphisms they force into $\mathrm{Aut}(\Gamma)$ would make $\Gamma$ a lexicographic product, hence non-normal.
Load-bearing premise
The proof assumes, without a separate proof or citation, that the lower bound on the automorphism-group size of a lexicographic product of circulants, established for $\mathbb{Z}_{2^n}$, continues to hold for cyclic groups that also contain odd prime factors.
Editorial extensions
If this is right
- For cyclic groups of order not divisible by 8, a normal circulant has exactly one abelian regular subgroup, so the normal/non-normal regular-subgroup problem cannot even arise for such graphs.
- For cyclic groups of order divisible by 8, the classification reduces the NNN-check to seven explicit conjugacy classes; any NNN candidate would have to be of the cyclic type $\langle a y^{2^t}\rangle$, and the proof shows that candidate is either normal or forces the graph to be non-normal.
- As a direct corollary, every regular subgroup of a normal circulant that is isomorphic to the defining cyclic group is normal in the automorphism group.
- The NNN phenomenon, if it exists at all for cyclic groups, cannot appear; the known examples of NNN-graphs therefore remain confined to non-cyclic groups.
- The theorem settles the cyclic case of the question whether a Cayley graph can be simultaneously normal for one regular group and non-normal for an isomorphic regular group.
Reading between the lines
- A natural extension not pursued here would be to ask whether every group with cyclic Sylow 2-subgroup fails the NNN-property, since the obstruction in this paper lives entirely in the 2-part of the group.
- One could test the pressure point computationally: enumerate all circulants of $\mathbb{Z}_{48}$ (or other $\mathbb{Z}_{2^k} \times B$ with odd $B$) and check whether any normal circulant has $y^{2^{k-4}} \in \mathrm{Aut}(\Gamma)$; Theorem 4.3 predicts none exists.
- The classification in Theorem 1.4 may be reusable for the isomorphism problem of circulant digraphs, because it lists all possible regular groups that can appear inside the automorphism group of a normal circulant whose order is divisible by 8.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proves that no finite cyclic group has the NNN-property: for every cyclic group G, every circulant that is normal for G has no distinct regular subgroup isomorphic to G that is non-normal in its automorphism group. The proof splits into two cases. When the order of G is not divisible by 8, Section 2 shows that the automorphism group of a normal circulant has a unique abelian regular subgroup, and hence no NNN-graph exists. When 8 divides |G|, Section 3 classifies the regular subgroups of Hol(Z_{2^n}), identifies which cyclic regular subgroups are normal, and Section 4 uses this classification to reduce the general cyclic case to the 2-primary component. The final theorem, Theorem 1.3, states the result for all cyclic groups.
Significance. If the result is correct, it resolves a natural open case in the study of NNN-graphs and complements known results for elementary abelian 2-groups and CI-groups. The paper contains substantial independent technical contributions: a complete classification of regular subgroups of Hol(Z_{2^n}) (Theorem 1.4), a detailed semiregular element analysis (Section 3.2), and a normality criterion for cyclic regular subgroups (Theorem 3.24). These tools are likely to be useful beyond the NNN-property. The main result is a clean, falsifiable statement about all finite cyclic groups. The paper is not based on any fitted parameters or circular reasoning; the central claim is approached by a genuine case analysis built on prior theorems.
major comments (2)
- [Section 4, proof of Theorem 4.3, first case] Lemma 3.26 is applied to a circulant of G = Z_{2^{k1}} × B with B odd, but Lemma 3.26 is proved only for the case G = Z_{2^n}. The proof of Lemma 3.26 compares |Aut(Γ)| with |Hol(Z_{2^n})| = 2^{2n-1}, whereas for the composite cyclic group G the required comparison is with |Hol(G)| = 2^{2k1-1} · |B| · |Aut(B)|, which is strictly larger when |B| > 1. The manuscript does not provide a proof or citation showing that the lexicographic product in Theorem 4.3 has more automorphisms than |Hol(G)|, so the contradiction that Γ is non-normal for G is unsupported as written. This is likely repairable: for the order-2 subgroup X, one may bound |Aut(Γ)| ≥ 2 · |Aut(Y)|² with |Aut(Y)| ≥ |G|/2, giving |Aut(Γ)| ≥ |G|²/2, and then note that |G|²/2 > |Hol(G)| for odd |B| > 1; however, the manuscript does not carry out this adjustment.
- [Lemma 3.26, inequality (20)] The proof of Lemma 3.26 asserts that a circulant has a regular automorphism group if and only if it is isomorphic to K2, and uses this to justify the strict inequality |Aut(Γ)| > 2^{n-t}(2^t)^{2^{n-t}}. This assertion is not correct: there exist circulant graphs on cyclic groups, including groups of order a power of 2, whose full automorphism group is regular (graphical regular representations, or GRRs). For order at least 16, such GRRs are known to exist for cyclic 2-groups. Consequently, when t = n-1 the right-hand side equals |Hol(Z_{2^n})| exactly, and the proof of Lemma 3.26 is incomplete as it stands. Since Lemma 3.26 is used in the main proof, this gap is load-bearing and requires repair.
minor comments (5)
- [Page 3, second paragraph] There is a typo in the sentence 'we have that the the only regular subgroups of the holomorph' — the word 'the' is duplicated.
- [Section 2, Lemma 2.4] The phrase 'p1 is odd' in the lemma statement is not defined; it should be 'p1 is an odd prime' for clarity.
- [Lemma 3.26 and Theorem 4.3] The term 'nontrivial circulant' is used without definition. In particular, it is unclear whether an edgeless circulant on two vertices (which has regular automorphism group) counts as nontrivial; this ambiguity is directly relevant to the strictness of inequality (20).
- [Section 3, Theorem 3.17] In the proof of Theorem 3.17, the expression 'R/upsl⋊peR ∩ GR' appears garbled; this is likely a typesetting artifact, but the intended notation should be stated cleanly.
- [Introduction, paragraph on W-subgroups] The paper cites [25, Lemma 5.3.4] as the result that a lexicographic product arising from a W-subgroup is not NNN for arbitrary cyclic groups, but Section 4 does not invoke this result. Either use it in Theorem 4.3 or explain why the 2-power version suffices.
Circularity Check
No circular derivation: the main theorem is obtained from an internal classification and external structural results, with only a non-load-bearing self-citation.
full rationale
The proof of Theorem 1.3 splits into two cases. For |G| not divisible by 8, Theorem 2.8 follows from the internal Lemmas 2.1-2.6 and the external fact that a normal circulant satisfies Aut(Γ) ≤ Hol(G); no part of the argument assumes the NNN conclusion. For |G| divisible by 8, Section 3 independently classifies regular subgroups of Hol(Z_{2^n}) via semiregular-element analysis (Theorem 1.4), and Section 4 uses that classification together with [13, Theorem 1.2] and the internally proved Lemma 3.26. The only self-citation, [25, Lemma 5.3.4] from the last author's thesis, appears in the introduction as motivation and is not used in the proof of Theorem 4.3; it is therefore not load-bearing. The paper even flags that the Section 2 argument is invalid when 8 divides |G| and handles that case separately. The substantive concern is a possible proof gap, not circularity: Lemma 3.26 is stated and proved for Z_{2^n}, while Theorem 4.3 invokes it for G = Z_{2^{k1}} × B with odd B. That is an unproven extension or a missing citation, not a reduction of the theorem to its own inputs, and no fitted parameter or target assumption appears anywhere in the derivation.
Assumptions & free parameters
assumptions (6)
- standard math A graph is a Cayley graph for G iff Aut(Γ) contains a subgroup acting regularly on vertices.
- standard math For a normal Cayley graph Γ = Cay(G,S), Aut(Γ) = G_R ⋊ Aut(G,S).
- domain assumption Kovács and Servatius Theorem 1.2: if G has a W-subgroup H <_S G, then Cay(G,S) is a lexicographic product of two nontrivial circulants.
- domain assumption Lexicographic products of nontrivial circulants are not NNN graphs, as stated in Xu's PhD thesis [25, Lemma 5.3.4].
- standard math Lemma 3.1 from Kurzweil and Stellmacher: 5^{2^t} ≡ 1 mod 2^{t+2} and 5^{2^t} ≢ 1 mod 2^{t+3}.
- standard math There are exactly three nonabelian 2-groups with a cyclic subgroup of index two and an involution outside it: D_{2^n}, QD_{2^n}, and M_n(2).
Cite this review
Pith. "Pith review of The NNN-Property of Cyclic Groups." pith.science (2026). https://pith.science/paper/BB4O5HE5
@misc{pith2026190808838,
author = {Pith},
title = {Pith review of: The NNN-Property of Cyclic Groups},
year = {2026},
howpublished = {\url{https://pith.science/paper/BB4O5HE5}},
note = {Machine review of arXiv:1908.08838}
}
read the original abstract
A Cayley graph is said to be an NNN-graph if it is both normal and non-normal for isomorphic regular groups, and a group has the NNN-property if there exists an NNN-graph for it. In this paper we investigate the NNN-property of cyclic groups, and show that cyclic groups do not have the NNN-property.
Reference graph
Works this paper leans on
-
[1]
Alspach, B., and Parsons, T. D. Isomorphism of circulant graphs and digraphs. Discrete Math. 25 , 2 (1979), 97–108
work page 1979
-
[2]
Point regular groups of automorphisms of generalised quadr an- gles
Bamberg, J., and Giudici, M. Point regular groups of automorphisms of generalised quadr an- gles. J. Combin. Theory Ser. A 118 , 3 (2011), 1114–1128
work page 2011
-
[3]
Algebraic graph theory , Second ed
Biggs, N. Algebraic graph theory , Second ed. Cambridge Mathematical Library. Cambridge University Press, Cambridge, 1993
work page 1993
-
[4]
Groups that have the same holomorph as a finite perfect group
Caranti, A., and Dalla Volta, F. Groups that have the same holomorph as a finite perfect group. J. Algebra 507 (2018), 81–102
work page 2018
-
[5]
Counting Hopf Galois structures on non-abelian Galois field extensions
Carnahan, S., and Childs, L. Counting Hopf Galois structures on non-abelian Galois field extensions. J. Algebra 218 , 1 (1999), 81–92
work page 1999
-
[6]
Dummit, D. S., and Foote, R. M. Abstract algebra , third ed. John Wiley & Sons, Inc., Hoboken, NJ, 2004
work page 2004
-
[7]
Fernandes, J. G., and Giudici, R. E. Isomorphism between Cayley (di)graphs. Discrete Math. 305, 1-3 (2005), 361–364
work page 2005
-
[8]
Characterizing a family of elusive permutation groups
Giudici, M., and Kelly, S. Characterizing a family of elusive permutation groups. J. Group Theory 12, 1 (2009), 95–105
work page 2009
Show all 25 references
-
[9]
Giudici, M., and Smith, M. R. A note on quotients of strongly regular graphs. Ars Math. Contemp. 3 , 2 (2010), 147–150
2010
-
[10]
Skew braces and the Yang-Baxter equation
Guarnieri, L., and Vendramin, L. Skew braces and the Yang-Baxter equation. Math. Comp. 86, 307 (2017), 2519–2534
2017
-
[11]
The isomorphism problem for Cayley digraphs on groups of pri me-squared order
Joseph, A. The isomorphism problem for Cayley digraphs on groups of pri me-squared order. Discrete Math. 141 , 1-3 (1995), 173–183
1995
-
[12]
Classification of the Hopf Galois structures on prime power r adical extensions
Kohl, T. Classification of the Hopf Galois structures on prime power r adical extensions. J. Algebra 207, 2 (1998), 525–546
1998
-
[13]
On Cayley digraphs on nonisomorphic 2-groups
Kov´acs, I., and Servatius, M. On Cayley digraphs on nonisomorphic 2-groups. J. Graph Theory 70, 4 (2012), 435–448
2012
-
[14]
The theory of finite groups
Kurzweil, H., and Stellmacher, B. The theory of finite groups . Universitext. Springer-Verlag, New York, 2004. An introduction, Translated from the 1998 Ge rman original
2004
-
[15]
H., Xia, B., and Zhou, S
Li, C. H., Xia, B., and Zhou, S. An explicit characterization of arc-transitive circulant s. arXiv preprint arXiv:1906.04620 (2019). Page 27 of 27
2019 arXiv
-
[16]
Normal circulant graphs with noncyclic regular subgroups
Maruˇsiˇc, D., and Morris, J. Normal circulant graphs with noncyclic regular subgroups. J. Graph Theory 50 , 1 (2005), 13–24
2005
-
[17]
Isomorphic Cayley graphs on nonisomorphic groups
Morris, J. Isomorphic Cayley graphs on nonisomorphic groups. J. Graph Theory 31 , 4 (1999), 345–362
1999
-
[18]
On ´Ad´ am’s conjecture for circulant graphs
Muzychuk, M. On ´Ad´ am’s conjecture for circulant graphs. Discrete Math. 167/168 (1997), 497–510. 15th British Combinatorial Conference (Stirling , 1995)
1997
-
[19]
Royle, G. F. A normal non-Cayley-invariant graph for the elementary abe lian group of order 64. J. Aust. Math. Soc. 85 , 3 (2008), 347–351
2008
-
[20]
On a class of fixed-point-free graphs
Sabidussi, G. On a class of fixed-point-free graphs. Proc. Amer. Math. Soc. 9 (1958), 800–804
1958
-
[21]
On the multiple holomorph of a finite almost simple group
Tsang, C. On the multiple holomorph of a finite almost simple group. arXiv preprint arXiv:1904.09754 (2019)
2019 arXiv
-
[22]
Automorphism groups and isomorphisms of Cayley digraphs
Xu, M.-Y. Automorphism groups and isomorphisms of Cayley digraphs. Discrete Math. 182 , 1-3 (1998), 309–319. Graph theory (Lake Bled, 1995)
1998
-
[23]
Arc-transitive circulant digraphs of odd prime-power order
Xu, M.-Y., Baik, Y.-G., and Sim, H.-S. Arc-transitive circulant digraphs of odd prime-power order. Discrete Math. 287 , 1-3 (2004), 113–119
2004
-
[24]
On constructing normal and non-normal Cayley graphs
Xu, Y. On constructing normal and non-normal Cayley graphs. Discrete Math. 340 , 12 (2017), 2972–2977
2017
-
[25]
Normal and non-normal cayley graphs
Xu, Y. Normal and non-normal cayley graphs . PhD thesis, The University of Western Australia, 2018
2018
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.