Search arXivSearch

arXiv · 2602.18427

Polytopes of alternating sign matrices with dihedral symmetries

Abstract

We study the convex hulls of $n \times n$ alternating sign matrices invariant under subgroups of the dihedral group of the square. For each non-trivial symmetry class, the symmetry determines the full matrix affinely from a smaller set of entries, allowing us to study the corresponding convex hull in a lower-dimensional space. For the vertical, vertical$\unicode{x2013}$horizontal, half-turn, diagonal, diagonal$\unicode{x2013}$antidiagonal, and total symmetry classes, we give polynomial-size linear inequality descriptions, determine the dimensions, identify all facets, and give exact facet counts. For the quarter-turn class, the natural fixed-point relaxation is not integral. We obtain the exact hull by adding parity-type Chvátal$\unicode{x2013}$Gomory inequalities, determine its dimension, and construct a family of facets indexed by Ferrers diagrams of Catalan-number cardinality, while the complete facet structure remains open. The formulations yield strongly polynomial-time algorithms for linear optimization over every non-empty symmetry class. We also show that the full-matrix polytopes of all classes except the quarter-turn class have the integer Carathéodory property and hence the integer decomposition property.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Péter Madarasi. 2026-08-18. Polytopes of alternating sign matrices with dihedral symmetries. https://arxiv.org/abs/2602.18427

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO