Results 11  20
of
704
Generating Functions for Generating Trees
 PROCEEDINGS OF 11TH FORMAL POWER SERIES AND ALGEBRAIC COMBINATORICS
, 1999
"... Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the object. Generating trees lead to a fast computation of enumerati ..."
Abstract

Cited by 68 (18 self)
 Add to MetaCart
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the object. Generating trees lead to a fast computation of enumeration sequences (sometimes, to explicit formulae as well) and provide efficient random generation algorithms. We investigate the links between the structural properties of the rewriting rules defining such trees and the rationality, algebraicity, or transcendence of the corresponding generating function.
Combinatorial Hopf algebras and generalized DehnSommerville relations
, 2003
"... 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 u ..."
Abstract

Cited by 65 (16 self)
 Add to MetaCart
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 quasisymmetric 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 DehnSommerville relations. We show that, for H = QSym, the generalized DehnSommerville relations are the BayerBillera 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 MalvenutoReutenauer Hopf algebra of permutations, the
Crossings and nestings of matchings and partitions
 Trans. Amer. Math. Soc
"... Abstract. We present results on the enumeration of crossings and nestings for matchings and set partitions. Using a bijection between partitions and vacillating tableaux, we show that if we fix the sets of minimal block elements and maximal block elements, the crossing number and the nesting number ..."
Abstract

Cited by 61 (15 self)
 Add to MetaCart
Abstract. We present results on the enumeration of crossings and nestings for matchings and set partitions. Using a bijection between partitions and vacillating tableaux, we show that if we fix the sets of minimal block elements and maximal block elements, the crossing number and the nesting number of partitions have a symmetric joint distribution. It follows that the crossing numbers and the nesting numbers are distributed symmetrically over all partitions of [n], as well as over all matchings on [2n]. As a corollary, the number of knoncrossing partitions is equal to the number of knonnesting partitions. The same is also true for matchings. An application is given to the enumeration of matchings with no kcrossing (or with no knesting). 1.
Probability laws related to the Jacobi theta and Riemann zeta functions, and the Brownian excursions
 Bulletin (New series) of the American Mathematical Society
"... Abstract. This paper reviews known results which connect Riemann’s integral representations of his zeta function, involving Jacobi’s theta function and its derivatives, to some particular probability laws governing sums of independent exponential variables. These laws are related to onedimensional ..."
Abstract

Cited by 57 (11 self)
 Add to MetaCart
Abstract. This paper reviews known results which connect Riemann’s integral representations of his zeta function, involving Jacobi’s theta function and its derivatives, to some particular probability laws governing sums of independent exponential variables. These laws are related to onedimensional Brownian motion and to higher dimensional Bessel processes. We present some characterizations of these probability laws, and some approximations of Riemann’s zeta function which are related to these laws. Contents
Tree Consistency and Bounds on the Performance of the MaxProduct Algorithm and Its Generalizations
, 2002
"... Finding the maximum a posteriori (MAP) assignment of a discretestate distribution specified by a graphical model requires solving an integer program. The maxproduct algorithm, also known as the maxplus or minsum algorithm, is an iterative method for (approximately) solving such a problem on gr ..."
Abstract

Cited by 55 (5 self)
 Add to MetaCart
Finding the maximum a posteriori (MAP) assignment of a discretestate distribution specified by a graphical model requires solving an integer program. The maxproduct algorithm, also known as the maxplus or minsum algorithm, is an iterative method for (approximately) solving such a problem on graphs with cycles.
A combinatorial formula for Macdonald polynomials
 J. Amer. Math. Soc
, 2004
"... The Macdonald polynomials ˜ Hµ(x; q, t) have been the subject of much attention in combinatorics since Macdonald [25] defined them and conjectured that their expansion in terms of Schur polynomials should have positive coefficients. Macdonald’s conjecture was proven in [11] by geometric and represen ..."
Abstract

Cited by 54 (12 self)
 Add to MetaCart
The Macdonald polynomials ˜ Hµ(x; q, t) have been the subject of much attention in combinatorics since Macdonald [25] defined them and conjectured that their expansion in terms of Schur polynomials should have positive coefficients. Macdonald’s conjecture was proven in [11] by geometric and representationtheoretic
Structure of the MalvenutoReutenauer Hopf algebra of permutations
 Adv. Math
"... Abstract. We analyze the structure of the MalvenutoReutenauer Hopf algebra SSym of permutations in detail. We give explicit formulas for its antipode, prove that it is a cofree coalgebra, determine its primitive elements and its coradical filtration, and show that it decomposes as a crossed product ..."
Abstract

Cited by 51 (15 self)
 Add to MetaCart
Abstract. We analyze the structure of the MalvenutoReutenauer Hopf algebra SSym of permutations in detail. We give explicit formulas for its antipode, prove that it is a cofree coalgebra, determine its primitive elements and its coradical filtration, and show that it decomposes as a crossed product over the Hopf algebra of quasisymmetric functions. In addition, we describe the structure constants of the multiplication as a certain number of facets of the permutahedron. As a consequence we obtain a new interpretation of the product of monomial quasisymmetric functions in terms of the facial structure of the cube. The Hopf algebra of Malvenuto and Reutenauer has a linear basis indexed by permutations. Our results are obtained from a combinatorial description of the Hopf algebraic structure with respect to a new basis for this algebra, related to the original one via Möbius inversion on the weak order on the symmetric groups. This is in analogy with the relationship between the monomial and fundamental bases of the algebra of quasisymmetric functions. Our results reveal a close relationship between the structure of the MalvenutoReutenauer Hopf algebra and the weak order on the symmetric groups.
A COMBINATORIAL DESCRIPTION OF THE SPECTRUM FOR THE TSETLIN LIBRARY AND ITS GENERALIZATION TO HYPERPLANE ARRANGEMENTS
 VOL. 99, NO. 1 DUKE MATHEMATICAL JOURNAL
, 1999
"... ..."
Positivity Problems and Conjectures in Algebraic Combinatorics
 in Mathematics: Frontiers and Perspectives
, 1999
"... Introduction. Algebraic combinatorics is concerned with the interaction between combinatorics and such other branches of mathematics as commutative algebra, algebraic geometry, algebraic topology, and representation theory. Many of the major open problems of algebraic combinatorics are related to p ..."
Abstract

Cited by 48 (1 self)
 Add to MetaCart
Introduction. Algebraic combinatorics is concerned with the interaction between combinatorics and such other branches of mathematics as commutative algebra, algebraic geometry, algebraic topology, and representation theory. Many of the major open problems of algebraic combinatorics are related to positivity questions, i.e., showing that certain integers are nonnegative. The significance of positivity to algebraic combinatorics stems from the fact that a nonnegative integer can have both a combinatorial and an algebraic interpretation. The archetypal algebraic interpretation of a nonnegative integer is as the dimension of a vector space. Thus to show that a certain integer m is nonnegative, it suces to nd a vector space Vm of dimension m. Similarly to show that m n, it suces to nd an injective map Vm ! V n or surjective map V n ! Vm . Of course the inequality m n is equivalent to the positivity statement n m 0, while the injectivity of the map ' : Vm ! V n is equivalent to the