Search arXivSearch

arXiv · 1512.00406

A new interpretation of Catalan numbers

Abstract

Towards the study of the Kashiwara B(infinity) crystal, sets H^t of functions were introduced given by equivalence classes of unordered partitions satisfying certain boundary conditions. Here it is shown that H^t is a Catalan set of order t, that is to say the cardinality of H^t is the t-th Catalan number C(t). This is a new description of a Catalan set and moreover admits some remarkable features. Thus to H^t there is an associated labelled graph G_t which is shown to have a canonical decomposition into (t-1)! subgraphs each with 2^{t-1} vertices. These subgraphs, called S-graphs, have some tight properties which are needed for the study of B(infinity). They are described as labelled hypercubes whose edges connecting vertices with equal labels are missing. It is shown that the number of distinct hypercubes so obtained is again a Catalan number, namely C(t-1). They define functions which depend on a coefficient set of non-negative integers. When the latter are non-zero and pairwise distinct, the vertices of the S-graphs describe distinct functions. Moreover this property is retained if certain edges are deleted and certain vertices identified. In particular when these coefficients are all equal and non-zero, it is shown that every hypercube degenerates to a simplex, resulting in exactly t distinct functions, which for example are exactly those needed in the description of B(infinity) in type A.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anthony Joseph, Polyxeni Lamprou. 2015-12-01. A new interpretation of Catalan numbers. https://arxiv.org/abs/1512.00406

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