|
| |
|
|
A143108
|
|
Let H(2,d) be the space of polynomials p(x,y) of two variables with nonnegative coefficients such that p(x,y)=1 whenever x+y=1. a_n is the number of different polynomials in H(2,d) with exactly n distinct monomials and of maximum degree minus 1, i.e. of degree 2n-4.
|
|
2
| | |
|
|
|
OFFSET
| 1,3
|
|
|
REFERENCES
| J. P. D'Angelo and J. Lebl. Complexity results for CR mappings between spheres. to appear in Internat. J. Math., preprint arXiv:0708.3232.
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 and D. Lichtblau. Uniqueness of certain polynomials constant on a hyperplane. preprint
|
|
|
LINKS
| J. P. D'Angelo and J. Lebl. Complexity results for CR mappings between spheres, to appear in Internat. J. Math.
|
|
|
FORMULA
| Possibly can be computed from A143107 except for the third term, but this is not proved. Let b_n be elements of A143107, then a_n = 2 ( b_2 b_{n-1} + b_3 b_{n-2} + ... + b_{n-1} b_2 )
|
|
|
MATHEMATICA
| See the paper by Lebl-Lichtblau
|
|
|
CROSSREFS
| Cf. A143107, A143109.
Sequence in context: A109887 A200981 A103038 * A169790 A014009 A085386
Adjacent sequences: A143105 A143106 A143107 * A143109 A143110 A143111
|
|
|
KEYWORD
| hard,nonn,more
|
|
|
AUTHOR
| Jiri Lebl (jlebl(AT)math.uiuc.edu), Jul 25 2008
|
| |
|
|
