Back to search

Michigan State University

Bijective proofs for the shuffle compatibility of descent statistics

Abstract

dc:description

"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 permutation statistic is a function, St, whose domain is the set of permutations and has the property that St(pi) only depends on the relative order of the elements of pi. A permutation statistic is shuffle compatible if the distribution of St on pi shuffle sigma depends only on the lengths of pi and sigma and St(pi) and St(sigma) rather than on the individual permutations themselves. This notion is implicit in the work of Stanley when he developed his theory of P-partitions, where P is a partially ordered set. The definition was explicitly given by Gessel and Zhuang who proved that various permutation statistics were shuffle compatible using mainly algebraic means. This work was continued by Grinberg. The purpose of the present work is to use bijective techniques to give demonstrations of shuffle compatibility. In particular, we show how a large number of permutation statistics can be shown to be shuffle compatible using a few simple bijections. Our approach also leads to a method for constructing such bijective proofs rather than having to treat each one in an ad hoc manner. Finally, we are able to prove a conjecture of Gessel and Zhuang about the shuffle compatibility of a certain statistic."--Page ii.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Baker-Jarvis, Duff
Contributors dc:contributor
  • Sagan, Bruce E.
  • Bell, Robert W.
  • Hall, Jonathan
  • Shapiro, Michael

Subjects

dc:subject × 4

Rights

dc:rights
Statement dc:rights
  • In Copyright
Language dc:language
English

Identifiers

dc:identifier.*
Identifier
etd:47771
isbn:9781392074367
isbn:1392074363
oclc:1117774613
umi:13863074
local:BakerJarvis_grad.msu_0128D_16712

Chain of custody

source
Harvested from
Michigan State University
Base URL
d.lib.msu.edu/oai
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Baker-Jarvis, Duff. Bijective proofs for the shuffle compatibility of descent statistics. 2019. https://doi.org/doi:10.25335/m8q9-q075