$k$-Adjoint of Hyperplane Arrangements
Weikang Liang, Suijie Wang, and Chengdong Zhao

TL;DR
This paper introduces the $k$-adjoint of hyperplane arrangements, generalizing classical concepts, and demonstrates its equivalence to existing decompositions of the Grassmannian, with applications in combinatorial classification and invariant properties.
Contribution
It defines the $k$-adjoint of hyperplane arrangements and proves its equivalence to known Grassmannian decompositions, extending matroid and Schubert decompositions.
Findings
Unified decomposition of Grassmannian via $k$-adjoint
Classification of $k$-dimensional restrictions of arrangements
Anti-monotonicity of Whitney and independence numbers
Abstract
In this paper, we introduce the -adjoint of a given hyperplane arrangement associated with rank- elements in the intersection lattice , which generalizes the classical adjoint proposed by Bixby and Coullard. The -adjoint of induces a decomposition of the Grassmannian, which we call the -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 . Furthermore, we prove that these three decompositions are exactly the same decomposition. A notable application involves providing a combinatorial classification of all the -dimensional restrictions of . Consequently, we establish the anti-monotonicity property of some combinatorial invariants, such as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Graph Theory Research · Limits and Structures in Graph Theory
