2000 character limit reached
Upper bounds for the rank of powers of quadrics (2305.06470v3)
Published 10 May 2023 in math.AG
Abstract: We establish an upper bound for the rank of every power of an arbitrary quadratic form. Specifically, for any $s\in\mathbb{N}$, we prove that the $s$-th power of a quadratic form of rank $n$ grows as $ns$. Furthermore, we demonstrate that its rank is subgeneric for all $n>(2s-1)2$.
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.