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 7 of 7 for “"pattern containment"”.

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

    gsu Repository record for Pattern Containment in Circular Permutations (opens in a new tab)

  2. On The Möbius Function Of Permutations Under The Pattern Containment Order

    … μ[σ, π], on the poset of permutations under the pattern containment order. First, we consider cases where the lower bound of the poset is indecomposable. We show that μ[σ, π] can be computed by considering just the indecomposable permutations contained in the upper bound. We apply this to the …

    the-open-u Download PDF for On The Möbius Function Of Permutations Under The Pattern Containment Order (opens in a new tab)

  3. Isomorphisms between consecutive pattern classes

    We consider isomorphisms between consecutive pattern classes. This was done for classical patterns classes by Albert et al. in 2013. Smith showed in 2006 that there are no non-trivial automorphisms of the full poset of classical pattern containment. We show that the same holds for the full poset of …

    reykjavik Repository record for Isomorphisms between consecutive pattern classes (opens in a new tab)

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

    etsu Repository record for Preferential Arrangement Containment in Strict Superpatterns (opens in a new tab) Download PDF for Preferential Arrangement Containment in Strict Superpatterns (opens in a new tab)

  5. On the Mo?bius function and topology of the permutation poset

    … 1, . . . , n. A permutation ? occurs as a pattern in a permutation ? if there is a subsequence of ? whose letters appear in the same relative order of size as the letters of ?, such a subsequence is called an occurrence. The set of all permutations, ordered by pattern containment, is a …

    strathclyde Repository record for On the Mo?bius function and topology of the permutation poset (opens in a new tab)

  6. Toward the Combinatorial Limit Theory of free Words

    … the extremal and asymptotic theory of pattern containment and avoidance in words. Word V is a factor of word W provided V occurs as consecutive letters within W. W is an instance of V provided there exists a nonerasing monoid homomorphsism phi with phi(V ) = W. For example, using the …

    south-carolina Repository record for Toward the Combinatorial Limit Theory of free Words (opens in a new tab)

  7. On permutation patterns, pinnacle sets, and backbones of bipartite projections

    … 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 area of enumerative …

    msu Repository record for On permutation patterns, pinnacle sets, and backbones of bipartite projections (opens in a new tab)