We define the notion of a Catalan pair, which is a pair of (strict) order relations (S, R) satisfying certain axioms. We show that Catalan pairs of size n are counted by Catalan numbers. We study some combinatorial properties of the relations R and S. In particular, we show that the second component R uniquely determines the pair, and we give a characterization of the poset R in terms of forbidden configurations. We also propose some generalizations of Catalan pairs arising from the modification of one of the axioms.
Combinatorial properties of Catalan pairs
DISANTO, FILIPPO;
2009-01-01
Abstract
We define the notion of a Catalan pair, which is a pair of (strict) order relations (S, R) satisfying certain axioms. We show that Catalan pairs of size n are counted by Catalan numbers. We study some combinatorial properties of the relations R and S. In particular, we show that the second component R uniquely determines the pair, and we give a characterization of the poset R in terms of forbidden configurations. We also propose some generalizations of Catalan pairs arising from the modification of one of the axioms.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
