Combinatorially equivalent hyperplane arrangements (Q2035996)

The authors study the combinatorics of hyperplane arrangements defined over an arbitrary field. More specifically, the authors determine in which situation an arrangement (defined over the integers) and its reduction modulo a prime number have isomorphic intersection lattices via the notion of minimal strong \(\sigma\)-Groebner bases. In the second part of the paper, the authors focus on Terao's conjecture. Let us recall that this conjecture predicts that the freeness of a hyperplane arrangement depends only on its intersection lattice. Based on their results on reductions modulo prime numbers, the authors prove that if Terao's conjecture holds over all \(\mathbb{F}_{p}\) fields, then it holds over the rational numbers.