Search arXivSearch

arXiv · 2608.29203

Cyclically Compatible Deformations of the Braid Arrangement

Abstract

We prove a characteristic-polynomial shift formula for two-sided extensions of cyclically compatible deformations of the braid arrangement. For a nonnegative integer matrix $M=(m_{ij})$ with zero diagonal, let $\mathcal{A}_M$ be the arrangement \[ x_i-x_j=s,\qquad 1\le i<j\le n,\quad s\in[-m_{ij},m_{ji}]_{\mathbb{Z}}. \] Given $α,β\in\mathbb{N}^n$, define its two-sided extension $\mathcal{A}_M(α,β)$ by replacing this interval with \[ [-m_{ij}-α_i-β_j,\, m_{ji}+α_j+β_i]_{\mathbb{Z}}. \] Call $M$ cyclically compatible if all pairwise distinct $a,b,c$ with $1\le a,b,c\le n$ satisfy \[ m_{ac}\le m_{ab}+m_{bc}+1. \] Under this condition, for the reduced characteristic polynomial $\widetildeχ(\mathcal{A},t) =\dfrac{χ(\mathcal{A},t)}{t}$, we have \[ \widetildeχ(\mathcal{A}_M(α,β),t) = \widetildeχ(\mathcal{A}_M,t-|α|-|β|). \] The proof uses the finite-field method and a cyclic-gap enumeration formula. We also establish redistribution invariance, study weak-sum perturbations, and give applications to Shi, uniform interval, graphical, and Ferrers-type deformations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yanru Chen, Ang Li, Suijie Wang. 2026-09-05. Cyclically Compatible Deformations of the Braid Arrangement. https://arxiv.org/abs/2608.29203

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