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 16 of 16 for “"permutation patterns"”.
-
On permutation patterns, pinnacle sets, and backbones of bipartite projections
… the study of two different fields, one regarding permutations including pattern containment and pinnacle sets, and the other on weighted networks, specifically bipartite projections and their backbones.The study of pattern containment and avoidance for linear permutations is a well-established …
-
Some New Probability Distributions Based on Random Extrema and Permutation Patterns
… about the parameter. In the last section, two permutation distributions are introduced and studied.
-
Permutation Patterns, Reduced Decompositions with Few Repetitions and the Bruhat Order
This thesis is concerned with problems involving permutations. The 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 …
-
Forced permutation patterns and applications to coincidence classification of mesh patterns and enumeration of permutation classes
Þessi ritgerð kynnir hugmyndina um nauðung á umraðanamynstur. Eftir að undirstöðukenningar um nauðungarmynstur hafa verið settar fram eru þessi mynstur notuð í samtilfellisflokkun á möskvamynstrum. Að lokum eru kynntar nýjar aðferðir sem nýta nauðungarmynstur í talningum á umraðanaflokkum. Þessar …
-
Generalized star polygons and star polygrams
… a figure. These figures can be thought of as permutations consisting of some cycles where each cycle forms a polygon. We define new permutation patterns called interacting cycle patterns that we use to describe properties of the permutations. We describe some necessary properties for a …
-
Combinatorial Optimization of Subsequence Patterns in Words
Packing patterns in words concerns finding a word with the maximum number of a prescribed pattern. The majority of the work done thus far is on packing patterns into permutations. In 2002, Albert, Atkinson, Handley, Holton and Stromquist showed that there always exists a layered permutation …
-
Equivalence classes of mesh patterns with a dominating pattern
A permutation is an arrangement of n objects. Sets of permutations classified by the avoidance of classical permutation patterns capture many interesting properties, such as stack-sortability, and have links to many different combinatorial objects. Mesh patterns are an extension of classical …
-
Automated bijections with combinatorial exploration
… algorithm was mainly applied to the domain of permutation patterns, where a total of 189 bijections were discovered, excluding symmetries and compositions. In many cases no previous bijections were known. Some cross-domain bijections were also discovered. As far as we know, this is the first …
-
Random Routing and Concentration in Quantum Switching Networks
… probability amplitudes of the individual packet patterns superposed in the quantum output state. We then analyze the effect of using quantum random routing on a classically non-blocking configuration like the Benes network. We prove that for an <italic>n × n</italic> quantum Benes network, …
-
Finding structure in permutation sets
New automatic methods for enumerating permutation classes are introduced. The first is Struct, which is an algorithm that conjectures a structural description using rules similar to generalized grid classes. These conjectured structural descriptions can be easily enumerated and are easily verified …
-
Reconstruction of functions from minors
… function g: A^m→B if f can be obtained from g by permutation of arguments, identification of arguments, and introduction of inessential arguments. We first provide some general background and context to this work by presenting a brief survey of basic facts and results concerning different aspects …
-
Permutation diagrams in symmetric function theory and Schubert calculus
A fundamental invariant of a permutation is its inversion set, or diagram. Natural machinery in the representation theory of symmetric groups produces a symmetric function from any finite subset of <bold>N</bold><super>2</super>, namely its <italic>generalized Schur function</italic>. When this …
-
Performance analysis of wormhole routing in multicomputer interconnection networks
… traffic, matrix-transpose and digit-reversal permutation patterns. The models are equally applicable to unidirectional and bidirectional k-ary n-cubes and are significantly more realistic than any in use up to now. With this level of accuracy, the effect of each important network parameter on …
-
Pin Classes
Originally discovered in relation to the simple permutations, the structures known as pin sequences have since appeared in many varied and unexpected places throughout the field of permutation patterns, notably in connection with substitution-closed classes and infinite antichains. Additionally, …
-
New combinatorial techniques for nonlinear orders
… problem of Furedi and Hajnal regarding forbidden patterns in (0,1)-matrices. We introduce a new technique that gives an asymptotically tight bound on the number of 1-entries that a (0,1)-matrix can contain while avoiding a fixed permutation matrix. We use this result to solve the Stanley-Wilf …
-
Pattern posets: enumerative, algebraic and algorithmic issues
The study of patterns in combinatorial structures has grown up in the past few decades to one of the most active trends of research in combinatorics. Historically, the study of permutations which are constrained by not containing subsequences ordered in various prescribed ways has been motivated by …