| Named After: | Ernst Schröder, Hipparchus, Eugène Charles Catalan | |||||||||
| Publication Year: | 1870 (Schröder) | |||||||||
| Terms Number: | infinity | |||||||||
| Formula: | xn=
{n\choosei}{n\choosei-1}ki-1 | |||||||||
| First Terms: | 1, 1, 3, 11, 45, 197, 903 | |||||||||
| Oeis: | A001003 | |||||||||
| Oeis Name: | Little Schroeder numbers, Super Catalan |
In combinatorics, the Schröder–Hipparchus numbers form an integer sequence that can be used to count the plane trees with a given set of leaves, the ways of inserting parentheses into a sequence, and the ways of dissecting a convex polygon into smaller polygons by inserting diagonals. These numbers begin
1, 1, 3, 11, 45, 197, 903, 4279, 20793, 103049, ... .They are also called the super-Catalan numbers, the little Schröder numbers, or the Hipparchus numbers, after Eugène Charles Catalan and his Catalan numbers, Ernst Schröder and the closely related Schröder numbers, and the ancient Greek mathematician Hipparchus who appears from evidence in Plutarch to have known of these numbers.
The Schröder–Hipparchus numbers may be used to count several closely related combinatorial objects:[1] [2] [3]
As the figure shows, there is a simple combinatorial equivalence between these objects: a polygon subdivision has a plane tree as a form of its dual graph, the leaves of the tree correspond to the symbols in a parenthesized sequence, and the internal nodes of the tree other than the root correspond to parenthesized groups. The parenthesized sequence itself may be written around the perimeter of the polygon with its symbols on the sides of the polygon and with parentheses at the endpoints of the selected diagonals. This equivalence provides a bijective proof that all of these kinds of objects are counted by a single integer sequence.[1]
The same numbers also count the double permutations (sequences of the numbers from 1 to n, each number appearing twice, with the first occurrences of each number in sorted order) that avoid the permutation patterns 12312 and 121323.[4]
The closely related large Schröder numbers are equal to twice the Schröder–Hipparchus numbers, and may also be used to count several types of combinatorial objects including certain kinds of lattice paths, partitions of a rectangle into smaller rectangles by recursive slicing, and parenthesizations in which a pair of parentheses surrounding the whole sequence of elements is also allowed. The Catalan numbers also count closely related sets of objects including subdivisions of a polygon into triangles, plane trees in which all internal nodes have exactly two children, and parenthesizations in which each pair of parentheses surrounds exactly two symbols or parenthesized groups.[2]
The sequence of Catalan numbers and the sequence of Schröder–Hipparchus numbers, viewed as infinite-dimensional vectors, are the unique eigenvectors for the first two in a sequence of naturally defined linear operators on number sequences.[5] [6] More generally, the kth sequence in this sequence of integer sequences is (x1, x2, x3, ...) where the numbers xn are calculated as the sums of Narayana numbers multiplied by powers of k. This can be expressed as a hypergeometric function:
xn=
| n | |
| \sum | |
| i=1 |
N(n,i)ki-1=
| n | |
| \sum | |
| i=1 |
| 1 | |
| n |
{n\choosei}{n\choosei-1}ki-1={}2F1(1-n,-n;2;k).
In connection with the property of Schröder–Hipparchus numbers of counting faces of an associahedron, the number of vertices of the associahedron is given by the Catalan numbers. The corresponding numbers for the permutohedron are respectively the ordered Bell numbers and the factorials.
As well as the summation formula above, the Schröder–Hipparchus numbers may be defined by a recurrence relation:
| x | ||||
|
\left((6n-9)xn-1-(n-3)xn-2\right).
Plutarch's dialogue Table Talk contains the line:
Chrysippus says that the number of compound propositions that can be made from only ten simple propositions exceeds a million. (Hipparchus, to be sure, refuted this by showing that on the affirmative side there are 103,049 compound statements, and on the negative side 310,952.)[7]
This statement went unexplained until 1994, when David Hough, a graduate student at George Washington University, observed that there are 103049 ways of inserting parentheses into a sequence of ten items.[9] [7] [10] The historian of mathematics Fabio Acerbi (CNRS) has shown that a similar explanation can be provided for the other number: it is very close to the average of the tenth and eleventh Schröder–Hipparchus numbers, 310954, and counts bracketings of ten terms together with a negative particle.[10]
The problem of counting parenthesizations was introduced to modern mathematics by .[11]
Plutarch's recounting of Hipparchus's two numbers records a disagreement between Hipparchus and the earlier Stoic philosopher Chrysippus, who had claimed that the number of compound propositions that can be made from 10 simple propositions exceeds a million. Contemporary philosopher has argued that Chrysippus's calculation was the correct one, based on her analysis of Stoic logic. Bobzien reconstructs the calculations of both Chrysippus and Hipparchus, and says that showing how Hipparchus got his mathematics correct but his Stoic logic wrong can cast new light on the Stoic notions of conjunctions and assertibles.[12]