TL;DR
This paper investigates polynomials with positive coefficients that are constant on a line, characterizes those achieving the maximum degree for a given number of terms, and classifies them up to degree 17, with implications for CR map classification.
Contribution
It provides new insights into the structure of sharp polynomials and offers a complete classification up to degree 17 using theoretical and computational methods.
Findings
Proved new results about the form of sharp polynomials.
Established a complete classification of these polynomials up to degree 17.
Confirmed the sharp degree bound for polynomials with positive coefficients.
Abstract
We study a question with connections to linear algebra, real algebraic geometry, combinatorics, and complex analysis. Let be a polynomial of degree with positive coefficients and no negative coefficients, such that when . A sharp estimate is known. In this paper we study the for which equality holds. We prove some new results about the form of these "sharp" polynomials. Using these new results and using two independent computational methods we give a complete classification of these polynomials up to . The question is motivated by the problem of classification of CR maps between spheres in different dimensions.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
