120 research outputs found
COMBINATORIAL ASPECTS OF EXCEDANCES AND THE FROBENIUS COMPLEX
In this dissertation we study the excedance permutation statistic. We start by extending the classical excedance statistic of the symmetric group to the affine symmetric group eSn and determine the generating function of its distribution. The proof involves enumerating lattice points in a skew version of the root polytope of type A. Next we study the excedance set statistic on the symmetric group by defining a related algebra which we call the excedance algebra. A combinatorial interpretation of expansions from this algebra is provided. The second half of this dissertation deals with the topology of the Frobenius complex, that is the order complex of a poset whose definition was motivated by the classical Frobenius problem. We determine the homotopy type of the Frobenius complex in certain cases using discrete Morse theory. We end with an enumeration of Q-factorial posets. Open questions and directions for future research are located at the end of each chapter
Eulerian quasisymmetric functions
We introduce a family of quasisymmetric functions called {\em Eulerian
quasisymmetric functions}, which specialize to enumerators for the joint
distribution of the permutation statistics, major index and excedance number on
permutations of fixed cycle type. This family is analogous to a family of
quasisymmetric functions that Gessel and Reutenauer used to study the joint
distribution of major index and descent number on permutations of fixed cycle
type. Our central result is a formula for the generating function for the
Eulerian quasisymmetric functions, which specializes to a new and surprising
-analog of a classical formula of Euler for the exponential generating
function of the Eulerian polynomials. This -analog computes the joint
distribution of excedance number and major index, the only of the four
important Euler-Mahonian distributions that had not yet been computed. Our
study of the Eulerian quasisymmetric functions also yields results that include
the descent statistic and refine results of Gessel and Reutenauer. We also
obtain -analogs, -analogs and quasisymmetric function analogs of
classical results on the symmetry and unimodality of the Eulerian polynomials.
Our Eulerian quasisymmetric functions refine symmetric functions that have
occurred in various representation theoretic and enumerative contexts including
MacMahon's study of multiset derangements, work of Procesi and Stanley on toric
varieties of Coxeter complexes, Stanley's work on chromatic symmetric
functions, and the work of the authors on the homology of a certain poset
introduced by Bj\"orner and Welker.Comment: Final version; to appear in Advances in Mathematics; 52 pages; this
paper was originally part of the longer paper arXiv:0805.2416v1, which has
been split into three paper
Eulerian quasisymmetric functions and cyclic sieving
It is shown that a refined version of a q-analogue of the Eulerian numbers
together with the action, by conjugation, of the subgroup of the symmetric
group generated by the -cycle on the set of permutations
of fixed cycle type and fixed number of excedances provides an instance of the
cyclic sieving phenonmenon of Reiner, Stanton and White. The main tool is a
class of symmetric functions recently introduced in work of two of the authors.Comment: 30 page
- …