Search arXivSearch

arXiv · 2607.03911

Characteristic Polynomials of Graph- and Digraph-Deleted Catalan Arrangements

Abstract

We develop a finite-field stratification for characteristic polynomials of deletion subarrangements of the full $m$-Catalan arrangement. It reduces the count to cyclic placements of rigid blocks and yields falling-factorial expansions for deletions indexed by graphs, digraphs, and gain-labeled digraphs. The coefficients are graphical Stirling numbers for zero-layer deletions, directed matching numbers when the deleted layer $\ell$ satisfies $1\le \ell\le\lfloor m/2\rfloor$, directed path-cover numbers when $\lfloor m/2\rfloor<\ell\le m$, and admissible gain-labeled arc sets for multilayer deletions. For $\ell=m$, a complementary path-cover expansion yields factorization consequences. The method also gives formulas for directed Ish-type arrangements in terms of path-cycle covers and outdegrees.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yanru Chen, Ang Li, Suijie Wang. 2026-07-18. Characteristic Polynomials of Graph- and Digraph-Deleted Catalan Arrangements. https://arxiv.org/abs/2607.03911

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