Results 31 to 40 of about 1,109,500 (204)
Method for Developing Combinatorial Generation Algorithms Based on AND/OR Trees and Its Application
Mathematics, 2020 In this paper, we study the problem of developing new combinatorial generation algorithms. The main purpose of our research is to derive and improve general methods for developing combinatorial generation algorithms.
Yuriy Shablya +2 more
doaj +1 more source
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
Combinatorics of generalized Dyck and Motzkin paths [PDF]
, 2022 We relate the combinatorics of periodic generalized Dyck and Motzkin paths to the cluster coefficients of particles obeying generalized exclusion statistics, and obtain explicit expressions for the counting of paths with a fixed number of steps of each ...
Ouvry, Stéphane +2 more
core +1 more source
Some Connections Between Restricted Dyck Paths, Polyominoes, and Non-Crossing Partitions [PDF]
, 2023 A \emph{Dyck path} is a lattice path in the first quadrant of the $xy$-plane that starts at the origin, ends on the $x$-axis, and consists of the same number of North-East steps $U$ and South-East steps $D$. A \emph{valley} is a subpath of the form $DU$.
Velandia, Fabio A. +3 more
core
Maximality on Construction of Ternary Cross Bifix Free Code
ComTech, 2019 The purpose of this research was to show that ternary cross bifix free code CBFS3(2m+1) and CBFS3(2m+2) achieved the maximum for every natural number m. This research was a literature review.
Mohammad Affaf
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
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
, 2022 Raised $k$-Dyck paths are a generalization of $k$-Dyck paths that may both begin and end at a nonzero height. In this paper, we develop closed formulas for the number of raised $k$-Dyck paths from $(0,α)$ to $(\ell,β)$ for all height pairs $α,β\geq 0$, all lengths $\ell \geq 0$, and all $k \geq 2$.
openaire +3 more sources
Enumerative combinatorics of intervals in the Dyck pattern poset [PDF]
, 2021 We initiate the study of the enumerative combinatorics of the intervals in the Dyck pattern poset. More specifically, we find some closed formulas to express the size of some specific intervals, as well as the number of their covering relations.
Ferrari, Luca +11 more
core +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