18,633 research outputs found

    Stable multivariate WW-Eulerian polynomials

    Full text link
    We prove a multivariate strengthening of Brenti's result that every root of the Eulerian polynomial of type BB is real. Our proof combines a refinement of the descent statistic for signed permutations with the notion of real stability-a generalization of real-rootedness to polynomials in multiple variables. The key is that our refined multivariate Eulerian polynomials satisfy a recurrence given by a stability-preserving linear operator. Our results extend naturally to colored permutations, and we also give stable generalizations of recent real-rootedness results due to Dilks, Petersen, and Stembridge on affine Eulerian polynomials of types AA and CC. Finally, although we are not able to settle Brenti's real-rootedness conjecture for Eulerian polynomials of type DD, nor prove a companion conjecture of Dilks, Petersen, and Stembridge for affine Eulerian polynomials of types BB and DD, we indicate some methods of attack and pose some related open problems.Comment: 17 pages. To appear in J. Combin. Theory Ser.

    Hyperplane Arrangements and Diagonal Harmonics

    Get PDF
    In 2003, Haglund's {\sf bounce} statistic gave the first combinatorial interpretation of the q,tq,t-Catalan numbers and the Hilbert series of diagonal harmonics. In this paper we propose a new combinatorial interpretation in terms of the affine Weyl group of type AA. In particular, we define two statistics on affine permutations; one in terms of the Shi hyperplane arrangement, and one in terms of a new arrangement - which we call the Ish arrangement. We prove that our statistics are equivalent to the {\sf area'} and {\sf bounce} statistics of Haglund and Loehr. In this setting, we observe that {\sf bounce} is naturally expressed as a statistic on the root lattice. We extend our statistics in two directions: to "extended" Shi arrangements and to the bounded chambers of these arrangements. This leads to a (conjectural) combinatorial interpretation for all integral powers of the Bergeron-Garsia nabla operator applied to the elementary symmetric functions.Comment: 27 pages, 12 figure

    Applications of the Brauer complex: card shuffling, permutation statistics, and dynamical systems

    Get PDF
    By algebraic group theory, there is a map from the semisimple conjugacy classes of a finite group of Lie type to the conjugacy classes of the Weyl group. Picking a semisimple class uniformly at random yields a probability measure on conjugacy classes of the Weyl group. Using the Brauer complex, it is proved that this measure agrees with a second measure on conjugacy classes of the Weyl group induced by a construction of Cellini using the affine Weyl group. Formulas for Cellini's measure in type AA are found. This leads to new models of card shuffling and has interesting combinatorial and number theoretic consequences. An analysis of type C gives another solution to a problem of Rogers in dynamical systems: the enumeration of unimodal permutations by cycle structure. The proof uses the factorization theory of palindromic polynomials over finite fields. Contact is made with symmetric function theory.Comment: One change: we fix a typo in definition of f(m,k,i,d) on page 1

    Affine shuffles, shuffles with cuts, the Whitehouse module, and patience sorting

    Get PDF
    Type A affine shuffles are compared with riffle shuffles followed by a cut. Although these probability measures on the symmetric group S_n are different, they both satisfy a convolution property. Strong evidence is given that when the underlying parameter qq satisfies gcd(n,q−1)=1gcd(n,q-1)=1, the induced measures on conjugacy classes of the symmetric group coincide. This gives rise to interesting combinatorics concerning the modular equidistribution by major index of permutations in a given conjugacy class and with a given number of cyclic descents. It is proved that the use of cuts does not speed up the convergence rate of riffle shuffles to randomness. Generating functions for the first pile size in patience sorting from decks with repeated values are derived. This relates to random matrices.Comment: Galley version for J. Alg.; minor revisions in Sec.
    • …
    corecore