Results 41 to 50 of about 426,250 (213)
Dyck paths and restricted permutations
Discrete Applied Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Toufik Mansour +2 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
Counting strings in Dyck paths
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aristidis Sapounakis +2 more
openaire +2 more sources
Lattice paths with catastrophes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero.
Cyril Banderier, Michael Wallner
doaj +1 more source
Discrete Mathematics, 1999 Dyck paths of semilength \(n\) are paths from \((0,0)\) to \((2n, 0)\) with steps (1, 1) and \((1,-1)\) which lie on or above the \(x\)-axis. Strict Dyck paths have only their endpoints on the \(x\)-axis. The area under a Dyck path is the area between the Dyck path and the \(x\)-axis. \textit{D. Merlini}, \textit{R. Sprugnoli}, and \textit{M. C. Verri}
openaire +2 more sources
Discrete Mathematics, 1999 Dyck paths of semilength \(n\) are paths from (0, 0) to \((2n,0)\) with steps (1, 1) and \((1,-1)\) which lie on or above the \(x\)-axis. The paper gives a systematic treatment to the enumeration of Dyck paths according to semilength and one more statistics.
openaire +1 more source
Dyck path triangulations and extendability
Journal of Combinatorial Theory, Series A, 2015 We introduce the Dyck path triangulation of the cartesian product of two simplices $Δ_{n-1}\timesΔ_{n-1}$. The maximal simplices of this triangulation are given by Dyck paths, and its construction naturally generalizes to produce triangulations of $Δ_{r\ n-1}\timesΔ_{n-1}$ using rational Dyck paths. Our study of the Dyck path triangulation is motivated
Cesar Ceballos +2 more
openaire +4 more sources
A Shuffle Theorem for Paths Under Any Line
Forum of Mathematics, Pi, 2023 We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al. and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial side
Jonah Blasiak +4 more
doaj +1 more source
Meanders and Dyck-Path Billiards
RAIRO - Theoretical Informatics and ApplicationsWe study a statistic traj on the ordered pairs (P,Q) of Dyck paths of size n, which counts the number of billiard trajectories in the grid polygon enclosed by P and −Q, where −Q is the path obtained by reflecting Q over the ground line. In terms of grid polygon, we establish an involution on the set of such ordered pairs (P,Q) which either increases or
Sen-Peng Eu +2 more
openaire +4 more sources
Board Networks and Corporate Carbon Emissions: A Cross‐Country Analysis of Causal Effects
Business Strategy and the Environment, EarlyView.ABSTRACT This study examines whether board networks influence corporate carbon emissions and the strategic pathways through which firms decarbonize. Using a sample of 1952 firms across 48 countries from 2003 to 2020, we employ dynamic stacked regressions that exploit exogenous carbon‐regulation shocks affecting firms connected through shared third ...
Katarzyna Burzynska +3 more
wiley +1 more source