Skip to main content

Part of the book series: Statistics for Industry and Technology ((SIT))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brini, A. (1984). Higher dimensional recursive matrices and diagonal delta sets of series, Journal of Combinatorial Theory, Series A, 36, 315–331.

    Article  MathSciNet  MATH  Google Scholar 

  2. Gessel, I. M. (1980). A factorization for formal Laurent series and lattice path enumeration, Journal of Combinatorial Theory, Series A, 28, 321–337.

    Article  MathSciNet  Google Scholar 

  3. Jabotinsky, E. (1953). Representation of functions by matrices. Application to Faber polynomials, Proceedings of the American Mathematical Society, 4, 546–553.

    Article  MathSciNet  MATH  Google Scholar 

  4. Mohanty, S. G. (1979). Lattice Path Counting and Applications, New York: Academic Press.

    MATH  Google Scholar 

  5. Ree, S. (1994). Enumeration of lattice paths and P-partitions, Ph.D. Thesis, Brandeis University

    Google Scholar 

  6. Schiffer, M. (1948). Faber polynomials in the theory of univalent functions, Bulletin of the American Mathematical Society, 54, 503–517.

    Article  MathSciNet  MATH  Google Scholar 

  7. Schur, I. (1945). On Faber polynomials, American Journal of Mathematics, 67, 33–41.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics