Results 21 to 30 of about 1,109,500 (204)
Discrete Mathematics, 1990 Let \({\mathcal S}\) be a finite multi-set (a set with repetitions) of vectors in \({\mathbb{N}}\times {\mathbb{N}}\) and let \({\mathcal S}^*=\{(r,-s)+(r,s)\in {\mathcal S}\}.\) An A-path (\({\mathcal S}\)-Dyck path) is a path in \({\mathbb{Z}}\times {\mathbb{Z}}\) which starts from (0,0) and ends on the x-axis, uses only vectors from \({\mathcal S}+{\
Jacques Labelle, Yeong-Nan Yeh
openaire +2 more sources
Minimal and maximal plateau lengths in Motzkin paths [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 The minimal length of a plateau (a sequence of horizontal steps, preceded by an up- and followed by a down-step) in a Motzkin path is known to be of interest in the study of secondary structures which in turn appear in mathematical biology. We will treat
Helmut Prodinger, Stephan Wagner
doaj +1 more source
Dyck paths, Motzkin paths and traffic jams [PDF]
Journal of Statistical Mechanics: Theory and Experiment, 2004 It has recently been observed that the normalization of a one-dimensional out-of-equilibrium model, the Asymmetric Exclusion Process (ASEP) with random sequential dynamics, is exactly equivalent to the partition function of a two-dimensional lattice path model of one-transit walks, or equivalently Dyck paths.
Blythe, R. A. +3 more
openaire +3 more sources
Bijections for lattice paths between two boundaries [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We prove that on the set of lattice paths with steps $N=(0,1)$ and $E=(1,0)$ that lie between two boundaries $B$ and $T$, the two statistics `number of $E$ steps shared with $B$' and `number of $E$ steps shared with $T$' have a symmetric joint ...
Sergi Elizalde, Martin Rubey
doaj +1 more source
The sandpile model, polyominoes, and a $q,t$-Narayana polynomial [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We give a polyomino characterisation of recurrent configurations of the sandpile model on the complete bipartite graph $K_{m,n}$ in which one designated vertex is the sink.
Mark Dukes, Yvan Le Borgne
doaj +1 more source
A Bijection on Bilateral Dyck Paths
Australas. J Comb., 2012 revised ...
Paul R. G. Mortimer, Thomas Prellberg
openaire +3 more sources
A Bijection between Unbalanced Dyck Path and NE Lattice Path [PDF]
, 2023 Lattice paths are important tools on solving some combinatorial identities. This note gives a new bijection between unbalanced Dyck path (a path that never reaches the diagonal of the lattice) and NE (North and East only) lattice path from (0,0) to (n,n)
Qian, Yannan
core
Patterns in matchings and rook placements [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Extending the notion of pattern avoidance in permutations, we study matchings and set partitions whose arc diagram representation avoids a given configuration of three arcs.
Jonathan Bloom, Sergi Elizalde
doaj +1 more source
Dyck paths with coloured ascents
European Journal of Combinatorics, 2008 We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon, etc. In some cases enumeration gives new expression for sequences enumerating these structures.
Andrei Asinowski, Toufik Mansour
openaire +3 more sources
Discrete Applied Mathematics, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jacques Labelle, Yeong-Nan Yeh
openaire +2 more sources