Search arXivSearch

arXiv · 2403.10577

Stembridge codes, permutahedral varieties, and their extensions

Abstract

It is well known that the Eulerian polynomial is the Hilbert series of the cohomology of the permutahedral variety. Stanley obtained a formula showing that the cohomology carries a permutation representation of $\mathfrak{S}_n$. We answer a question of Stembridge on finding an explicit permutation basis of this cohomology. We observe that the Feichtner-Yuzvinsky basis for the Chow ring of the Boolean matroid is such a permutation basis, and then we construct an $\mathfrak{S}_n$-equivariant bijection between this basis and codes introduced by Stembridge, thereby giving a combinatorial proof of Stanley's formula. We obtain an analogous result for the stellahedral variety. We find a permutation basis of the permutation representation its cohomology carries. This involves the augmented Chow ring of a matroid introduced by Braden, Huh, Matherne, Proudfoot and Wang. Along the way, we obtain a general result on augmented Chow rings (which was also independently obtained by Eur) asserting that augmented Chow rings of matroids are actually Chow rings in the sense of Feichtner and Yuzvinsky. In the last part of the paper, we study enumerative aspects of the permutahedra and the stellohedra related to these permutation bases.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hsin-Chieh Liao. 2024-04-15. Stembridge codes, permutahedral varieties, and their extensions. https://arxiv.org/abs/2403.10577

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