A classic proof of a recurrence for a very classical sequence

DOI10.1006/JCTA.1997.2814MaRDI QIDQ1374205zbMATH OpenOpenAlexFDO

Authors Doron Zeilberger, Dominique Foata

Publication date 2 December 1997

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9805015

zbMATH Keywords

bijectionwell-weighted treesSchröder numbers

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15)

Abstract: By practicing the philosophy of our beloved late master, Marco Schutzenberger, to whose memory this article is dedicated, we give an insightful bijective proof of the three-term recurrence satisfied by the Hipparchus-Schroeder numbers 1,1,3,11,45,197,903, ...

Recommendations

• scientific article; zbMATH DE number 3255034
• scientific article; zbMATH DE number 762267
• scientific article; zbMATH DE number 987484
• A simple bijective proof of a familiar derangement recurrence
• scientific article; zbMATH DE number 6985711
• scientific article; zbMATH DE number 4091792
• A SIMPLE PROOF OF A DIFFERENCE SEQUENCE
• scientific article; zbMATH DE number 58832
• scientific article; zbMATH DE number 2321805
• A combinatorial proof of a recurrence relation for the sum of divisors function

Cites work

• scientific article; zbMATH DE number 3897991 (Why is no real title available?)
• scientific article; zbMATH DE number 3900794 (Why is no real title available?)
• scientific article; zbMATH DE number 3489159 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• Calcul pratique des coefficients de Taylor d'une fonction algébrique
• Hipparchus, Plutarch, Schroder, and Hough

Cited in

(19)

• Loopless Algorithms And SchrÖder Trees
• Logarithmic behavior of some combinatorial sequences
• The signs of three-term recurrence sequences
• Bijective proofs of recurrences involving two Schröder triangles
• Analytic properties of combinatorial triangles related to Motzkin numbers
• Bijective recurrences for Motzkin paths
• Permutation of elements in double semigroups
• A criterion for the log-convexity of combinatorial sequences
• Holonomic equations and efficient random generation of binary trees
• Three recurrences for parallelogram polyominoes
• Some Properties and Combinatorial Implications of Weighted Small Schr\"oder Numbers
• Schröder's paths and random hierarchies
• Uniform generation of a Schröder tree
• Parametric Catalan numbers and Catalan triangles
• A unified approach to polynomial sequences with only real zeros
• The Narayana distribution
• Riordan paths and derangements
• A relation between Schröder paths and Motzkin paths
• On the log-convexity of combinatorial sequences

This page was built for publication: A classic proof of a recurrence for a very classical sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374205)