惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Hugging Face - Blog
Hugging Face - Blog
Recent Announcements
Recent Announcements
V
Visual Studio Blog
博客园 - 叶小钗
H
Help Net Security
aimingoo的专栏
aimingoo的专栏
宝玉的分享
宝玉的分享
U
Unit 42
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
F
Fortinet All Blogs
V
V2EX
Stack Overflow Blog
Stack Overflow Blog
WordPress大学
WordPress大学
D
DataBreaches.Net
J
Java Code Geeks
H
Hackread – Cybersecurity News, Data Breaches, AI and More
A
About on SuperTechFans
酷 壳 – CoolShell
酷 壳 – CoolShell
量子位
C
Check Point Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
小众软件
小众软件
Microsoft Azure Blog
Microsoft Azure Blog
M
MIT News - Artificial intelligence

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
The Minimum Size of a Poset Realizing $\mathbb{Z}_2 \time...
Ponaki Das, Sainkupar Marwein Mawiong · 2026-06-06 · via math.CO updates on arXiv.org

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$.