Results 31 to 40 of about 1,064,332 (196)
Discrete Applied Mathematics, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jacques Labelle, Yeong-Nan Yeh
openaire +2 more sources
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
A Bijection between Unbalanced Dyck Path and NE Lattice Path [PDF]
, 2023 Lattice paths are important tools on solving some combinatorial identities. This note gives a new bijection between unbalanced Dyck path (a path that never reaches the diagonal of the lattice) and NE (North and East only) lattice path from (0,0) to (n,n)
Qian, Yannan
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
Energy harvest control systems Senegal study dataset
, 2021 Power and temperature data for a study of Energy Harvest Control systems used with solar direct drive vaccine refrigerators in ...
PATH
core +2 more sources
Euclidean operator growth and quantum chaos
Physical Review Research, 2020 We consider growth of local operators under Euclidean time evolution in lattice systems with local interactions. We derive rigorous bounds on the operator norm growth and then proceed to establish an analog of the Lieb-Robinson bound for the spatial ...
Alexander Avdoshkin, Anatoly Dymarsky
doaj +1 more source