Results 21 to 30 of about 426,250 (213)
Discrete Mathematics & Theoretical Computer Science, 2017 The PASEP (Partially Asymmetric Simple Exclusion Process) is a probabilistic model of moving particles, which is of great interest in combinatorics, since it appeared that its partition function counts some tableaux.
Matthieu Josuat-Vergès
doaj +1 more source
Patterns in Shi Tableaux and Dyck Paths [PDF]
Order, 2021 to apper in ...
Myrto Kallipoliti +2 more
openaire +2 more sources
On Generalized Dyck Paths [PDF]
The Electronic Journal of Combinatorics, 2011 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
Growing and Destroying Catalan-Stanley Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Stanley lists the class of Dyck paths where all returns to the axis are of odd length as one of the many objects enumerated by (shifted) Catalan numbers.
Benjamin Hackl, Helmut Prodinger
doaj +1 more source
Permutations and Pairs of Dyck Paths [PDF]
ISRN Combinatorics, 2013 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
Dyck Words, Lattice Paths, and Abelian Borders [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al.
F. Blanchet-Sadri +2 more
doaj +1 more source
, 2022 Raised $k$-Dyck paths are a generalization of $k$-Dyck paths that may both begin and end at a nonzero height. In this paper, we develop closed formulas for the number of raised $k$-Dyck paths from $(0,\alpha)$ to $(\ell,\beta)$ for all height pairs ...
Drube, Paul
core
Applications in Enumerative Combinatorics of In finite Weighted Automata and Graphs [PDF]
Scientific Annals of Computer Science, 2014 In this paper, we present a general methodology to solve a wide variety of classical lattice path counting problems in a uniform way. These counting problems are related to Dyck paths, Motzkin paths and some generalizations. The methodology uses weighted
R. De Castro, A. Ramírez, J.L. Ramírez
doaj +1 more source
Generating functions for a lattice path model introduced by Deutsch
Special Matrices, 2021 The lattice path model suggested by E. Deutsch is derived from ordinary Dyck paths, but with additional down-steps of size −3, −5, −7, . . . . For such paths, we find the generating functions of them, according to length, ending at level i, both, when ...
Prodinger Helmut
doaj +1 more source
Combinatorial Generation Algorithms for Some Lattice Paths Using the Method Based on AND/OR Trees
Algorithms, 2023 Methods of combinatorial generation make it possible to develop algorithms for generating objects from a set of discrete structures with given parameters and properties.
Yuriy Shablya
doaj +1 more source