Bivariate Gončarov polynomials and integer sequences
- 56 Downloads
Univariate Gončarov polynomials arose from the Gončarov interpolation problem in numerical analysis. They provide a natural basis of polynomials for working with u-parking functions, which are integer sequences whose order statistics are bounded by a given sequence u. In this paper, we study multivariate Gončarov polynomials, which form a basis of solutions for multivariate Gončarov interpolation problem. We present algebraic and analytic properties of multivariate Gončarov polynomials and establish a combinatorial relation with integer sequences. Explicitly, we prove that multivariate Gončarov polynomials enumerate k-tuples of integers sequences whose order statistics are bounded by certain weights along lattice paths in ℕ k . It leads to a higher-dimensional generalization of parking functions, for which many enumerative results can be derived from the theory of multivariate Gončarov polynomials.
KeywordsGončarov polynomials interpolation parking functions order statistics
MSC(2010)05A15 05A10 41A05 41A63
Unable to display preview. Download preview PDF.
- 2.Gončarov V L. Theory of Interpolation and Approximation of Functions. Moscow: Gosudarstv Izdat Tehn-Teor Lit., 1954Google Scholar
- 3.He T. On multivariate Abel-Gontscharoff interpolation. In: Neamtu M, Saff E B, eds. Advances in Constructive Approximation. Nashville, TN: Nashboro Press, 2004, 210–226Google Scholar
- 6.Khare N, Lorentz R, Yan C H. A new generalizations of Abel-type identities. In preparation, 2014Google Scholar
- 7.Knuth D E. Sorting and Searching. The Art of Computer Programming, vol. 3. Reading, MA: Addison-Wesley, 1973Google Scholar
- 15.Stanley R. Enumerative Combinatorics, vol. 1. 2nd ed. Cambridge: Cambridge Univ Press, 2001Google Scholar