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

  1. Permutations statistics of indexed and poset permutations

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1992.

    mit Repository record for Permutations statistics of indexed and poset permutations (opens in a new tab)

  2. Permutations with forbidden subsequences, and, stack-sortable permutations

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1990.

    mit Repository record for Permutations with forbidden subsequences, and, stack-sortable permutations (opens in a new tab)

  3. 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 Repository record for Packing and Counting 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 Repository record for Intersection : poems and permutations (opens in a new tab)

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

  6. Studies in partitions and permutations.

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1973.

    mit Repository record for Studies in partitions and permutations. (opens in a new tab)

  7. Matrix estimation with latent permutations

    … matrix with rows and columns shuffled by latent permutations, given noisy and incomplete observations of its entries. This problem is at the intersection of shape constrained estimation which has a long history in statistics, and latent permutation learning which has driven a recent surge of …

    mit Repository record for Matrix estimation with latent permutations (opens in a new tab)

  8. Statistics on pattern-avoiding permutations

    … concerns the enumeration of pattern-avoiding permutations with respect to certain statistics. Our first result is that the joint distribution of the pair of statistics 'number of fixed points' and 'number of excedances' is the same in 321-avoiding as in 132-avoiding permutations. This …

    mit Repository record for Statistics on pattern-avoiding permutations (opens in a new tab)

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

  10. Diagrams of affine permutations and their labellings

    … and we extend this notion to affine permutations. The balanced labellings give a natural encoding of the reduced decompositions of affine permutations. We show that the sum of weight monomials of the column-strict balanced labellings is the affine Stanley symmetric function which …

    mit Repository record for Diagrams of affine permutations and their labellings (opens in a new tab)

  11. Permutations of cinephilia: aesthetics, technology, and social consciousness

    In this dissertation I investigate the role played by cinephilia both as a moving historical force behind film reviewing and as the engine behind several contemporary developments in the way we think and write about cinema. To do so, in the first chapter I evaluate the major attempts to theorize …

    rutgers

  12. Dollo & Me (Aftermath with Permutations) and The Relenting

    … The first is called Dollo & Me (Aftermath with Permutations)' and is an unconventional and nonlinear memoir addressing the aftermath of violence and the changes that are required for survival. It specifically looks at my twenties and thirties and tackles the various manifestations of trauma in …

    unm Repository record for Dollo & Me (Aftermath with Permutations) and The Relenting (opens in a new tab)

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

  14. Algebraic structure of some groups of recursive permutations

    Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 1960

    mit Repository record for Algebraic structure of some groups of recursive permutations (opens in a new tab)

  15. Combinatorial Problems on the Integers: Colorings, Games, and Permutations

    … has a winning strategy.</p> <p>Finally, we study permutations of integers in Chapters 4 to 6. In Chapter 4, we provide an alternative proof of a result by Miner and Pak which says that 123- and 132-avoiding permutations with a fixed leading term are enumerated by the ballot numbers. We then study …

    denver Repository record for Combinatorial Problems on the Integers: Colorings, Games, and Permutations (opens in a new tab)

  16. Exact and asymptotic enumeration of permutations with subsequence conditions

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.

    mit Repository record for Exact and asymptotic enumeration of permutations with subsequence conditions (opens in a new tab)

  17. Intersecting families of permutations and other problems in extremal combinatorics

    cambridge

  18. Pattern avoidance for alternating permutations and reading words of tableaux

    … related to pattern avoidance in alternating permutations and generalizations thereof. We give bijective enumerations of alternating permutations avoiding patterns of length 3 and 4, of permutations that are the reading words of a "thickened staircase" shape (or equivalently of permutations

    mit Repository record for Pattern avoidance for alternating permutations and reading words of tableaux (opens in a new tab)

  19. Plane Permutations and their Applications to Graph Embeddings and Genome Rearrangements

    … of a map, we introduce new objects called plane permutations. Plane permutations not only provide new insight into enumeration of maps and related graph embedding problems, but they also provide a powerful framework to study less related genome rearrangement problems. As results, we refine and …

    vt Repository record for Plane Permutations and their Applications to Graph Embeddings and Genome Rearrangements (opens in a new tab)

Page 1 of 13