Results 31 to 40 of about 1,383 (202)
Discrete Applied Mathematics, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jacques Labelle, Yeong-Nan Yeh
openaire +2 more sources
Patterns in matchings and rook placements [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Extending the notion of pattern avoidance in permutations, we study matchings and set partitions whose arc diagram representation avoids a given configuration of three arcs.
Jonathan Bloom, Sergi Elizalde
doaj +1 more source
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 +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
Dyck paths with coloured ascents
European Journal of Combinatorics, 2008 We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon, etc. In some cases enumeration gives new expression for sequences enumerating these structures.
Andrei Asinowski, Toufik Mansour
openaire +2 more sources
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
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
Counting strings in Dyck paths
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aristidis Sapounakis +2 more
openaire +1 more source
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