Results 11 to 20 of about 1,109,500 (204)
Meanders and Dyck-Path Billiards
We study a statistic traj on the ordered pairs (P,Q) of Dyck paths of size n, which counts the number of billiard trajectories in the grid polygon enclosed by P and −Q, where −Q is the path obtained by reflecting Q over the ground line. In terms of grid polygon, we establish an involution on the set of such ordered pairs (P,Q) which either increases or
Sen-Peng Eu +2 more
core +6 more sources
MIN-turns and MAX-turns in k-Dyck paths: A pure generating function approach [PDF]
k-Dyck paths differ from ordinary Dyck paths by using an up-step of length k. We analyze at which level the path is after the s-th up-step and before the (s+1)-st up-step.
Helmut Prodinger
doaj +3 more sources
Skew Dyck paths with catastrophes [PDF]
Skew Dyck paths are like Dyck paths, but an additional south-west step $(-1,-1)$ is allowed, provided that the path does not intersect itself. Lattice paths with catastrophes can drop from any level to the origin in just one step. We combine these two ideas. The analysis is strictly based on generating functions, and the kernel method is used.
Helmut Prodinger
doaj +4 more sources
Left to right maxima in Dyck prefixes [PDF]
In a Dyck path, a peak which is strictly (weakly) higher than all the preceding peaks is called a strict (weak) left-to-right maximum. By dropping the restrictions for the path to end on the $x$-axis, one obtains Dyck prefixes.We obtain explicit ...
Knopfmacher, Arnold, Blecher, Aubrey
core +1 more source
The $(m, n)$-rational $q, t$-Catalan polynomials for $m=3$ and their $q, t$-symmetry [PDF]
We introduce a new statistic, skip, on rational $(3,n)$-Dyck paths and define a marked rank word for each path when $n$ is not a multiple of 3. If a triple of valid statistics (area; skip; dinv) are given, we have an algorithm to construct the marked ...
Ryan Kaliszewski, Huilan Li
doaj +1 more source
Patterns in Shi Tableaux and Dyck Paths [PDF]
to apper in ...
Myrto Kallipoliti +2 more
openaire +2 more sources
Bijection between 20-Dyck path and ternary tree [PDF]
In order to expand the basic theory of Dyck path and ternary tree, the bijection and counting problems between the 20-Dyck path and the ternary tree with n inliers were studied.
Jiahe WANG +3 more
doaj +1 more source
Dyck tilings, linear extensions, descents, and inversions [PDF]
Dyck tilings were introduced by Kenyon and Wilson in their study of double-dimer pairings. They are certain kinds of tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths.
Jang Soo Kim +3 more
doaj +1 more source
On Generalized Dyck Paths [PDF]
We generalize the elegant bijective proof of the Chung Feller theorem from a paper of Young-Ming Chen [The Chung-Feller theorem revisited, Disc. Math. 308 (2008), 1328–1329].
openaire +2 more sources
Permutations and Pairs of Dyck Paths [PDF]
We define a map v between the symmetric group Sn and the set of pairs of Dyck paths of semilength n. We show that the map v is injective when restricted to the set of 1234-avoiding permutations and characterize the image of this map.
BARNABEI, MARILENA +2 more
openaire +4 more sources

