Papers › Uniqueness of certain polynomials constant on a line
Uniqueness of certain polynomials constant on a line
Jiri Lebl, Daniel Lichtblau
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We study a question with connections to linear algebra, real algebraic geometry, combinatorics, and complex analysis. Let p(x,y) be a polynomial of degree d with N positive coefficients and no negative coefficients, such that p=1 when x+y=1. A sharp estimate d ≤2N-3 is known. In this paper we study the p 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 d=17. The question is motivated by the problem of classification of CR maps between spheres in different dimensions.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections