Change search
ReferencesLink to record
Permanent link

Direct link
Narayana numbers and Schur-Szegö composition
Dept of Mathematics, Univ. de Nice.
Dept. of Mathematics, Univ. of Almeria.
Stockholm University, Faculty of Science, Department of Mathematics.
2009 (English)In: Journal of Approximation Theory, ISSN 0021-9045, E-ISSN 1096-0430, Vol. 161, 464-476 p.Article in journal (Refereed) Published
Abstract [en]

In the present paper we find a new interpretation of Narayana polynomials N-n(x) which are the generating polynomials for the Narayana numbers N-n,N-k = 1/nC(n)(k-1)C(n)(k) where C-j(i) stands for the usual binomial coefficient, i.e. C-j(i) = j!/i!(j-i)!. They count Dyck paths of length n and with exactly k peaks, see e.g. [R.A. Sulanke, The Narayana distribution, in: Lattice Path Combinatorics and Applications (Vienna, 1998), J. Statist. Plann. Inference 101 (1-2) (2002) 311-326 (special issue)] and they appeared recently in a number of different combinatorial situations, see for e.g. [. Doslic, D. Syrtan, D. Veljan, Enumerative aspects of secondary structures, Discrete Math. 285 (2004) 67-82; A. Sapounakis, I. Tasoulas, P. Tsikouras, Counting strings in Dyck paths, Discrete Math. 307 (2007) 2909-2924; F. Yano, H. Yoshida, Some set partitions statistics in non-crossing partitions and generating functions, Discrete Math. 307 (2007) 3147-3160]. Strangely enough Narayana polynomials also occur as limits as n -> infinity of the sequences of eigenpolynomials of the Schur-Szego composition map sending (n - 1)-tuples of polynomials of the form (x +1)(n-1) (x + a) to their Schur-Szego product, see below. We present below a relation between Narayana polynomials and the classical Gegenbauer polynomials which implies, in particular, an explicit formula for the density and the distribution function of the asymptotic root-counting measure of the polynomial sequence {N-n(x)}.

Place, publisher, year, edition, pages
2009. Vol. 161, 464-476 p.
Keyword [en]
Narayana numbers, Schur-Szegö composition
National Category
Research subject
URN: urn:nbn:se:su:diva-49755DOI: 10.1016/j.jat.2008.10.013ISI: 000272562300004OAI: diva2:379375
Available from: 2010-12-31 Created: 2010-12-17 Last updated: 2011-06-20Bibliographically approved

Open Access in DiVA

fulltext(183 kB)42 downloads
File information
File name FULLTEXT01.pdfFile size 183 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Shapiro, Boris
By organisation
Department of Mathematics
In the same journal
Journal of Approximation Theory

Search outside of DiVA

GoogleGoogle Scholar
Total: 42 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 66 hits
ReferencesLink to record
Permanent link

Direct link