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 20 of 21 for “"pattern avoidance"”.
-
Infinite Sequences and Pattern Avoidance
… We give some new enumeration results for these avoidance properties and solve an open problem of Prodinger and Urbanek regarding the perfect shuffle of infinite binary words that avoid arbitrarily large squares. In Chapter 3 we examine ternary squarefree words in more detail, and in Chapter 4 we …
-
PermPAL - Permutation Pattern Avoidance Library
Við leitum leiða til að reikna út tölusetningu (e. enumeration) á klösum umraðana (e. permutation classes) sem innihalda ekki mynstur út frá fléttufræðilegum (e. combinatorial) formgerðum (e. structure) sem skilgreind eru af reikniritunum Struct og ATRAP. Framleiðniföll og rakningarformúlur eru …
-
Pattern avoidance in set partitions and compositions
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 2007
-
Distribution of permutation statistics across pattern avoidance classes, and the search for a Denert-associated condition equivalent to pattern avoidance
… of the symmetricity of $\maj$ over $\des$ in pattern avoidance classes, and its relationship to $\maj$-Wilf equivalence. From this, we explore the distribution of permutation statistics across pattern avoidance for patterns of length 3 and 4. We then begin discussion of Han's bijection, a …
-
Pattern Avoidance Criteria for Smoothness of Positroid Varieties Via Decorated Permutations, Spirographs, and Johnson Graphs
… smooth positroid varieties using a variation of pattern avoidance defined on decorated permutations, which are in bijection with positroids. This allows us to give two formulas for counting the number of smooth positroids along with two q-analogs. We also include results of Christian …
-
Cartesian products avoiding patterns
The pattern avoidance problem seeks to construct a set with large fractal dimension that avoids a prescribed pattern, such as three term arithmetic progressions, or more general patterns such as finding a set whose Cartesian product avoids the zero set of a given function. Previous work on the …
-
Enumerative properties of restricted words and compositions
… local restrictions and, separately, subsequence pattern avoidance. We also count cyclically restricted and circular objects. This either fills gaps in the current literature by e.g. considering particular new patterns, or involves general progress, notably with locally restricted compositions …
-
Permutation Patterns, Reduced Decompositions with Few Repetitions and the Bruhat Order
… main focus is on connections between permutation patterns and reduced decompositions with few repetitions. Connections between permutation patterns and reduced decompositions were first studied various mathematicians including Stanley, Billey and Tenner. In particular, they studied pattern …
-
Pattern Containment in Circular Permutations
Pattern containment in permutations, as opposed to pattern avoidance, involves two aspects. The first is to contain every pattern at least once from a given set, known as finding superpatterns; while the second is to contain some given pattern as many times as possible, known as pattern packing. In …
-
A Novel Insertion Algorithm
… we will briefly discuss the results of pattern avoidance on tableau shape.
-
Patterns in set partitions and restricted growth functions
In this thesis we study two related notions of pattern avoidance.One is in set partitions $\sigma$ of $[n]=\{1,2\dots, n\}$ which are families of nonempty subsets $B_1,\dots,B_k$ whose disjoint union is $[n]$, written $\sigma=B_1/\dots/B_k\vdash S$. The other is in restricted growth functions …
-
Preferential Arrangement Containment in Strict Superpatterns
Most results on pattern containment deal more directly with pattern avoidance, or the enumeration and characterization of strings which avoid a given set of patterns. Little research has been conducted regarding the word size required for a word to contain all patterns of a given set of patterns. …
-
Decision Algorithms for Ostrowski-Automatic Sequences
… combinatorics on words, including repetitions, pattern-avoidance, critical exponents of special classes of words, properties of Lucas words, and so forth. Finally, we close with open problems on decidability and higher-order numeration systems and discuss future directions for research.
-
Wilf-classification of mesh patterns of short length
This B.Sc. project deals with mesh pattern avoidance in permutations. A mesh pattern is a pair P=(p,R), where p is a permutation of length k and R is a subset of [0,k]x[0,k]. The elements of R denote filled boxes in a mesh pattern. For a permutation u to contain a mesh pattern, it has to contain …
-
Learning in a small vertebrate
… zebrafish by introducing a conditioned place avoidance protocol in a Y-maze. Fish were conditioned to avoid one of the visually distinct arms of a Y-maze. Mild electric shocks were used as unconditioned aversive stimuli (US). We found that a robust response to conditioning emerges in …
-
Permutation diagrams in symmetric function theory and Schubert calculus
… theory, we obtain results on the interaction of pattern avoidance with the theory of Stanley symmetric functions. In particular, we show that for any positive integer <italic>k</italic>, the permutations whose Stanley symmetric function has at most <italic>k</italic> (classical) Schur function …
-
PermuNim : an impartial game of permutation avoidance.
… game theory as well as the idea of permutation pattern avoidance. PermuNim combines both of these ideas. When (12) or (1) is the forbidden permutation in PermuNim, or when the forbidden permutation is 'loses' in size to that of the smallest of the two dimensions of the board, we can say a great …
-
Profiles of Large Combinatorial Structures
… model. We also consider connections to pattern avoidance, in particular to the distribution of the number of inversions in involutions. Last, we consider integer partitions. Various results on the shape of random partitions are simple to prove in the Boltzmann model. We give a …
-
Insertion algorithms for moduli spaces of curves
… on the slide trees of caterpillar shape via pattern avoidance conditions.
-
Combinatorial Laguerre Series
… the number of k-ary words avoiding any vincular pattern that has only ones, as well as words cyclically avoiding vincular patterns with only ones whose runs of ones between dashes are all of equal length.
Page 1 of 2