Search arXivSearch

arXiv · math/0405210

The line geometry of resonance varieties

Abstract

Let R^1(A,R) be the degree-one resonance variety over a field R of a hyperplane arrangement A. We give a geometric description of R^1(A,R) in terms of projective line complexes. The projective image of R^1(A,R) is a union of ruled varieties, parametrized by neighborly partitions of subarrangements of A. The underlying line complexes are intersections of special Schubert varieties, easily described in terms of the corresponding partition. We generalize the definition and decomposition of R^1(A,R) to arbitrary commutative rings, and point out the anomalies that arise. In general the decomposition is parametrized by neighborly graphs, which need not induce neighborly partitions of subarrangements of A. We use this approach to show that the resonance variety of the Hessian arrangement over a field of characteristic three has a nonlinear component, a cubic threefold with interesting line structure. This answers a question of A. Suciu. We show that Suciu's deleted B_3 arrangement has resonance components over Z_2 that intersect nontrivially. We also exhibit resonant weights over Z_4 supported on the deleted B_3, which has no neighborly partitions. The modular resonant weights on the deleted B_3 exponentiate to points on the complex torus which lie on, and determine, the translated 1-torus in the first characteristic variety.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Falk. 2004-09-27. The line geometry of resonance varieties. https://arxiv.org/abs/math/0405210

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