Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"Motzkin paths"”.
-
Identifying structures in motzkin paths
… to enumerate combinatorial avoidance classes for Motzkin paths automatically. We give an algorithm to find a combinatorial specification for any set of patterns. Furthermore, we show that every class of Motzkin paths avoiding a set of patterns has an algebraic generating function.
-
Monotone Sequences in Combinatorial Structures
… a bijection between plane trees and bi-colored motzkin paths. Lastly, we provide a generating function for a special class of Ferrers diagrams, where each row a fixed length shorter than the previous row, and the filling of the diagram has no southeast chains.
-
Homomesies and Toggleability Spaces
… spaces for posets whose ideals correspond to Motzkin paths, yielding new homomesy results for combinatorial, piecewise-linear, and birational rowmotion, as well as their rank-permuted versions. We prove other homomesy and orbit structure results by interpreting rowmotion as an action on …
-
Fermionic Diagonal Coinvariants
… structure of $\FDR_W$ and introduce a variant of Motzkin paths that descends to the standard monomial basis of $\FDR_W$ with respect to certain term order. The top degree of $\FDR_W$ exhibits the Narayana refinement of Catalan numbers. When $W = S_n$, the symmetric group, $\FDR_{S_n} \cong …
-
Patterns in set partitions and restricted growth functions
… respectfully. We find connections to two-colored Motzkin paths and define explicit bijections between these combinatorial objects.
-
Shift gray codes
… unit interval graphs, restricted Schr oder and Motzkin paths, linear-extensions of B-posets, and their unions, intersections, and quotients. Each Gray code is circular and is obtained from a new variation of lexicographic order known as cool-lex order. Gray codes using only shift(s, 1, n) and …
-
Lace tessellations: a mathematical model for bobbin lace and an exhaustive combinatorial search for patterns
… of vertices in G by gluing together lattice paths in an osculating manner. Using a backtracking algorithm to process the lattice paths, we identify over 5 million distinct prime patterns. This is well in excess of the roughly 1,000 found in lace ground catalogues. The lattice paths used in …
-
Optimizing algorithms for mathematical modeling in bioinformatics
… of k-noncrossing setting partitions into Motzkin words. The RNA Interaction Problem was also studied, through the introduction of a new class of generalized Motzkin paths, the semi-elevated inverse generalized Motzkin peakless paths, concerning an optimal representation of joint RNA …