Search arXivSearch

arXiv · 2509.16569

Exponents of $2$-multiarrangements and Wakefield--Yuzvinsky matrices

Abstract

In the theory of hyperplane arrangements, M. Wakefield and S. Yuzvinsky utilized a square matrix in their research on the exponents of $2$-dimensional multiarrangements. Using such a matrix, they showed that the exponents of $2$-dimensional multiarrangements are as close as possible in general position for any fixed balanced multiplicity. In this article, we introduce a matrix similar to that of Wakefield and Yuzvinsky and explore further applications to the exponents. In fact, the exponents of $2$-dimensional multiarrangements are determined by whether the corresponding matrices have full rank. As one of our main results, we introduce a new class of $2$-dimensional arrangements for which the exponents are as close as possible for any balanced multiplicities, except for the constant one multiplicity. We also proceed with the classification of $B_2$-exponents, and we provide an alternative proof for some known results on the exponents.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shota Maehara. 2026-03-23. Exponents of $2$-multiarrangements and Wakefield--Yuzvinsky matrices. https://arxiv.org/abs/2509.16569

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