Results 21 to 30 of about 20,234 (200)
Sweep maps for lattice paths [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Sweep maps are a family of maps on words that, while simple to define, are not yet known to be injective in general. This family subsumes many of the "zeta maps" that have arisen in the study of q,t-Catalan numbers in the course of relating the three ...
Nicholas Loehr, Gregory Warrington
doaj +1 more source
The $m$-Cover Posets and the Strip-Decomposition of $m$-Dyck Paths [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 In the first part of this article we present a realization of the $m$-Tamari lattice $\mathcal{T}_n^{(m)}$ in terms of $m$-tuples of Dyck paths of height $n$, equipped with componentwise rotation order. For that, we define the $m$-cover poset $\mathcal{P}
Myrto Kallipoliti, Henri Mühle
doaj +1 more source
The register function for lattice paths [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 The register function for binary trees is the minimal number of extra registers required to evaluate the tree. This concept is also known as Horton-Strahler numbers. We extend this definition to lattice paths, built from steps $\pm 1$, without positivity
Guy Louchard, Helmut Prodinger
doaj +1 more source
Short Simplex Paths in Lattice Polytopes [PDF]
Discrete & Computational Geometry, 2021 The goal of this paper is to design a simplex algorithm for linear programs on lattice polytopes that traces `short' simplex paths from any given vertex to an optimal one. We consider a lattice polytope $P$ contained in $[0,k]^n$ and defined via $m$ linear inequalities.
Alberto Del Pia, Carla Michini
openaire +2 more sources
Osculating Random Walks on Cylinders [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before.
Saibal Mitra, Bernard Nienhuis
doaj +1 more source
Generating functions for the area below some lattice paths [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 We study some lattice paths related to the concept ofgenerating trees. When the matrix associated to this kind of trees is a Riordan array $D=(d(t),h(t))$, we are able to find the generating function for the total area below these paths expressed in ...
Donatella Merlini
doaj +1 more source
An extension to overpartitions of Rogers-Ramanujan identities for even moduli [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We investigate class of well-poised basic hypergeometric series $\tilde{J}_{k,i}(a;x;q)$, interpreting these series as generating functions for overpartitions defined by multiplicity conditions.
Sylvie Corteel +2 more
doaj +1 more source
Matrix Ansatz, lattice paths and rook placements [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 We give two combinatorial interpretations of the Matrix Ansatz of the PASEP in terms of lattice paths and rook placements. This gives two (mostly) combinatorial proofs of a new enumeration formula for the partition function of the PASEP.
S. Corteel +3 more
doaj +1 more source
Studies on several parameters in lattice paths [PDF]
, 2020 This thesis deals with enumerative as well as asymptotic aspects of directed lattice paths. Several parameters appearing in lattice paths will be analyzed, e.g. the area enclosed by or the number of contacts between two paths or the number of occurrences
Roitner, Valerie; orcid:
core +1 more source
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