Search arXivSearch

arXiv · 1501.05157

Catalan pairs and Fishburn triples

Abstract

Disanto, Ferrari, Pinzani and Rinaldi have introduced the concept of 'Catalan pair', which is a pair of partial orders (S,R) satisfying certain axioms. They have shown that Catalan pairs provide a natural description of objects belonging to several classes enumerated by Catalan numbers. In this paper, we first introduce another axiomatic structure (T,R), which we call the 'Catalan pair of type 2', which describes certain Catalan objects that do not seem to have an easy interpretation in terms of the original Catalan pairs. We then introduce 'Fishburn triples', which are relational structures obtained as a direct common generalization of the two types of Catalan pairs. Fishburn triples encode, in a natural way, the structure of objects enumerated by the Fishburn numbers, such as interval orders or Fishburn matrices. This connection between Catalan objects and Fishburn objects allows us to associate known statistics on Catalan objects with analogous statistics of Fishburn objects. As our main result, we then show that several known equidistribution results on Catalan statistics can be generalized to analogous results for Fishburn statistics.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vít Jelínek. 2015-01-21. Catalan pairs and Fishburn triples. https://arxiv.org/abs/1501.05157

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO