Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.