Name
Abstract | ||
|---|---|---|
A Catalan pair is a pair of binary relations (S,R) satisfying some axioms. These pairs are enumerated by the well-known Catalan numbers, and have been introduced in Disanto et al. (2010) [2] with the aim of giving a common language to many structures counted by Catalan numbers. Here, a simple method is given to pass from the recursive definition of a generic Catalan structure to the recursive definition of the Catalan pair on the same structure, thus giving an automatic way of interpreting Catalan structures in terms of Catalan pairs. Our method is applied to several well-known Catalan structures, focusing on the combinatorial meaning of the relations S and R in each case considered. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.tcs.2012.07.007 | Theoretical Computer Science |
Keywords | DocType | Volume |
recursive definition,simple method,catalan number,catalan structure,generic catalan structure,well-known catalan number,catalan pair,well-known catalan structure,combinatorial meaning,binary relation,satisfiability,discrete mathematics | Journal | 502, |
ISSN | Citations | PageRank |
0304-3975 | 1 | 0.35 |
References | Authors | |
4 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stefano Bilotta | 1 | 32 | 9.62 |
| Filippo Disanto | 2 | 22 | 6.60 |
| R. Pinzani | 3 | 90 | 15.91 |
| Simone Rinaldi | 4 | 174 | 24.93 |