English
Related papers

Related papers: Promotion and rowmotion in rational Catalan combin…

200 papers

In this article we investigate the lattices of Dyck paths of type $A$ and $B$ under dominance order, and explicitly describe their Heyting algebra structure. This means that each Dyck path of either type has a relative pseudocomplement with…

Combinatorics · Mathematics 2017-08-08 Henri Mühle

We define a map between the set of permutations that avoid either the four patterns $3214,3241,4213,4231$ or $3124,3142,4123,4132$, and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a…

Combinatorics · Mathematics 2013-01-10 Marilena Barnabei , Flavio Bonetti , Matteo Silimbani

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

As a classical object, the Tamari lattice has many generalizations, including $\nu$-Tamari lattices and parabolic Tamari lattices. In this article, we unify these generalizations in a bijective fashion. We first prove that parabolic Tamari…

Combinatorics · Mathematics 2020-02-05 Cesar Ceballos , Wenjie Fang , Henri Mühle

We develop a general procedure for reduction along strong Dirac maps, which are a broad generalization of Poisson momentum maps. We recover a large number of familiar constructions in Poisson and quasi-Poisson geometry, and we introduce new…

Symplectic Geometry · Mathematics 2026-04-29 Ana Balibanu , Maxence Mayrand

The existence of apparently coincidental equalities (also called Wilf-equivalences) between the enumeration sequences, or generating functions, of various hereditary classes of combinatorial structures has attracted significant interest. We…

Combinatorics · Mathematics 2014-08-01 Michael Albert , Mathilde Bouvel

A recurrence relation of the generating function of the dimer model of Fibonacci type gives a functional relation for formal power series associated to lattice paths such as a Dyck, Motzkin and Schr\"oder path. In this paper, we generalize…

Combinatorics · Mathematics 2023-01-02 Keiichi Shigechi

A permutation can be locally classified according to the four local types: peaks, valleys, double rises and double falls. The corresponding classification of binary increasing trees uses four different types of nodes. Flajolet demonstrated…

Combinatorics · Mathematics 2021-06-22 Markus Kuba , Anna L. Varvak

We generalize well-known bijections between alternative tableaux and permutations to bijections between rhombic alternative tableaux (RAT) and assembl\'ees of permutations. We show how these various bijections are connected. As a…

Combinatorics · Mathematics 2026-03-16 Sylvie Corteel , Jang Soo Kim , Olya Mandelshtam , Philippe Nadeau

We study support $\tau$-tilting modules over preprojective algebras of Dynkin type. We classify basic support $\tau$-tilting modules by giving a bijection with elements in the corresponding Weyl groups. Moreover we show that they are in…

Representation Theory · Mathematics 2013-12-04 Yuya Mizuno

We consider the problem of counting subset of Dyck paths contained in a Ferrers diagram. This enumeration concerns to find the number of the elements in a branch of the Kr\'ew\'eras tree. Using the Ferrers diagrams associated with Dyck…

Combinatorics · Mathematics 2015-09-28 Jose Eduardo Blazek

Let $T$ be a tree on $n$ vertices and let $L_q^T$ be the $q$-analogue of its Laplacian. For a partition $\lambda \vdash n$, let the normalized immanant of $L_q^T$ indexed by $\lambda$ be denoted as $d_{\lambda}(L_q^T)$. A string of…

Combinatorics · Mathematics 2023-08-01 Mukesh Kumar Nagar , Arbind Kumar Lal , Sivaramakrishnan Sivasubramanian

Descending plane partitions, alternating sign matrices, and totally symmetric self-complementary plane partitions are equinumerous combinatorial sets for which no explicit bijection is known. In this paper, we isolate a subset of descending…

Combinatorics · Mathematics 2017-04-20 Colton Keller , Jessica Striker

We establish bijections between three classes of combinatorial objects that have been studied in very different contexts: lattice walks in simplicial regions as introduced by Mortimer--Prellberg, standard cylindric tableaux as introduced by…

Combinatorics · Mathematics 2025-07-03 Sergi Elizalde

The \emph{$q,t$-Catalan numbers} $C_n(q,t)$ are polynomials in $q$ and $t$ that reduce to the ordinary Catalan numbers when $q=t=1$. These polynomials have important connections to representation theory, algebraic geometry, and symmetric…

Combinatorics · Mathematics 2019-11-01 Kyungyong Lee , Li Li , Nicholas A. Loehr

We study enumerations of Dyck and ballot tilings, which are tilings of a region determined by two Dyck or ballot paths. We give bijective proofs to two formulae of enumerations of Dyck tilings through Hermite histories. We show that one of…

Mathematical Physics · Physics 2017-05-19 Keiichi Shigechi

The Catalan number has a lot of interpretations and one of them is the number of Dyck paths. A Dyck path is a lattice path from $(0,0)$ to $(n,n)$ which is below the diagonal line $y=x$. One way to generalize the definition of Dyck path is…

Combinatorics · Mathematics 2013-04-23 Yukiko Fukukawa

We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Nelson Y. Li , Louis W. Shapiro

We study the ramification divisors of projections of a smooth projective variety onto a linear subspace of the same dimension. We prove that the ramification divisors vary in a maximal dimensional family for a large class of varieties.…

Algebraic Geometry · Mathematics 2019-01-08 Anand Deopurkar , Eduard Duryev , Anand Patel

We exhibit a bijection between central Delannoy $n$-paths, that is, lattice paths from the origin to $(n,n)$ with steps $E=(1,0), \,N=(0,1),\,D=(1,1)$ and the lattice paths from the origin to $(n+1,n)$ where the only restriction on the…

Combinatorics · Mathematics 2022-02-11 David Callan