A decomposition of Solomon's descent algebra

@article{Garsia1989ADO,
  title={A decomposition of Solomon's descent algebra},
  author={Adriano M. Garsia and Christophe Reutenauer},
  journal={Advances in Mathematics},
  year={1989},
  volume={77},
  pages={189-262}
}

Figures from this paper

Cyclic Descents and P-Partitions
Louis Solomon showed that the group algebra of the symmetric group $$\mathfrak{S}_{n}$$n has a subalgebra called the descent algebra, generated by sums of permutations with a given descent set. In
Nonassociative Solomon's descent algebras
Descent algebras of graded bialgebras were introduced by F. Patras as a generalization of Solomon's descent algebras for Coxeter groups of type $A$, i.e. symmetric groups. The universal enveloping
A decomposition of the group algebra of a hyperoctahedral group
The descent algebra of a finite Coxeter group W is a subalgebra of the group algebra defined by Solomon. Descent algebras of symmetric groups have properties that are not shared by other Coxeter
A decomposition of the group algebraof a hyperoctahedral group
The descent algebra of a finite Coxeter group W is a subalgebra of the group algebra defined by Solomon. Descent algebras of symmetric groups have properties that are not shared by other Coxeter
A Decomposition of the Descent Algebra of a Finite Coxeter Group
The purpose of this paper is twofold. First we aim to unify previous work by the first two authors, A. Garsia, and C. Reutenauer (see [2], [3], [4], [5] and [10]) on the structure of the descent
Homomorphisms between Solomon's descent algebras
Cyclotomic Solomon Algebras
...
...

References

SHOWING 1-10 OF 34 REFERENCES
Lyndon Words, Free Algebras and Shuffles
A Lyndon word is a primitive word which is minimum in its conjugation class, for the lexicographical ordering. These words have been introduced by Lyndon in order to find bases of the quotients of
A hyperoctahedral analogue of the free lie algebra
Free Differential Calculus, IV. The Quotient Groups of the Lower Central Series
The quotient groups Qn(G) =GnGn+i of the lower central series G = G1 D G, D G, D * * of a finitely generated group G are finitely generated abelian groups. Our object is to develop an algorithm for
Shuffles of permutations and the Kronecker product
TLDR
A combinatorial interpretation ofSI a product of homogeneous symmetric functions andJ, K unrestricted skew shapes is given and how Gessel's and Lascoux's results are related is shown and shown how they can be derived from a special case of the result.
Symmetric functions and Hall polynomials
I. Symmetric functions II. Hall polynomials III. HallLittlewood symmetric functions IV. The characters of GLn over a finite field V. The Hecke ring of GLn over a finite field VI. Symmetric functions
...
...