Search arXivSearch

arXiv · 2603.24885

The geometry of a counting formula for deformations of the braid arrangement

Abstract

We consider real hyperplane arrangements whose hyperplanes are of the form $\{x_i - x_j = s\}$ for some integer $s$, which we call deformations of the braid arrangement. In 2018, Bernardi gave a counting formula for the number of regions of any deformation of the braid arrangement $\mathcal{A}$ as a signed sum over some decorated trees. He further showed that each of these decorated trees can be associated to a region $R$ of the arrangement $\mathcal{A}$, and hence we can consider the contribution of each region to the signed sum. Bernardi also implicitly showed that for transitive arrangements, the contribution of any region of the arrangement is $1$. We remove the transitivity condition, showing that for any deformation of the braid arrangement the contribution of a region to the signed sum is $1$. This provides an alternative proof of the original counting formula, and sheds light on the geometry underlying the formula. We further use this new geometric understanding to better understand the contribution of a tree.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Neha Goregaokar, Aaron Lin. 2026-03-25. The geometry of a counting formula for deformations of the braid arrangement. https://arxiv.org/abs/2603.24885

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