Papers
Topics
Authors
Recent
Search
2000 character limit reached

$k$-Adjoint of Hyperplane Arrangements

Published 9 Dec 2024 in math.CO | (2412.06633v2)

Abstract: In this paper, we introduce the $k$-adjoint of a given hyperplane arrangement $\mathcal{A}$ associated with rank-$k$ elements in the intersection lattice $L(\mathcal{A})$, which generalizes the classical adjoint proposed by Bixby and Coullard. The $k$-adjoint of $\mathcal{A}$ induces a decomposition of the Grassmannian, which we call the $\mathcal{A}$-adjoint decomposition. Inspired by the work of Gelfand, Goresky, MacPherson, and Serganova, we generalize the matroid decomposition and refined Schubert decomposition of the Grassmannian from the perspective of $\mathcal{A}$. Furthermore, we prove that these three decompositions are exactly the same decomposition. A notable application involves providing a combinatorial classification of all the $k$-dimensional restrictions of $\mathcal{A}$. Consequently, we establish the anti-monotonicity property of some combinatorial invariants, such as Whitney numbers of the first kind and the independece numbers.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.