2000 character limit reached
Hypertetrahedral arrangements
Published 1 Nov 2021 in math.AG | (2111.01116v1)
Abstract: In this paper, we introduce the notion of a complete hypertetrahedral arrangement $\mathcal{A}$ in $\mathbb{P}{n}$. We address two basic problems. First, we describe the local freeness of $\mathcal{A}$ in terms of smaller complete hypertetrahedral arrangements and graph theory properties, specializing the Musta\c{t}\u{a}-Schenck criterion. As an application, we obtain that general complete hypertetrahedral arrangements are not locally free. In the second part of this paper, we bound the initial degree of the first syzygy module of the Jacobian ideal of $\mathcal{A}$.
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.