Waring's problem for pseudo-polynomials
Manfred G. Madritsch

TL;DR
This paper extends Waring's problem to pseudo-polynomials, which are like polynomials but include at least one non-integer exponent, exploring their additive representations and building on prior work for real powers greater than 12.
Contribution
It introduces the concept of pseudo-polynomials into Waring's problem and extends existing results for real powers above 12 to this broader class.
Findings
Extended Waring's problem to pseudo-polynomials.
Established representability results for pseudo-polynomials.
Built on prior work for real powers > 12.
Abstract
Waring's problem has a long history in additive number theory. In its original form it deals with the representability of every positive integer as sum of -th powers with integer . Instead of these powers we deal with pseudo-polynomials in this paper. A pseudo-polynomial is a ``polynomial'' with at least one exponent not being an integer. Our work extends earlier results on the related problem of Waring for arbitrary real powers by Deshouillers and Arkhipov and Zhitkov.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Tensor decomposition and applications
