Deux propriétés combinatoires des nombres de Schröder

DOI10.1051/ita/1988220303611zbMath0669.05002OpenAlexW2398657003MaRDI QIDQ3822166

B. Vauquelin, Dominique Gouyou-Beauchamps

Publication date: 1988

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92313

zbMATH Keywords

Catalan numberSchröder numbercoloured lattice paths

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items

Uniform generation of a Schröder tree, Generating trees and the Catalan and Schröder numbers, Enumerating Davenport-Schinzel sequences, Enumerating a class of lattice paths, Identities from weighted Motzkin paths, Some more properties of Catalan numbers, Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths, Schröder's paths and random hierarchies, Some combinatorial interpretations of \(q\)-analogs of Schröder numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
• Binomial determinants, paths, and hook length formulae
• Combinatorial aspects of continued fractions
• Automorphisms on Catalan trees and bracketings
• Enumeration of plane trees by branches and endpoints
• A Catalan triangle
• A short proof of an identity of Touchard's concerning Catalan numbers
• Restricted plane tree representations of four Motzkin-Catalan equations
• A note about the Catalan triangle
• Pascal triangles, Catalan numbers and renewal arrays
• Orthogonal polynomials and enumeration problems in molecular biology
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• THE ENUMERATION OF A FAMILY OF LADDER GRAPHS PART II: SCHRODER AND SUPERCONNECTIVE RELATIONS
• A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
• The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
• On the number of certain lattice polygons
• THE ENUMERATION OF A FAMILY OF LADDER GRAPHS
• Historical Note on a Recurrent Combinatorial Problem
• Correspondences between plane trees and binary sequences
• Note on a “Square” Functional Equation
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• Motzkin numbers