Search arXivSearch

arXiv · 2511.12408

On gamma-vectors and Chow polynomials of restrictions of reflection arrangements

Abstract

Simplicial arrangements are a special class of hyperplane arrangements, having the property that every chamber is a simplicial cone. It is known that the simpliciality property is preserved under taking restrictions. In this article we focus on the class of reflection arrangements and investigate two different polynomial invariants associated to them and their restrictions, the $h$-polynomial with its $γ$-vector and the Chow polynomial. We prove that all restrictions of reflection arrangements are $γ$-positive and give an explicit combinatorial formula of the Chow polynomial in type $B$. Furthermore we prove that for a special class of restrictions of arrangements of type $D$, called intermediate arrangements, both the $h$-polynomial as well as the Chow polynomial behave arithmetically, that is they interpolate linearly between the respective invariants for type $B$ and $D$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sebastian Degen, Lisa Henetmayr, Magdaléna Mišinová, Paweł Pielasa, Florian Rieg. 2026-05-06. On gamma-vectors and Chow polynomials of restrictions of reflection arrangements. https://arxiv.org/abs/2511.12408

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

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO