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öbner bases. Moreover, we prove that the Terao's conjecture over finite fields implies the conjecture over the rationals.
| Original language | English (US) |
|---|---|
| Article number | 102202 |
| Journal | Advances in Applied Mathematics |
| Volume | 128 |
| DOIs | |
| State | Published - Jul 2021 |
| Externally published | Yes |
Keywords
- Combinatorially equivalent
- Hyperplane arrangements
- Lattice of intersections
- Modular methods
- Terao's conjecture
ASJC Scopus subject areas
- Applied Mathematics