2000 character limit reached
If Terao's conjecture fails in , then it fails in $\mathbb{P}^{n > 2}$
Published 24 Feb 2025 in math.AG, math.AC, and math.CO | (2502.17031v2)
Abstract: Using an elementary technique, we construct a first example of Ziegler pairs of hyperplane arrangements in . Then, using this construction, we show how to obtain possible counterexamples to Terao's freeness conjecture in with $n>2$ using arrangements of lines in .
Paper Prompts
Sign up for free to create and run prompts on this paper.