SearcharxivSearch

arXiv · 2609.23605

Hilbert functions over the exterior algebra and f-vectors in higher rank I: Amata-Crupi monomial modules, Kozlov polytopes, and r-vectors of simplicial complexes

Abstract

Let $E$ be the exterior algebra on $n$ generators over a field, and let $F$ be a graded free $E$-module with $r$ generators, of degrees $d_1 \le \dots \le d_r$. We determine the convex hull of the set of Hilbert functions of the quotients $F/M$, where $M$ runs over the monomial submodules of Amata and Crupi. The hull is the Minkowski sum of $r$ shifted copies of one and the same simplex: the Kozlov simplex, which Kozlov proved in 1997 to be the convex hull of the $f$-vectors of simplicial complexes on $n$ vertices. For $r=1$ the statement is Kozlov's theorem, so this is a rank-$r$ generalization of it. We give a self-contained proof, including a short proof of Kozlov's theorem from the local Lubell-Yamamoto-Meshalkin inequality, and an explicit facet description of the Kozlov simplex that appears not to be recorded in the literature. Along the way we isolate the class of submodules for which the argument works, the ideal-direct-sum modules, and show by example that the Hilbert function of a graded submodule outside that class need not be a shifted sum of $f$-vectors at all. The combinatorial content is stated separately, in language that uses no algebra, as a result on $r$-vectors of simplicial complexes and their $ff$-vectors. Finally we describe the vertex structure of the Minkowski sum -- which sums of vertices of the summands survive as vertices -- proving the answer for the all-ones leg vector at every rank and for the Kozlov leg vector at rank two.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan Snellman. 2026-09-20. Hilbert functions over the exterior algebra and f-vectors in higher rank I: Amata-Crupi monomial modules, Kozlov polytopes, and r-vectors of simplicial complexes. https://arxiv.org/abs/2609.23605

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