Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On real Waring decompositions of real binary forms (1910.10771v2)

Published 23 Oct 2019 in math.AG

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

We haven't generated a summary for this paper yet.