2000 character limit reached
Matrixwise (approach to unexpected hypersurfaces) Reloaded
Published 25 Feb 2025 in math.AG | (2502.18088v1)
Abstract: In the paper we provide a new method of proving the existence of a hypersurface of degree $d$ in $\mathbb{P}n$, with a general point of multiplicity $m$ and vanishing at a given set of points $Z$, by looking at weak combinatorics of a set $Z$. This method has a direct application in the theory of unexpected hypersurfaces, where many of the examples are based only on computer experiments.
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.