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 813 for “"Permutations"”.

  1. Inverting Permutations In Place

    We address the problem of quickly inverting the standard representation of a permutation on $n$ elements in place. First, we present a naive algorithm to do it using $O(\log n)$ extra bits in $O(n^2)$ time in the worst case. We then improve that algorithm, using a small bit vector, to use $O(\sqrt …

    waterloo Repository record for Inverting Permutations In Place (opens in a new tab)

  2. Packing and Counting Permutations

    A permutation class is a set of permutations closed under taking subpermutations. We study two aspects of permutation classes: enumeration and packing. <br></br><br></br> Our work on enumeration consists of two campaigns. First, we enumerate all juxtaposition classes of the form “Av(abc) next to …

    the-open-u Download PDF for Packing and Counting Permutations (opens in a new tab)

  3. Sorting by Bounded Permutations

    Let P be a predicate applicable to permutations. A permutation that satisfies P is called a generator. Given a permutation $pi$, MinSort_P is the problem of finding a shortest sequence of generators that, when composed with $pi$, yields the identity permutation. The length of this sequence is …

    vt Repository record for Sorting by Bounded Permutations (opens in a new tab)

  4. Intersection : poems and permutations

    … through memory, association and observation. Permutations of the sonnets of Henry Howard, Earl of Surrey provide context for discussion of social and personal relationships and values; these themes recur as echoes, reconsiderations and replies, in poems examining relationships as they develop …

    concordia Download PDF for Intersection : poems and permutations (opens in a new tab)

  5. Generation of permutations of multisets

    … An algorithm is given that generates all permutations of a multiset such that consecutively generated permutations differ by an interchange of elements. On average the permutat10ns are generated in time bounded by a constant, independent of the number of symbols and n, the length of each …

    uvic Repository record for Generation of permutations of multisets (opens in a new tab)

  6. A Study of Graphical Permutations

    A permutation π on a set of positive integers {a_1,a_2,...,a_n} is said to be graphical if there exists a graph containing exactly a_i vertices of degree (a_i) for each i. It has been shown that for positive integers with a_1

    unlv Repository record for A Study of Graphical Permutations (opens in a new tab) Download PDF for A Study of Graphical Permutations (opens in a new tab)

  7. Maximum Intersecting Families of Permutations

    … for the elements of G is de ned as follows: two permutations ; > G are intersecting if (i) = (i) for some i > {1; : : : ;n}. A subset S of G is, then, intersecting if any pair of its elements is intersecting. We say G has the EKR property if the size of any intersecting subset of G is bounded …

    regina Repository record for Maximum Intersecting Families of Permutations (opens in a new tab) Download PDF for Maximum Intersecting Families of Permutations (opens in a new tab)

  8. Nonlinear Complexity of Boolean Permutations

    … test. This is used to classify the 16! permutations over 4 bits into 302 equivalence classes, which have a maximal nonlinear depth of 6. In addition, we present a new complexity class defined in terms of nonlinearity.

    maryland Repository record for Nonlinear Complexity of Boolean Permutations (opens in a new tab)

  9. 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)

  10. Random Permutations and Simplicial Complexes

    … on two different combinatorial objects, permutations and simplicial complexes. First we study strong α-logarithmic measures on the symmetric group, including the well- studied Ewens sampling formula (see [21] and [20] for reference). We show that, for almost every α, precisely ⌈(1 − α log …

    washington Repository record for Random Permutations and Simplicial Complexes (opens in a new tab)

  11. Indexing Large Permutations in Hardware

    Generating unbiased permutations at run time has traditionally been accomplished through application specific optimized combinational logic and has been limited to very small permutations. For generating unbiased permutations of any larger size, variations of the memory dependent Fisher-Yates …

    vt Repository record for Indexing Large Permutations in Hardware (opens in a new tab)

  12. Generating some restricted classes of permutations

    We consider the generation of two categories of permutations. The first category consists of stamp foldings and related objects. A stamp folding is a permutation representing the folding of a linear strip of stamps into a pile. The second category consists of Dumont permutations of both the first …

    uvic Repository record for Generating some restricted classes of permutations (opens in a new tab)

  13. Sorting signed permutations by transpositions and reversals

    … is equivalent to the problem of sorting signed permutations by transpositions and reversals. We explore the characteristics of signed permutations and their sorting path. This exploration results in lower and upper bounds for a shortest sorting path. These bounds help us develop three …

    uvic Repository record for Sorting signed permutations by transpositions and reversals (opens in a new tab)

  14. Infinite permutation groups containing all finitary permutations

    … look at permutation groups which contain all permutations with finite support, the first focussing on decision problems and the second on the R? property (which involves counting the number of twisting conjugacy classes in a group). The third works with wreath products C}Z where C is cyclic, …

    soton Download PDF for Infinite permutation groups containing all finitary permutations (opens in a new tab)

  15. Combinatorial properties of permutations and permutation statistics

    … objects in the study of combinatorics are permutations. Permutations are typically defined to be an arrangement of the numbers {1, 2, . . . \uD835\uDC5B}, and they appear in countless problems and applications throughout mathematics. Sometimes we are particularly interested in observing or …

    msu Repository record for Combinatorial properties of permutations and permutation statistics (opens in a new tab)

  16. Olivier Messiaen's permutations symétriques in theory and practice

    … clearer understanding of the often misunderstood permutations symétriques. The second chapter focuses exclusively on symmetric permutations (SPs), surveying some existing explanations of SPs before considering the ways that their applications manifest symmetry. Further, it goes into considerable …

    ubc Repository record for Olivier Messiaen's permutations symétriques in theory and practice (opens in a new tab) Download PDF for Olivier Messiaen's permutations symétriques in theory and practice (opens in a new tab)

  17. Shape and Other Properties of 1324-Avoiding Permutations

    Of the three Wilf classes of permutations avoiding a single pattern of length 4, the exact enumerations for two of them were found by Gessel (1990) and Bona (1997). More recently, the Stanley-Wilf conjecture was proved by Marcus and Tardos (2004) relying on work by Furedi and Hajnal (1992), and …

    penn Repository record for Shape and Other Properties of 1324-Avoiding Permutations (opens in a new tab)

Page 1 of 41