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 9 of 9 for “"permutation statistics"”.
-
Automatic discovery of descriptions of permutation statistics
The field of permutation statistics is an established subfield of combinatorics with connections to many other fields, such as genome rearrangements, computer science and physics. The definitions of these statistics can be something simple, like counting the occurrences of a classical pattern in …
-
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 …
-
Generalizations of Permutation Statistics to Words and Labeled Forests
… over the symmetric groups. Since then, these statistics have been generalized in many ways, and many new permutation statistics have been defined, which are related to the major index and inversion number in may interesting ways. In this dissertation we study generalizations of some newer …
-
Cyclic shuffle-compatibility, cyclic permutation statistics, cyclic quasisymmetric functions and toric partitions
Thesis (Ph.D.)--Michigan State University. Mathematics - Doctor of Philosophy, 2024
-
Distribution of permutation statistics across pattern avoidance classes, and the search for a Denert-associated condition equivalent to pattern avoidance
… From this, we explore the distribution of permutation statistics across pattern avoidance for patterns of length 3 and 4. We then begin discussion of Han's bijection, a bijection on permutations which sends the major index to Denert's statistic and the descent number to the (strong) …
-
Bijective proofs for the shuffle compatibility of descent statistics
"Define a permutation to be any sequence of distinct positive integers. Given two permutations pi and sigma on disjoint underlying sets, we denote by pi shuffle sigma the set of shuffles of pi and sigma, that is, the set of all permutations obtained by interleaving the two permutations. A …
-
0-Hecke algebra actions on flags, polynomials, and Stanley-Reisner rings
… interpret the generating functions counting the permutations with fixed inverse descent set by their inversion number and major index. We also study the $H_n(0)$-action on the cohomology rings of the Springer fibers, and similarly interpret the (noncommutative) Hall-Littlewood symmetric functions …
-
Research on Combinatorial Statistics: Crossings and Nestings in Discrete Structures
We study the distribution of combinatorial statistics that exhibit a structure of crossings and nesting in various discrete structures, in particular, in set partitions, matchings, and fillings of moon polyominoes with entries 0 and 1. Let pi and y be two set partitions with the same number of …
-
Combinatorial Properties of the Hilbert Series of Macdonald Polynomials
… as a sum of n! objects weighted by two statistics. Using this formula we prove a q,t-analogue of the hook-length formula for hook shapes. We establish several new combinatorial operations on the fillings which generate F̃<sub>μ</sub>. These operations are used to prove a series of …