Combinatorially equivalent hyperplane arrangements

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 $sigma$-Grobner bases. Moreover, we prove that the Teraos conjecture over finite fields implies the conjecture over the rationals.