Search arXivSearch

arXiv · 2511.13819

Chow polynomials of rank-uniform labeled posets

Abstract

We introduce and develop the theory of UMEL-shellable posets. These are posets equipped with an edge-lexicographical labeling satisfying certain uniformity and monotonicity properties. This framework encompasses classical families of combinatorial geometries, including uniform matroids, projective and affine geometries, braid matroids of type A and B, and all Dowling geometries. It also comprises all rank-uniform supersolvable lattices, and therefore also all rank-uniform distributive lattices. Our main result establishes real-rootedness phenomena for the Chow polynomials, the augmented Chow polynomials, and the chain polynomials associated with those posets, thus making simultaneous progress towards conjectures by Ferroni--Schröter, Huh--Stevens, and Athanasiadis--Kalampogia-Evangelinou. In the special case of lattices of flats of matroids, the (augmented) Chow polynomials coincide with the Hilbert--Poincaré series of the Chow ring associated to the smooth and generally noncompact toric varieties of the (augmented) Bergman fan of the matroid, whereas the chain polynomial encodes the Hilbert--Poincaré series of the Stanley--Reisner ring of the Bergman complex of the matroid. Therefore, these real-rootedness results are tightly linked to the study of these algebro-geometric structures in matroid theory.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Basile Coron, Luis Ferroni, Shiyue Li. 2025-12-18. Chow polynomials of rank-uniform labeled posets. https://arxiv.org/abs/2511.13819

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO