Skip to main content

A schröder triangle: Three combinatorial problems

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

Abstract

Two integer sequences, associated with a combinatorial problem of Schröder and related to the more familiar sequence of Catalan numbers are considered. Three combinatorial interpretations of the sequences are given which are variants of interpretations of the Catalan numbers. The method of enumeration used is that of first or last passage decomposition. This leads to a renewal array having many of the properties of Pascal's triangle.

Keywords

  • Convex Polygon
  • Combinatorial Problem
  • Triangular Array
  • Catalan Number
  • Integer Sequence

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Catalan, E. Note sur une équation aux différence finies. J. Math. Pures Appl., 3(1838), 505–507.

    Google Scholar 

  2. Cayley, A. On the partition of a polygon. Proc. London Math. Soc. 22(1) (1891), 237–263.

    MathSciNet  MATH  Google Scholar 

  3. Comtet, L. Sur le quatrième problème et les nombres de Schröder. Comptes Rendus Acad. Sci. Paris 271(1970), 913–916.

    MathSciNet  MATH  Google Scholar 

  4. Comtet, L. Advanced Combinatorics. D. Reidel, Dordrecht (1974).

    CrossRef  MATH  Google Scholar 

  5. Domb, C. & Barret, A.J. Enumeration of Ladder Graphs. Discrete Maths 9(1974), 341–358.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Euler, L. Novi Commentarii Academiae Scientiarum Imperialis Petropolitanae, 7(1758/9), 13–14.

    Google Scholar 

  7. Klarner, D.A. Correspondences between Plane Trees and Binary Sequences. J. Comb. Th. 9(1970), 401–411.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Motzkin, Th. Relations between hypersurface cross ratios and a combinatorial formula for partitions of a polygon, for permanent preponderence and for non-associative products. Bull. Am. Math. Soc. 54(1948), 352–360.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Riordan, J. Combinatorial Identities. J. Wiley, New York (1968).

    MATH  Google Scholar 

  10. Riordan, J. The Blossoming of Schröder's fourth problem. Acta Math. (1976) to appear.

    Google Scholar 

  11. Rogers, D.G. Pascal Triangles, Catalan Numbers and Renewal Arrays.

    Google Scholar 

  12. Rogers, D.G. Similarity Relations on Finite Ordered Sets. J. Comb. Th. (to appear).

    Google Scholar 

  13. Rogers, D.G. The Enumeration of a Family of Ladder Graphs by Edges.

    Google Scholar 

  14. Schröder, E. Vier combinatorische Probleme Z. für M. Phys. 15(1870), 361–376.

    Google Scholar 

  15. Shapiro, L.W. A Catalan Triangle. Discrete Maths. 11(1976), 83–90.

    CrossRef  MathSciNet  MATH  Google Scholar 

  16. Temperley, H.N.V. & Lieb, E.H. Relations between the ‘percolation’ and ‘colouring’ problem and other graph theoretical problems associated with regular planar-lattices; some exact results for the percolation problem. Proc. Roy. Soc. 322A (1971), 251–280.

    CrossRef  MathSciNet  MATH  Google Scholar 

  17. Whittaker, E.T. & Watson, G.N. A course of modern analysis. 4th ed. Cambridge U.P. (1946).

    Google Scholar 

  18. Handa, B.R. & Mohanty, S.G. Higher Dimensional Lattice Paths with Diagonal Steps. Discrete Maths 15(1976), 137–140.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1977 Springer-Verlag

About this paper

Cite this paper

Rogers, D.G. (1977). A schröder triangle: Three combinatorial problems. In: Little, C.H.C. (eds) Combinatorial Mathematics V. Lecture Notes in Mathematics, vol 622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0069192

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08524-9

  • Online ISBN: 978-3-540-37020-8

  • eBook Packages: Springer Book Archive