Minimum Size of a Poset Realizing Z₂timesZ_(2^(n)) as its Automorphism Group
Pith reviewed 2026-06-29 03:02 UTC · model grok-4.3
The pith
The smallest poset whose automorphism group is exactly Z₂ × Z_{2^n} has size 2^{n+1} + 2 when n ≥ 3.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The paper proves that β(Z₂ × Z_{2^n}) = 2^{n+1} + 2 for every n ≥ 3, where β(G) denotes the smallest number of elements in a poset P such that the automorphism group of P is isomorphic to G.
What carries the argument
The function β(G) that records the smallest order of any poset realizing a given finite group G as its automorphism group.
If this is right
- For each n ≥ 3 there exists at least one poset of size exactly 2^{n+1} + 2 whose automorphism group is Z₂ × Z_{2^n}.
- No poset with fewer than 2^{n+1} + 2 elements can have automorphism group exactly Z₂ × Z_{2^n}.
- The exact value of β is now known for every group in this infinite family of non-cyclic abelian 2-groups.
Where Pith is reading between the lines
- The same lower-bound technique might extend to other families such as Z_p × Z_{p^n} for odd primes p.
- If β(G) is always at least roughly the order of G for abelian G, then the growth rate for these groups is linear.
- The constructions could serve as test cases for conjectures on which groups are realizable at all as poset automorphism groups.
Load-bearing premise
A poset of size 2^{n+1} + 2 can be built whose automorphism group is precisely Z₂ × Z_{2^n}, and every poset with fewer elements has a different or larger automorphism group.
What would settle it
An explicit poset with 2^{n+1} + 1 or fewer elements whose automorphism group is isomorphic to Z₂ × Z_{2^n} would falsify the equality.
read the original abstract
We study the realization of finite groups as automorphism groups of finite posets. Given a finite group $G$, let $\beta(G)$ denote the smallest number of elements in a poset $P$ with $\Aut(P)\cong G$. While $\beta(G)$ is known for several cyclic and small abelian groups, the non-cyclic abelian case is largely open. In this paper we prove that $\beta(\Z_{2}\times\Z_{2^{n}})=2^{\,n+1}+2$ for every $n\ge 3$.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proves that β(ℤ₂ × ℤ_{2^n}) = 2^{n+1} + 2 for every n ≥ 3, where β(G) is the smallest order of a finite poset whose automorphism group is isomorphic to G. The proof consists of an explicit construction of a poset P_n of size 2^{n+1} + 2 with Aut(P_n) ≅ ℤ₂ × ℤ_{2^n} together with a matching lower-bound argument showing that no poset of smaller cardinality can realize this group.
Significance. The result supplies the exact value of β(G) for an infinite family of non-cyclic abelian groups, a case that had remained open. The manuscript achieves this by a direct, verifiable construction and by a structural analysis of possible automorphisms that rules out smaller realizations; both directions are supplied within the paper.
minor comments (2)
- [Section 3] Figure 2 (the Hasse diagram of P_n) would benefit from an explicit labeling of the two orbits of size 2^n under the action of the cyclic factor.
- [Section 5] In the statement of Lemma 5.3 the phrase 'the only possible non-identity automorphism' should be replaced by 'the only possible non-identity order-2 automorphism' to avoid ambiguity with the generator of the cyclic summand.
Simulated Author's Rebuttal
We thank the referee for their positive summary and recommendation to accept the manuscript. The report accurately captures the main result and its significance.
Circularity Check
No significant circularity; derivation is self-contained via explicit construction and independent lower-bound arguments
full rationale
The paper establishes β(Z₂ × Z_{2^n}) = 2^{n+1} + 2 by two independent directions: (1) an explicit poset construction of the stated size whose automorphism group is shown isomorphic to the target group via direct verification of order-preserving maps, and (2) a structural lower-bound argument enumerating possible automorphisms on smaller posets and showing none can realize exactly that group. Neither direction reduces to a self-definition, a fitted parameter renamed as prediction, or a load-bearing self-citation chain; both rely on standard facts from group theory and order theory that are externally verifiable. No equations equate a claimed result to its own inputs by construction. The result is therefore a genuine theorem, not a renaming or tautology.
Axiom & Free-Parameter Ledger
Reference graph
Works this paper leans on
-
[1]
M. C. McCord,Singular homology groups and homotopy groups of finite topological spaces, Duke Math. J.33(1966), 465–474
1966
-
[2]
W. C. Arlinghaus,The classification of minimal graphs with given abelian automorphism group, Mem. Amer. Math. Soc.57(1985), no. 330
1985
-
[3]
H. S. M. Coxeter,Self-dual configurations and regular graphs, Bull. Amer. Math. Soc.56(1950), 413–455
1950
-
[4]
R. L. Meriwether,Smallest graphs with a given cyclic group, unpublished (1963)
1963
-
[5]
Babai,Infinite digraphs with given regular automorphism groups, J
L. Babai,Infinite digraphs with given regular automorphism groups, J. Combin. Theory Ser. B 25(1978), no. 1, 26–46
1978
-
[6]
Babai,Finite digraphs with given regular automorphism groups, Period
L. Babai,Finite digraphs with given regular automorphism groups, Period. Math. Hungar.11 (1980), no. 4, 257–270
1980
-
[7]
J. A. Barmak,Automorphism groups of finite posets II, arXiv:2008.04997 (2020)
arXiv 2008
-
[8]
A. N. Barreto,Sobre los posets m´ as chicos con grupo de automorfismos abeliano dado, Tesis de Licenciatura, Universidad de Buenos Aires, 2021
2021
-
[9]
J. A. Barmak and A. N. Barreto,Smallest posets with given cyclic automorphism group, Algebr. Comb.7(2024), no. 5, 1307–1318
2024
-
[10]
Gyenizse, P
G. Gyenizse, P. Hajnal and L. Z´ adori,Representations of finite groups by posets of small height, Order41(2024), no. 3, 593–611
2024
-
[11]
P. Das and S. M. Mawiong,The minimum size of a poset realizingZ 2 ×Z 4 as its automorphism group, preprint, arXiv:2606.07478 (2026). 10
Pith/arXiv arXiv 2026
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.