A combinatorial Hopf algebra is a graded connected Hopf algebra over a field k equipped with a character (multiplicative linear functional) ζ : H → k. We show that the terminal object in the category of combinatorial Hopf algebras is the algebra QSym of quasisymmetric functions; this explains the ubiquity of quasi-symmetric functions as generating functions in combinatorics. We illustrate this with several examples. We prove that every character decomposes uniquely as a product of an even character and an odd character. Correspondingly, every combinatorial Hopf algebra (H, ζ) possesses two canonical Hopf subalgebras on which the character ζ is even (respectively, odd). The odd subalgebra is defined by certain canonical relations which we call the generalized Dehn-Sommerville relations. We show that, for H = QSym, the generalized Dehn-Sommerville relations are the Bayer-Billera relations and the odd subalgebra is the peak Hopf algebra of Stembridge. We prove that QSym is the product (in the categorical sense) of its even and odd Hopf subalgebras. We also calculate the odd subalgebras of various related combinatorial Hopf algebras: the Malvenuto-Reutenauer Hopf algebra of permutations, the LodayRonco Hopf algebra of planar binary trees, the Hopf algebras of symmetric functions and of non-commutative symmetric functions.
Using a formula of Billey, Jockusch and Stanley, Fomin and Kirillov have introduced a new set of diagrams that encode the Schubert polynomials. We call these objects rc-graphs. We define and prove two variants of an algorithm for constructing the set of all rc-graphs for a given permutation. This construction makes many of the identities known for Schubert polynomials more apparent, and yields new ones. In particular, we give a new proof of Monk's rule using an insertion algorithm on rc-graphs. We conjecture two analogs of Pieri's rule for multiplying Schubert polynomials. We also extend the algorithm to generate the double Schubert polynomials.
23 pagesInternational audienceWe identify two seemingly disparate structures: supercharacters, a useful way of doing Fourier analysis on the group of unipotent uppertriangular matrices with coefficients in a finite field, and the ring of symmetric functions in noncommuting variables. Each is a Hopf algebra and the two are isomorphic as such. This allows developments in each to be transferred. The identification suggests a rich class of examples for the emerging field of combinatorial Hopf algebras
We illuminate the relation between the Bruhat order and structure constants for the polynomial ring in terms of its basis of Schubert polynomials. We use combinatorial, algebraic, and geometric methods, notably a study of intersections of Schubert varieties and maps between flag manifolds. We establish a number of new identities among these structure constants. This leads to formulas for some of these constants and new results on the enumeration of chains in the Bruhat order. A new graded partial order on the symmetric group which contains Young's lattice arises from these investigations. We also derive formulas for certain specializations of Schubert polynomials.
Abstract. We introduce a new basis of the algebra of non-commutative symmetric functions whose images under the forgetful map are Schur functions when indexed by a partition. Dually, we build a basis of the quasi-symmetric functions which expand positively in the fundamental quasi-symmetric functions. We then use the basis to construct a non-commutative lift of the Hall-Littlewood symmetric functions with similar properties to their commutative counterparts.
We uncover the structure of the space of symmetric functions in non-commutative variables by showing that the underlined Hopf algebra is both free and co-free. We also introduce the Hopf algebra of quasi-symmetric functions in non-commutative variables and define the product and coproduct on the monomial basis of this space and show that this Hopf algebra is free and co-free. In the process of looking for bases which generate the space we define orders on the set partitions and set compositions which allow us to define bases which have simple and natural rules for the product of basis elements.
Abstract. We show the existence of a unital subalgebra Pn of the symmetric group algebra linearly spanned by sums of permutations with a common peak set, which we call the peak algebra. We show that Pn is the image of the descent algebra of type B under the map to the descent algebra of type A which forgets the signs, and also the image of the descent algebra of type D. The algebra Pn contains a two-sided ideal • P n which is defined in terms of interior peaks. This object was introduced in previous work by Nyman (2003); we find that it is the image of certain ideals of the descent algebras of types B and D. We derive an exact sequence of the form 0 → • P n → Pn → P n−2 → 0. We obtain this and many other properties of the peak algebra and its peak ideal by first establishing analogous results for signed permutations and then forgetting the signs. In particular, we construct two new commutative semisimple subalgebras of the descent algebra (of dimensions n and n 2 +1) by grouping permutations according to their number of peaks or interior peaks. We discuss the Hopf algebraic structures that exist on the direct sums of the spaces Pn and • P n over n ≥ 0 and explain the connection with previous work of Stembridge (1997); we also obtain new properties of his descents-to-peaks map and construct a type B analog.
Abstract. We introduce a natural Hopf algebra structure on the space of noncommutative symmetric functions. The bases for this algebra are indexed by set partitions. We show that there exists a natural inclusion of the Hopf algebra of noncommutative symmetric functions in this larger space. We also consider this algebra as a subspace of noncommutative polynomials and use it to understand the structure of the spaces of harmonics and coinvariants with respect to this collection of noncommutative polynomials and conclude two analogues of Chevalley's theorem in the noncommutative setting.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.