English
Related papers

Related papers: A Bijection Between Weighted Dyck Paths and 1234-a…

200 papers

The set of Dyck paths of length $2n$ inherits a lattice structure from a bijection with the set of noncrossing partitions with the usual partial order. In this paper, we study the joint distribution of two statistics for Dyck paths:…

Combinatorics · Mathematics 2012-06-14 Saul A. Blanco , T. Kyle Petersen

In this paper, firstly, by a determinant of deformed Pascal's triangle, namely the normalized Hessenberg matrix determinant, to count Dyck paths, we give another combinatorial proof of the theorems which are of Catalan numbers determinant…

Combinatorics · Mathematics 2020-09-29 Jishe Feng , Cunqin Shi , Huani Zhao

This paper concentrates on the set $\mathcal{V}_n$ of weighted Dyck paths of length $2n$ with special restrictions on the level of valleys. We first give its explicit formula of the counting generating function in terms of certain weight…

Combinatorics · Mathematics 2021-12-28 Yidong Sun , Qianqian Liu , Yanxin Liu

We present a combinatorial model of configuration spaces and polytopes associated to the quotients of $\mathbb{C} A_n$, the path algebra of the linearly oriented $A_n$ quiver, i.e. the algebra of upper triangular matrices. These quotient…

Combinatorics · Mathematics 2026-02-05 Veronica Calvo Cortes , Hadleigh Frost

Standard set-valued Young tableaux are a generalization of standard Young tableaux in which cells may contain more than one integer, with the added conditions that every integer at position $(i,j)$ must be smaller than every integer at…

Combinatorics · Mathematics 2017-10-05 Paul Drube

We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set S_n(132) of 132-avoiding permutations and the set A_{2n + 1}(132) of alternating,…

Combinatorics · Mathematics 2021-03-30 Joel Brewster Lewis

In this paper we define and study what we call the double Catalan monoid. This monoid is the image of a natural map from the 0-Hecke monoid to the monoid of binary relations. We show that the double Catalan monoid provides an algebraization…

Group Theory · Mathematics 2017-05-10 Volodymyr Mazorchuk , Benjamin Steinberg

We prove a conjecture of J.-C. Novelli, J.-Y. Thibon, and L. K. Williams (2010) about an equivalence of two triples of statistics on permutations. To prove this conjecture, we construct a bijection through different combinatorial objects,…

Combinatorics · Mathematics 2018-05-07 Arthur Nunge

Given a sequence of integers b = (b_0,b_1,b_2,...) one gives a Dyck path P of length 2n the weight wt(P) = b_{h_1} b_{h_2} ... b_{h_n}, where h_i is the height of the ith ascent of P. The corresponding weighted Catalan number is C_n^b =…

Combinatorics · Mathematics 2007-05-23 Alexander Postnikov , Bruce Sagan

For any $n\geq 3$, we prove that there exist equivalences between these apparently unrelated objects: irreducible $n$-dimensional non degenerate projective varieties $X\subset \mathbb P^{2n+1}$ different from rational normal scrolls and…

Algebraic Geometry · Mathematics 2011-10-07 Luc Pirio , Francesco Russo

Dyck tilings are certain tilings in the region surrounded by two Dyck paths. We study bijections and combinatorial objects bijective to Dyck tilings, which include Dyck tiling strip (DTS) and Dyck tiling ribbon (DTR) bijections, increasing…

Combinatorics · Mathematics 2020-11-17 Keiichi Shigechi

We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some combinatorial statistics on Dumont permutations avoiding…

Combinatorics · Mathematics 2007-05-23 Alexander Burstein , Sergi Elizalde , Toufik Mansour

A well-labelled positive path of size n is a pair (p,\sigma) made of a word p=p_1p_2...p_{n-1} on the alphabet {-1, 0,+1} such that the sum of the letters of any prefix is non-negative, together with a permutation \sigma of {1,2,...,n} such…

Combinatorics · Mathematics 2010-10-04 Olivier Bernardi , Bertrand Duplantier , Philippe Nadeau

An increasing tableau is a semistandard tableau with strictly increasing rows and columns. It is well known that the Catalan numbers enumerate both rectangular standard Young tableaux of two rows and also Dyck paths. We generalize this to a…

Combinatorics · Mathematics 2018-06-13 Oliver Pechenik

This thesis deals with three different aspects of the combinatorics of permutations. In the first two papers, two flavours of pattern avoiding permutations are examined; and in the third paper Young tableaux, which are closely related to…

Combinatorics · Mathematics 2009-08-04 Erik Ouchterlony

In this paper, we generalize the Catalan number to the $(n,k)$-th Catalan numbers and find a combinatorial description that the $(n,k)$-th Catalan numbers is equal to the number of partitions of $n(k-1)+2$ polygon by $(k+1)$-gon where all…

Combinatorics · Mathematics 2015-01-28 Dongseok Kim

Catalan Solids are the duals of the Archimedean solids, vertices of which can be obtained from the Coxeter-Dynkin diagrams A3, B3 and H3 whose simple roots can be represented by quaternions. The respective Weyl groups W(A3), W(B3) and W(H3)…

Mathematical Physics · Physics 2015-05-14 Mehmet Koca , Nazife Ozdes Koca , Ramazan Koc

We analyze a weighted convolution of Catalan numbers $$ \sum_{k=0}^{n} \binom{2k}{k}\binom{2(n-k)}{n-k} a^k = \sum_{k=0}^{n} (k+1)(n-k+1) C_k C_{n-k} a^k, $$ emphasizing its combinatorial, analytic, and probabilistic aspects. We derive a…

Combinatorics · Mathematics 2026-04-24 Jean-Christophe Pain

We consider the problem of counting the set of $\mathscr{D}_{a,b}$ of Dyck paths inscribed in a rectangle of size $a\times b$. They are a natural generalization of the classical Dyck words enumerated by the Catalan numbers. By using Ferrers…

Combinatorics · Mathematics 2015-09-28 Jose Eduardo Blazek

In this paper we establish six bijections between a particular class of polyominoes, called deco polyominoes, enumerated according to their directed height by n!, and permutations. Each of these bijections allows us to establish different…

Combinatorics · Mathematics 2008-10-20 Emeric Deutsch , Elisa Pergola , Renzo Pinzani