5 citations · 5 across the 6 of their papers we have counts for
6 papers
A note on three types of quasisymmetric functions
T. Kyle Petersen
In the context of generating functions for -partitions, we revisit three flavors of quasisymmetric functions: Gessel's quasisymmetric functions, Chow's type B quasisymmetric fun…
Enriched -partitions and peak algebras
T. Kyle Petersen
We develop a more general view of Stembridge's enriched -partitions and use this theory to outline the structure of peak algebras for the symmetric group and the hyperoctahedral…
Enumerating Segmented Patterns in Compositions and Encoding by Restricted Permutations
Sergey Kitaev, Tyrrell B. McAllister, T. Kyle Petersen
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse o…
Conway's napkin problem
Anders Claesson, T. Kyle Petersen
The napkin problem was first posed by John H. Conway, and written up as a `toughie' in "Mathematical Puzzles: A Connoisseur's Collection," by Peter Winkler. To paraphrase Winkler's…
An arctic circle theorem for groves
T. K. Petersen, D. Speyer
In earlier work, Jockusch, Propp, and Shor proved a theorem describing the limiting shape of the boundary between the uniformly tiled corners of a random tiling of an Aztec diamond…
Cyclic descents and P-partitions
T. Kyle Petersen
Louis Solomon showed that the group algebra of the symmetric group has a subalgebra called the descent algebra, generated by sums of permutations with a given de…