OFFSET
1,4
COMMENTS
It is unknown if this sequence is bounded. For all n >= 4, a(n) is at least two. It is unknown if it is 2 for infinitely many n. It is unknown if it is always even for all n >= 2. Note that 2n-3 appears in A143106 if and only if a(n) is 1 or 2.
LINKS
J. P. D'Angelo and J. Lebl, Complexity results for CR mappings between spheres, Internat. J. Math. 20 (2009), no. 2, 149-166.
J. P. D'Angelo and J. Lebl, Complexity results for CR mappings between spheres, arXiv:0708.3232 [math.CV], 2008.
J. P. D'Angelo, Simon Kos and Emily Riehl, A sharp bound for the degree of proper monomial mappings between balls, J. Geom. Anal., 13(4):581-593, 2003.
J. Lebl, Addendum to Uniqueness of certain polynomials constant on a line arxiv 1302.1441 [math.AC], 2013.
J. Lebl and D. Lichtblau, Uniqueness of certain polynomials constant on a hyperplane, arXiv:0808.0284 [math.CV], 2008-2010.
J. Lebl and D. Lichtblau, Uniqueness of certain polynomials constant on a hyperplane, Linear Algebra Appl., 433 (2010), no. 4, 824-837
EXAMPLE
a(3) = 1 as x^3 + 3xy + y^3 is the unique polynomial in H(2,d) with 3 terms and of maximum degree (in this case 3).
MATHEMATICA
See the paper by Lebl and Lichtblau.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Jiri Lebl, Jul 25 2008
EXTENSIONS
STATUS
approved