Results 171 to 180 of about 1,064,332 (196)

IAEA Coordinated Research Project on "A generic approach for the development of genetic sexing strains for Sterile Insect Technique applications"- an overview. [PDF]

Insect Sci
Schetelig MF, Augustinos A, Bourtzis K.
europepmc   +1 more source

Effects of Multicomponent Digital Health Interventions on Multidimensional Physical Activity in Older Adults: Systematic Review, Meta-Analysis, and Meta-Regression of Randomized Controlled Trials. [PDF]

J Med Internet Res
Yao J, Wang H, Jia S, Chen H, He J, Long J, Chen S.   +6 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Skew Dyck paths

Journal of Statistical Planning and Inference, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emanuele Munarini, Simone Rinaldi, Emeric Deutsch   +2 more
exaly   +3 more sources

The Dyck pattern poset

Discrete Mathematics, 2014
International audienceWe introduce the notion of pattern in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set ...
Luca Ferrari, Antonio Bernini, Axel Bacher   +2 more
exaly   +2 more sources

Water capacity of Dyck paths

Advances in Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher   +2 more
openaire   +2 more sources

A refinement of Dyck paths: A combinatorial approach

Discrete Mathematics, Algorithms and Applications, 2021
Local 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, Ramirez, Jose L., Velandia, Fabio A., Villamizar Rubiano, Diego   +4 more
openaire   +4 more sources

Visits to Level r by Dyck Paths

Fundamenta Informaticae, 2012
A 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   +2 more sources

Area and Inertial Moment of Dyck Paths

Combinatorics, Probability and Computing, 2004
In 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

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), 2017
Consider 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., 2011
A \((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