Results 101 to 110 of about 1,109,500 (204)
Today many bug detecting tools use static program analysis techniques to discover the vulnerabilities in programs, and many static program analyses can be converted to CFL (Context-Free-Language) reachability problems, most of which are Dyck-CFL ...
Cheng, Liang (2) +5 more
core +2 more sources
The area above the Dyck path of a permutation
In this paper we study a mapping from permutations to Dyck paths. A Dyck path gives rise to a (Young) diagram and we give relationships between statistics on permutations and statistics on their corresponding diagrams.
Dukes, Mark, Reifegerste, Astrid
core +1 more source
New Formulas for Dyck Paths in a Rectangle [PDF]
We consider the problem of counting the set of $\mathscr{D}_{a,b}$ of Dyck paths inscribed in a rectangle of size $a\times b$. They are a natural generalization of the classical Dyck words enumerated by the Catalan numbers. By using Ferrers diagrams associated to Dyck paths, we derive formulas for the enumeration of $\mathscr{D}_{a,b}$ with $a$ and $b$
openaire +3 more sources
Counting Peaks at Height k in a Dyck Path
of steps (1; 1) and (1; 1), which never passes below the x-axis. A peak at height k on a Dyck path is a point on the path with coordinate y = k that is immediately preceded by a (1; 1) step and immediately followed by a (1; 1) step.
Toufik Mansour
core
Partial replacement of Brewer's yeast (protein source) with inactivated Enterobacter biomass during larval development enhanced mating competitiveness of sterile VIENNA 8 GSS males under outdoor field‐cage conditions. Sterile male mating performance was season‐dependent, with highest competitiveness in spring, intermediate in autumn and the lowest ...
Panagiota Koskinioti +9 more
wiley +1 more source
Intervals in Dyck Paths and the Wreath Conjecture
Let $\iota_{k}(m,l)$ denote the total number of intervals of length $m$ across all Dyck paths of semilength $k$ such that each interval contains precisely $l$ falls. We give the formula for $\iota_{k}(m,l)$ and show that $\iota_{k}(k,l)=\binom{k}{l}^2$.
Jan Petr, Pavel Turek
openaire +3 more sources
Science Needs for a Terrestrial Biosphere Tipping Point Early Warning System
Abstract Tipping points in the Earth system have the potential to cause major detrimental impacts to the biosphere and societies. Their inherent nonlinearity implies that even relatively small additional increases in external forcing might result in disproportionately large adjustments to components of the Earth system.
Jesse F. Abrams +13 more
wiley +1 more source
Supporting AI Readiness Through Digital Workflows in Materials Science
Digitalization drives innovation in materials science by connecting data silos and turning heterogeneous processes into reusable research pipelines. Across 13 MaterialDigital projects, digital workflows reveal complementary pathways toward AI‐ready materials research, founded on structured data, persistent artifacts, executable orchestration, and ...
Marian Bruns +67 more
wiley +1 more source
Partial Dyck paths with Air Pockets
New section on skew Dyck paths with air pockets ...
openaire +4 more sources
On \({k}\)-Dyck Paths with a Negative Boundary
Paths that consist of up-steps of one unit and down-steps of \(k\) units, being bounded below by a horizontal line \(-t\), behave like \(t+1\) ordered tuples of \(k\)-Dyck paths, provided that \(t\le k\). We describe the general case, allowing \(t\) also to be larger. Arguments are bijective and/or analytic.
openaire +3 more sources

