2000 character limit reached
On the Waring Rank of Binary Forms
Published 28 Oct 2016 in math.AG and math.NT | (1610.09065v2)
Abstract: The $K$-rank of a binary form $f$ in $K[x,y],~K\subseteq \mathbb{C},$ is the smallest number of $d$-th powers of linear forms over $K$ of which $f$ is a $K$-linear combination. We provide lower bounds for the $\mathbb{C}$-rank (Waring rank) and for the $\mathbb{R}$-rank (real Waring rank) of binary forms depending on their factorization. We completely classify binary forms of Waring rank 3.
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.