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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Catalan, E. Note sur une équation aux différence finies. J. Math. Pures Appl., 3(1838), 505–507.
Cayley, A. On the partition of a polygon. Proc. London Math. Soc. 22(1) (1891), 237–263.
Comtet, L. Sur le quatrième problème et les nombres de Schröder. Comptes Rendus Acad. Sci. Paris 271(1970), 913–916.
Comtet, L. Advanced Combinatorics. D. Reidel, Dordrecht (1974).
Domb, C. & Barret, A.J. Enumeration of Ladder Graphs. Discrete Maths 9(1974), 341–358.
Euler, L. Novi Commentarii Academiae Scientiarum Imperialis Petropolitanae, 7(1758/9), 13–14.
Klarner, D.A. Correspondences between Plane Trees and Binary Sequences. J. Comb. Th. 9(1970), 401–411.
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.
Riordan, J. Combinatorial Identities. J. Wiley, New York (1968).
Riordan, J. The Blossoming of Schröder's fourth problem. Acta Math. (1976) to appear.
Rogers, D.G. Pascal Triangles, Catalan Numbers and Renewal Arrays.
Rogers, D.G. Similarity Relations on Finite Ordered Sets. J. Comb. Th. (to appear).
Rogers, D.G. The Enumeration of a Family of Ladder Graphs by Edges.
Schröder, E. Vier combinatorische Probleme Z. für M. Phys. 15(1870), 361–376.
Shapiro, L.W. A Catalan Triangle. Discrete Maths. 11(1976), 83–90.
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.
Whittaker, E.T. & Watson, G.N. A course of modern analysis. 4th ed. Cambridge U.P. (1946).
Handa, B.R. & Mohanty, S.G. Higher Dimensional Lattice Paths with Diagonal Steps. Discrete Maths 15(1976), 137–140.
Editor information
Editors and Affiliations
Rights 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
