paper

The Minimum Size of a Poset Realizing as its Automorphism Group

arXiv:2606.07478

Abstract

For a finite group , let denote the minimum cardinality among finite posets whose automorphism group $\Aut(P)$ is isomorphic to . While every finite group is realizable as the automorphism group of some finite poset, exact values of are known only in special cases, most notably for cyclic groups. In this paper we prove that ; in particular, the product bound is sharp in this case. The upper bound is realized by an explicit -element poset , 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 points under a faithful -action, organized according to the largest orbit size; in each case we construct an order-automorphism outside the given copy of , contradicting $\Aut(P) \cong G$. Among non-cyclic groups, to our knowledge this is the first exact determination of whose lower bound requires a structural analysis of this kind: for the other non-cyclic abelian groups of order at most , namely and , the value of is elementary. The arguments are closely adapted to the subgroup lattice of .