English

Uniqueness of certain polynomials constant on a line

Complex Variables 2010-05-26 v3 Computational Geometry Number Theory

Abstract

We study a question with connections to linear algebra, real algebraic geometry, combinatorics, and complex analysis. Let p(x,y)p(x,y) be a polynomial of degree dd with NN positive coefficients and no negative coefficients, such that p=1p=1 when x+y=1x+y=1. A sharp estimate d2N3d \leq 2N-3 is known. In this paper we study the pp 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=17d=17. The question is motivated by the problem of classification of CR maps between spheres in different dimensions.

Keywords

Cite

@article{arxiv.0808.0284,
  title  = {Uniqueness of certain polynomials constant on a line},
  author = {Jiri Lebl and Daniel Lichtblau},
  journal= {arXiv preprint arXiv:0808.0284},
  year   = {2010}
}

Comments

20 pages, latex; removed section 10 and address referee suggestions; accepted to Linear Algebra and its Applications

R2 v1 2026-06-21T11:07:03.526Z