The Descent Set and Connectivity Set of a Permutation

dc.creatorStanley, Richard P.
dc.date2005-07-11
dc.date.accessioned2026-07-07T05:21:36Z
dc.date.available2026-07-07T05:21:36Z
dc.descriptionThe descent set D(w) of a permutation w of 1,2,...,n is a standard and well-studied statistic. We introduce a new statistic, the connectivity set C(w), and show that it is a kind of dual object to D(w). The duality is stated in terms of the inverse of a matrix that records the joint distribution of D(w) and C(w). We also give a variation involving permutations of a multiset and a q-analogue that keeps track of the number of inversions of w.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/math/0507224
dc.identifierhttp://arxiv.org/abs/math/0507224
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75748
dc.subjectCombinatorics
dc.subject05A05
dc.titleThe Descent Set and Connectivity Set of a Permutation
dc.typetext

Files

Collections