Hipparchus, Plutarch, Schroder, and Hough

DOI10.2307/2974582zbMath0873.01002OpenAlexW4236326450WikidataQ56049167 ScholiaQ56049167MaRDI QIDQ4339330

Richard P. Stanley

Publication date: 9 October 1997

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2974582

zbMATH Keywords

Catalan numbersSchröder numbersErnst SchröderHipparchusChrysippusPlutarchbracketing problems

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) History of Greek and Roman mathematics (01A20) History of combinatorics (05-03)

Related Items (32)

Three recurrences for parallelogram polyominoes ⋮ Permutation of elements in double semigroups ⋮ The Narayana distribution ⋮ A unified approach to polynomial sequences with only real zeros ⋮ ANISOTROPIC STEP, SURFACE CONTACT, AND AREA WEIGHTED DIRECTED WALKS ON THE TRIANGULAR LATTICE ⋮ A classic proof of a recurrence for a very classical sequence ⋮ Book review of: É. Ghys, A singular mathematical promenade ⋮ Arithmetic properties of Delannoy numbers and Schröder numbers ⋮ Parametric Catalan numbers and Catalan triangles ⋮ Some \(\gamma \)-positive polynomials arising from enumerations of the pseudo Schröder paths ⋮ Riordan arrays and difference equations of subdiagonal lattice paths ⋮ The \(m\)-Schröder paths and \(m\)-Schröder numbers ⋮ PICK TWO POINTS IN A TREE ⋮ Generalized Schröder matrices arising from enumeration of lattice paths ⋮ Aztec diamonds and digraphs, and Hankel determinants of Schröder numbers ⋮ Seven (lattice) paths to log-convexity ⋮ Schröder's paths and random hierarchies ⋮ Koszul duality for monoids and the operad of enriched rooted trees ⋮ Asymptotic Results for Semigroups of Order-Preserving Partial Transformations ⋮ ECO:a methodology for the enumeration of combinatorial objects ⋮ Finding the Description of Structure by Counting Method: A Case Study ⋮ Taylor expansions for the generating function of Catalan-like numbers ⋮ Schr\"oder Coloring and Applications ⋮ Some Properties and Combinatorial Implications of Weighted Small Schr\"oder Numbers ⋮ Loopless Algorithms And SchrÖder Trees ⋮ Enumerating Types of Boolean Functions ⋮ On Motzkin numbers and central trinomial coefficients ⋮ Refined Chung-Feller theorems for lattice paths ⋮ Permutations, parenthesis words, and Schröder numbers ⋮ Analytic combinatorics of non-crossing configurations ⋮ Enumerating symmetric peaks in non-decreasing Dyck paths ⋮ Proof of Sun’s conjectures on Schröder-like numbers

This page was built for publication: Hipparchus, Plutarch, Schroder, and Hough