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 4 of 4 for “"Permutation patterns"”.

  1. Combinatorics of permutation patterns, interlacing networks, and Schur functions

    In the first part, we study pattern avoidance and permutation statistics. For a set of patterns n and a permutation statistic st, let Fst/n ([Pi]; q) be the polynomial that counts st on the permutations avoiding all patterns in [Pi]. Suppose [Pi] contains the pattern 312. For a class of permutation

    mit Repository record for Combinatorics of permutation patterns, interlacing networks, and Schur functions (opens in a new tab)

  2. Permutation Patterns, Reduced Decompositions with Few Repetitions and the Bruhat Order

    … 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 …

    denver Repository record for Permutation Patterns, Reduced Decompositions with Few Repetitions and the Bruhat Order (opens in a new tab)

  3. 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 …

    reykjavik Repository record for Forced permutation patterns and applications to coincidence classification of mesh patterns and enumeration of permutation classes (opens in a new tab)

  4. The combinatorics of reduced decompositions

    … the symmetric group, the combined frameworks of permutation patterns and reduced decompositions are used to prove a new characterization of vexillary permutations. This characterization and the methods used yield a variety of new results about the structure of several objects relating to a …

    mit Repository record for The combinatorics of reduced decompositions (opens in a new tab)