2000 character limit reached
Combinatorially equivalent hyperplane arrangements
Published 13 Jun 2019 in math.CO and math.AG | (1906.05463v3)
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 $\sigma$-Gr\"obner bases. Moreover, we prove that the Terao's conjecture over finite fields implies the conjecture over the rationals.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.