Results 181 to 190 of about 1,383 (202)
Some of the next articles are maybe not open access.
A refinement of Dyck paths: A combinatorial approach
Discrete Mathematics, Algorithms and Applications, 2021Local maxima and minima of a Dyck path are called peaks and valleys, respectively. A Dyck path is called restricted [Formula: see text]-Dyck if the difference between any two consecutive valleys is at least [Formula: see text] (right-hand side minus left-hand side) or if it has at most one valley.
Florez, Rigoberto +4 more
openaire +3 more sources
Journal of Statistical Planning and Inference, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emeric Deutsch +2 more
exaly +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emeric Deutsch +2 more
exaly +3 more sources
Visits to Level r by Dyck Paths
Fundamenta Informaticae, 2012A Dyck path is a non-negative lattice path in $\mathbb{N}^2$ starting at the origin, where only two types of steps are allowed: the diagonal up step (1, 1) and the diagonal down step (1, −1). The length of the path is the total number of unit steps. We consider paths of length n, ending at the point (n, i).
Charlotte A. C. Brennan, Simon Mavhungu
openaire +1 more source
Area and Inertial Moment of Dyck Paths
Combinatorics, Probability and Computing, 2004In this paper, we investigate the limit law of the inertial moment of Dyck paths with respect to the $x$-axis, that is, the sum of the squares of the altitudes. We find its Laplace transform using Louchard's methodology, rediscovering a result which was in fact well known by probabilists.
openaire +2 more sources
Counting prefixes of skew Dyck paths
2021Summary: We present enumerative results on prefixes of skew Dyck paths by giving recursive relations, Riordan arrays, and generating functions, as well as closed formulas to count the total number of these paths with respect to the length, the height of its endpoint and the number of left steps.
Baril, Jean-Luc +2 more
openaire +2 more sources
Efficient exact paths for dyck and semi-dyck labeled path reachability (extended abstract)
2017 IEEE 8th Annual Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON), 2017Consider any two vertices in a weighted digraph. The exact path length problem is to determine if there is a path of a given fixed cost between these vertices. This paper focuses on the exact path problem for costs −1,0 or +1 between all pairs of vertices. This special case is also restricted to original edge weights from {−1, +1}. In this special case,
openaire +1 more source
Refinements of (\(n,m\))-Dyck paths
Eur. J. Comb., 2011A \((n,m)\)-Dyck path is a lattice path in \(\mathbb{Z}\times\mathbb{Z}\) using up \((1,1)\) and down \((1,-1)\) steps that go from the origin to the point \((2n,0)\) and it contains exactly \(m\) up steps under the \(x\)-axis. The classical Chung-Feller theorem tells us that the number of \((n,m)\)-Dyck paths is \(\frac{1}{n+1}\binom{2n}{n}\) the \(n\)
Jun Ma 0017, Yeong-Nan Yeh
openaire +2 more sources
ECO-systems for Dyck and Schröder paths
2000The method of \textit{E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani} [J. Difference Equ. Appl. 5, No. 4-5, 435-490 (1999; Zbl 0944.05005)] is used to enumerate the Dyck and Schröder paths.
BARCUCCI, ELENA +3 more
openaire +2 more sources
Asymptotic behavior and the moderate deviation principle for the maximum of a Dyck path
Statistics and Probability Letters, 2012Termeh Kousha
exaly
Enumerations of peaks and valleys on non-decreasing Dyck paths
Discrete Mathematics, 2018Eva Czabarka +2 more
exaly