Search arXiv⌕ Search

arXiv · 2606.07478

The Minimum Size of a Poset Realizing $\mathbb{Z}_2 \times \mathbb{Z}_4$ as its Automorphism Group

Abstract

For a finite group $G$, let $β(G)$ denote the minimum cardinality $|P|$ among finite posets $P$ whose automorphism group $\Aut(P)$ is isomorphic to $G$. While every finite group is realizable as the automorphism group of some finite poset, exact values of $β(G)$ are known only in special cases, most notably for cyclic groups. In this paper we prove that $β(\mathbb{Z}_2 \times \mathbb{Z}_4) = 14$; in particular, the product bound $β(G \times H) \le β(G) + β(H)$ is sharp in this case. The upper bound is realized by an explicit $14$-element poset $P_{14}$, whose automorphism group is computed by a height-function argument together with a rigidity analysis of its covering relations. The lower bound, which constitutes the substantive part of the proof, is established by a case analysis of the orbit decompositions of a hypothetical poset on at most $13$ points under a faithful $G$-action, organized according to the largest orbit size; in each case we construct an order-automorphism outside the given copy of $G$, contradicting $\Aut(P) \cong G$. Among non-cyclic groups, to our knowledge this is the first exact determination of $β(G)$ whose lower bound requires a structural analysis of this kind: for the other non-cyclic abelian groups of order at most $8$, namely $\mathbb{Z}_2 \times \mathbb{Z}_2$ and $\mathbb{Z}_2^3$, the value of $β$ is elementary. The arguments are closely adapted to the subgroup lattice of $\mathbb{Z}_2 \times \mathbb{Z}_4$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ponaki Das, Sainkupar Marwein Mawiong. 2026-06-15. The Minimum Size of a Poset Realizing $\mathbb{Z}_2 \times \mathbb{Z}_4$ as its Automorphism Group. https://arxiv.org/abs/2606.07478

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗