Skip to main content

Families enumerated by the schröder-etherington sequence and a renewal array it generates

  • Contributed Papers
  • Conference paper
  • First Online:
Combinatorial Mathematics X

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1036))

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 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
Price excludes VAT (USA)
  • Compact, lightweight 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. M. Abramowitz and I.A. Stegun, Handbook of Mathematical Functions, U.S. Government Printing Office, 1968.

    Google Scholar 

  2. A. Cayley, On the theory of the analytical forms called trees, Philosophical Magazine, 13 (1857) 172–176.

    Google Scholar 

  3. I.H.M. Etherington, some problems of non-associative combinations (1), Edinburgh Mathematical Notes 32 (1940) I–IV.

    Article  Google Scholar 

  4. H.M. Finucan, Some decompositions of generalised Catalan Numbers, preprint to appear in the Proceedings of the Ninth Australian Conference of Combinatorial Mathematics.

    Google Scholar 

  5. I.J. Good, The generalisation of Lagrange's expansion and the enumeration of trees, Proc. Camb. Phil. Soc., 61(1965) 499–517.

    Article  MathSciNet  MATH  Google Scholar 

  6. S.G. Kettle, Every Catalan family is an Etherington family and vice versa, in preparation.

    Google Scholar 

  7. H. Lausch and W. Nöbauer, Algebra of Polynomials, North-Holland Publishing Co., London/New York, 1973.

    MATH  Google Scholar 

  8. G. Labelle, Une Nourelle démonstration combinatoire der formules d'inversion de Lagrange, Advances in Maths. 42(1981) 217–247.

    Article  MathSciNet  MATH  Google Scholar 

  9. J.W. Moon, Counting labelled trees, Canadian Mathematical Monographs, 1970.

    Google Scholar 

  10. R.C. Mullin and R.G. Stanton, A map-theoretic approach to Davenport-Schinzel sequences, Pacific Journal of Mathematics (1) 40(1972) 167–172.

    Article  MathSciNet  MATH  Google Scholar 

  11. G.N. Raney, Functional composition patterns and power series reversion, Trans. Am. Math. Soc., 94(1960), 441–451.

    Article  MathSciNet  MATH  Google Scholar 

  12. D.G. Rogers, Pascal triangles, Catalan numbers and renewal arrays, Discrete Mathematics 22 (1978) 301–310.

    Article  MathSciNet  MATH  Google Scholar 

  13. E. Schröder, Vier combinatorische Probleme, Zeitschrift für Mathematik und Physik, 15 (1870), 371–376.

    Google Scholar 

  14. N.J.A. Sloane, A handbook of integer sequences, Academic Press, New York, 1973.

    MATH  Google Scholar 

  15. G.N. Watterson, private communication.

    Google Scholar 

  16. J.G. Wendel, Left-continuous random walk and the Lagrange expansion, Am. Math. Monthly, 82 (1975) 494–499.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Louis Reynolds Antoine Casse

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Kettle, S.G. (1983). Families enumerated by the schröder-etherington sequence and a renewal array it generates. In: Casse, L.R.A. (eds) Combinatorial Mathematics X. Lecture Notes in Mathematics, vol 1036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0071523

Download citation

  • DOI: https://doi.org/10.1007/BFb0071523

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12708-6

  • Online ISBN: 978-3-540-38694-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics