Combinatorially equivalent hyperplane arrangements
Abstract
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong σ-Gr\"obner bases. Moreover, we prove that the Terao's conjecture over finite fields implies the conjecture over the rationals.
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.