English
Related papers

Related papers: Descent representations and colored quasisymmetric…

200 papers

We define new statistics, (c, d)-descents, on the colored permutation groups Z_r \wr S_n and compute the distribution of these statistics on the elements in these groups. We use some combinatorial approaches, recurrences, and generating…

Combinatorics · Mathematics 2007-09-18 Eli Bagno , David Garber , Toufik Mansour

The permutation representation afforded by a Coxeter group W acting on the cosets of a standard parabolic subgroup inherits many nice properties from W such as a shellable Bruhat order and a flat deformation over Z[q] to a representation of…

Combinatorics · Mathematics 2010-08-06 Eric M. Rains , Monica J. Vazirani

We discuss three distinct topics of independent interest; one in enumerative combinatorics, one in symmetric function theory, and one in algebraic geometry. The topic in enumerative combinatorics concerns a q-analog of a generalization of…

Combinatorics · Mathematics 2012-07-09 John Shareshian , Michelle L. Wachs

We give a new proof of Chung and Graham's ``G-descent expansion'' of the classical chromatic polynomial, as well as a special case of the quasi-symmetric function expansion of the path-cycle symmetric function Xi_D. Both proofs rely on…

Combinatorics · Mathematics 2016-09-07 Timothy Y. Chow

Characterizing sets of permutations whose associated quasisymmetric function is symmetric and Schur-positive is a long-standing problem in algebraic combinatorics. In this paper we present a general method to construct Schur-positive sets…

Combinatorics · Mathematics 2016-11-01 Sergi Elizalde , Yuval Roichman

We enumerate derangements with descents in prescribed positions. A generating function was given by Guo-Niu Han and Guoce Xin in 2007. We give a combinatorial proof of this result, and derive several explicit formulas. To this end, we…

Combinatorics · Mathematics 2008-11-13 Niklas Eriksen , Ragnar Freij , Johan Wastlund

Egge, Loehr, and Warrington proved a formula for the Schur function expansion of a symmetric function in terms of its expansion in fundamental quasi-symmetric functions. Their formula involves the coefficients of a modified inverse Kostka…

Combinatorics · Mathematics 2019-12-25 Ira M. Gessel

The representation theory of the symmetric groups is intimately related to geometry, algebraic combinatorics, and Lie theory. The spin representation theory of the symmetric groups was originally developed by Schur. In these lecture notes,…

Representation Theory · Mathematics 2011-12-15 Jinkui Wan , Weiqiang Wang

Shareshian-Wachs, Brosnan-Chow, and Guay-Pacquet [Adv. Math. ${\bf 295}$ (2016), ${\bf 329}$ (2018), arXiv:1601.05498] realized the chromatic (quasi-)symmetric function of a unit interval graph in terms of Hessenberg varieties. Here we…

Combinatorics · Mathematics 2024-10-18 Syu Kato

The $k$-arrangements are permutations whose fixed points are $k$-colored. We prove enumerative results related to statistics and patterns on $k$-arrangements, confirming several conjectures by Blitvi\'c and Steingr\'imsson. In particular,…

Combinatorics · Mathematics 2020-05-14 Shishuo Fu , Guo-Niu Han , Zhicong Lin

The chromatic symmetric function $X_G$ of a graph $G$ was introduced by Stanley. In this paper we introduce a quasisymmetric generalization $X^k_G$ called the $k$-chromatic quasisymmetric function of $G$ and show that it is positive in the…

Combinatorics · Mathematics 2011-01-05 Brandon Humpert

We construct a new operation among representations of the symmetric group that interpolates between the classical internal and external products, which are defined in terms of tensor product and induction of representations. Following…

Combinatorics · Mathematics 2007-05-23 Marcelo Aguiar , Walter Ferrer , Walter Moreira

The problem of finding Schur-positive sets of permutations, originally posed by Gessel and Reutenauer, has seen some recent developments. Schur-positive sets of pattern-avoiding permutations have been found by Sagan et al and a general…

Combinatorics · Mathematics 2016-09-26 Sergi Elizalde , Yuval Roichman

The Schur functions, a basis for the symmetric polynomials (Sym), encode the irreducible representations of the symmetric group, $\mathfrak{S}_n$, via the Frobenius characteristic map. In 1996, Krob and Thibon defined a quasisymmetric…

Combinatorics · Mathematics 2024-05-20 Angela Hicks , Samantha Miller-Brown

Haglund, Luoto, Mason, and van Willigenburg introduced a basis for quasisymmetric functions called the quasisymmetric Schur function basis, generated combinatorially through fillings of composition diagrams in much the same way as Schur…

Combinatorics · Mathematics 2011-10-19 Sarah Mason , Jeffrey Remmel

We introduce and study a family of inhomogeneous symmetric functions which we call the Frobenius-Schur functions. These functions are indexed by partitions and differ from the conventional Schur functions in lower terms only. Our interest…

Combinatorics · Mathematics 2007-05-23 Grigori Olshanski , Amitai Regev , Anatoly Vershik

Stirling permutations were introduced by Gessel and Stanley, who used their enumeration by the number of descents to give a combinatorial interpretation of certain polynomials related to Stirling numbers. Quasi-Stirling permutations, which…

Combinatorics · Mathematics 2020-02-05 Sergi Elizalde

By considering type B analogs of permutations and tableaux, we extend abstract dual equivalence to type B in two directions. In one direction, we define involutions on signed permutations and shifted tableaux that give a weak dual…

Combinatorics · Mathematics 2020-03-05 Sami Assaf

The involution Stanley symmetric functions $\hat{F}_y$ are the stable limits of the analogues of Schubert polynomials for the orbits of the orthogonal group in the flag variety. These symmetric functions are also generating functions for…

Combinatorics · Mathematics 2017-11-10 Zachary Hamaker , Eric Marberg , Brendan Pawlowski

We describe a combinatorial formula for the coefficients when the dual immaculate quasisymmetric functions are decomposed into Young quasisymmetric Schur functions. We prove this using an analogue of Schensted insertion. Using this result,…

Combinatorics · Mathematics 2016-06-14 Edward E. Allen , Joshua Hallam , Sarah K. Mason