Search arXivSearch

arXiv · 2601.00782

Existence of Kähler algebras with Chow polynomials as Hilbert series

Abstract

In this article, we study Chow polynomials of weakly ranked posets and prove the existence of Gorenstein algebras with the Kähler package such that their Hilbert--Poincaré series agrees with the Chow polynomial. Our statement provides evidence in support of a conjecture by Ferroni, Matherne and the second author about the existence of an algebra for every weakly ranked poset that generalizes the Feichtner--Yuzvinsky Chow ring for matroids. This allows us to prove strong inequalities for the coefficients of Chow polynomials; we prove log-concavity for all posets of weak rank at most six and provide counterexamples to log-concavity for any higher rank. For ranked posets we recover an even stronger condition, showing that the differences between consecutive coefficients constitute a pure O-sequence.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adam Schweitzer, Lorenzo Vecchi. 2026-01-23. Existence of Kähler algebras with Chow polynomials as Hilbert series. https://arxiv.org/abs/2601.00782

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