Pythagorean Hyperplane Arrangements: Combinatorics of Gain Genericity
Abstract
We study Pythagorean hyperplane arrangements, originally defined by Zaslavsky. In this first part of a series on such arrangements, we introduce a new notion of genericity for such arrangements. Using this notion we construct an auxiliary hyperplane arrangement whose combinatorics determines the combinatorics of all possible Pythagorean arrangements. We close with several applications and examples.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.