Results 101 to 110 of about 1,064,332 (196)
New Formulas for Dyck Paths in a Rectangle [PDF]
, 2015 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
Coriolan : Ein Trauerspiel / [Verf.:Johann Gottfried Dyck]
Verf. am Ende der Vorrede genannt; vollst. Name für ältere Aufl. in GV 1700-1910, Bd. 25, S. 404 erm.Autopsie nach Ex. der ULB Sachsen-AnhaltVorlageform des Erscheinungsvermerks: Leipzig, im Verlage der Dykischen Buchhandlung. 1786.1 Ill. (Kupferst.
Dyck, Johann Gottfried
core +1 more source
Intervals in Dyck Paths and the Wreath Conjecture
The Electronic Journal of CombinatoricsLet $\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
Dagmar Vaikalafi Dyck - falanoa
, 2023 Dagmar Vaikalafi Dyck (born 1972) is a New Zealand artist of Tongan and German descent. Her paintings are inspired by her cultural heritage and explore textile practices of Tonga including bark cloth mats, baskets and clothing.
Dyck, Dagmar
core
Partial Dyck paths with Air Pockets
, 2022 New section on skew Dyck paths with air pockets ...
openaire +4 more sources
Counting Peaks at Height k in a Dyck Path
, 2002 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
On \({k}\)-Dyck Paths with a Negative Boundary
Journal of Combinatorial Mathematics and Combinatorial ComputingPaths 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
Counting segmented permutations using bicoloured Dyck paths
, 2005 A bicoloured Dyck path is a Dyck path in which each up-step is assigned one of two colours, say, red and green. We say that a permutation π is σ-segmented if every occurrence o of σ in π is a segment-occurrence (i.e., o is a contiguous subword in π).
Claesson, Anders
core +3 more sources
Croatica Chemica Acta, 2002 A simple bijection is established between Morgan trees and Dyck paths. As a consequence, exact enumerative results for Morgan trees on given number of vertices are obtained in terms of Catalan numbers. The results are further refined by enumerating all Morgan trees with prescribed number of internal vertices and by computing the average number of ...
openaire +3 more sources
, 2023 We propose different ways of lifting the notion of Dyck language from words to 2-dimensional (2D) pictures, by means of new definitions of increasing comprehensiveness.
Pietro, Pierluigi San +2 more
core