Descents, Peaks, and P -partitions Doctor of Philosophy
نویسندگان
چکیده
Descents, Peaks, and P -partitions A dissertation presented to the Faculty of the Graduate School of Arts and Sciences of Brandeis University, Waltham, Massachusetts by T. Kyle Petersen We use a variation on Richard Stanley’s P -partitions to study “Eulerian” descent subalgebras of the group algebra of the symmetric group and of the hyperoctahedral group. In each case we give explicit structure polynomials for orthogonal idempotents (including q-analogues in many cases). Much of the study of descents carries over similarly to the study of peaks, where we replace the use of Stanley’s P -partitions with John Stembridge’s enriched P -partitions.
منابع مشابه
Counting subwords in flattened permutations
In this paper, we consider the number of occurrences of descents, ascents, 123-subwords, 321-subwords, peaks and valleys in flattened permutations, which were recently introduced by Callan in his study of finite set partitions. For descents and ascents, we make use of the kernel method and obtain an explicit formula (in terms of Eulerian polynomials) for the distribution on Sn in the flattened ...
متن کاملCyclic Descents and P-Partitions
Louis Solomon showed that the group algebra of the symmetric group Sn has a subalgebra called the descent algebra, generated by sums of permutations with a given descent set. In fact, he showed that every Coxeter group has something that can be called a descent algebra. There is also a commutative, semisimple subalgebra of Solomon’s descent algebra generated by sums of permutations with the sam...
متن کاملEnumeration of Partitions by Long Rises, Levels, and Descents
When the partitions of [n] = {1, 2, . . . , n} are identified with the restricted growth functions on [n], under a known bijection, certain enumeration problems for classical word statistics are formulated for set partitions. In this paper we undertake the enumeration of partitions of [n] with respect to the number of occurrences of rises, levels and descents, of arbitrary integral length not e...
متن کاملLinked Partitions and Permutation Tableaux
Linked partitions were introduced by Dykema in the study of transforms in free probability theory, whereas permutation tableaux were introduced by Steingŕımsson and Williams in the study of totally positive Grassmannian cells. Let [n] = {1, 2, . . . , n}. Let L(n, k) denote the set of linked partitions of [n] with k blocks, let P (n, k) denote the set of permutations of [n] with k descents, and...
متن کاملRecounting the Number of Rises, Levels, and Descents in Finite Set Partitions
A finite set partition is said to have a descent at i if it has a descent at i in its canonical representation as a restricted growth function (and likewise for level and rise). In this note, we provide direct combinatorial proofs as well as extensions of recent formulas for the total number of rises, levels, and descents in all the partitions of an n-set with a prescribed number of blocks. In ...
متن کامل