Abstract
The r-th Faber polynomial of the Laurent series f(t) = t + f 0 + f 1/t + f 2/t 2 + … is the unique polynomial F r (u) of degree r in u such that F r (f) = t r + negative powers of t. We apply Faber polynomials, which were originally used to study univalent functions, to lattice path enumeration.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brini, A. (1984). Higher dimensional recursive matrices and diagonal delta sets of series, Journal of Combinatorial Theory, Series A, 36, 315–331.
Gessel, I. M. (1980). A factorization for formal Laurent series and lattice path enumeration, Journal of Combinatorial Theory, Series A, 28, 321–337.
Jabotinsky, E. (1953). Representation of functions by matrices. Application to Faber polynomials, Proceedings of the American Mathematical Society, 4, 546–553.
Mohanty, S. G. (1979). Lattice Path Counting and Applications, New York: Academic Press.
Ree, S. (1994). Enumeration of lattice paths and P-partitions, Ph.D. Thesis, Brandeis University
Schiffer, M. (1948). Faber polynomials in the theory of univalent functions, Bulletin of the American Mathematical Society, 54, 503–517.
Schur, I. (1945). On Faber polynomials, American Journal of Mathematics, 67, 33–41.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Birkhäuser Boston
About this chapter
Cite this chapter
Gessel, I.M., Ree, S. (1997). Lattice Paths and Faber Polynomials. In: Balakrishnan, N. (eds) Advances in Combinatorial Methods and Applications to Probability and Statistics. Statistics for Industry and Technology. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-4140-9_1
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4140-9_1
Publisher Name: Birkhäuser Boston
Print ISBN: 978-1-4612-8671-4
Online ISBN: 978-1-4612-4140-9
eBook Packages: Springer Book Archive