2000 character limit reached
On real Waring decompositions of real binary forms
Published 23 Oct 2019 in math.AG | (1910.10771v2)
Abstract: The Waring Problem over polynomial rings asks how to decompose a homogeneous polynomial $p$ of degree $d$ as a finite sum of $d$-{th} powers of linear forms. In this work we give an algorithm to obtain a real Waring decomposition of any given real binary form $p$ of length at most its degree. In fact, we construct a semialgebraic family of Waring decompositions for $p$. Some examples are shown to highlight the difference between the real and the complex case.
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.