k-Eulerian Posets

A poset P is called k-Eulerian if every interval of rank k is Eulerian. The class of k-Eulerian posets interpolates between graded posets and Eulerian posets. It is a straightforward observation that a 2k-Eulerian poset is also (2k+1)-Eulerian. We prove that the ab-index of a (2k+1)-Eulerian poset can be expressed in terms of c=a+b, d=ab+ba and e ^2k+1=(a–b)^2k+1. The proof relies upon the algebraic approaches of Billera-Liu and Ehrenborg-Readdy. We extend the Billera-Liu flag algebra to a Newtonian coalgebra. This flag Newtonian coalgebra forms a Laplace pairing with the Newtonian coalgebra ka,b studied by Ehrenborg-Readdy. The ideal of flag operators that vanish on (2k+1)-Eulerian posets is also a coideal. Hence, the Laplace pairing implies that the dual of the coideal is the desired subalgebra of ka,b. As a corollary we obtain a proof of the existence of the cd-index which does not use induction.     

The Hopf algebra of diagonal rectangulations

We define and study a combinatorial Hopf algebra dRec with basis elements indexed by diagonal rectangulations of a square. This Hopf algebra provides an intrinsic combinatorial realization of the Hopf algebra tBax of twisted Baxter permutations, which previously had only been described extrinsically as a Hopf subalgebra of the Malvenuto-Reutenauer Hopf algebra of permutations. We describe the natural lattice structure on diagonal rectangulations, analogous to the Tamari lattice on triangulations, and observe that diagonal rectangulations index the vertices of a polytope analogous to the associahedron. We give an explicit bijection between twisted Baxter permutations and the better-known Baxter permutations, and describe the resulting Hopf algebra structure on Baxter permutations.     

Möbius Polynomials of Face Posets of Convex Polytopes

The Möbius polynomial is an invariant of ranked posets, closely related to the Möbius function. In this paper, we study the Möbius polynomial of face posets of convex polytopes. We present formulas for computing the Möbius polynomial of the face poset of a pyramid or a prism over an existing polytope, or of the gluing of two or more polytopes in terms of the Möbius polynomials of the original polytopes. We also present general formulas for calculating Möbius polynomials of face posets of simplicial polytopes and of Eulerian posets in terms of their f-vectors and some additional constraints.     

A self paired Hopf algebra on double posets and a Littlewood-Richardson rule

Let D be the set of isomorphism types of finite double partially ordered sets, that is sets endowed with two partial orders. On ZD we define a product and a coproduct, together with an internal product, that is, degree-preserving. With these operations ZD is a Hopf algebra. We define a symmetric bilinear form on this Hopf algebra: it counts the number of pictures (in the sense of Zelevinsky) between two double posets. This form is a Hopf pairing, which means that product and coproduct are adjoint each to another. The product and coproduct correspond respectively to disjoint union of posets and to a natural decomposition of a poset into order ideals. Restricting to special double posets (meaning that the second order is total), we obtain a notion equivalent to Stanley's labelled posets, and a Hopf subalgebra already considered by Blessenohl and Schocker. The mapping which maps each double poset onto the sum of the linear extensions of its first order, identified via its second (total) order with permutations, is a Hopf algebra homomorphism, which is isometric and preserves the internal product, onto the Hopf algebra of permutations, previously considered by the two authors. Finally, the scalar product between any special double poset and double posets naturally associated to integer partitions is described by an extension of the Littlewood-Richardson rule.     

Restricted Simsun Permutations

A permutation is simsun if for all k, the subword of the one-line notation consisting of the k smallest entries does not have three consecutive decreasing elements. Simsun permutations were introduced by Simion and Sundaram, who showed that they are counted by the Euler numbers. In this paper we enumerate simsun permutations avoiding a pattern or a set of patterns of length 3. The results involve Motkzin, Fibonacci, and secondary structure numbers. The techniques in the proofs include generating functions, bijections into lattice paths and generating trees.     

Lattice ordered effect algebras

The purpose of this paper is to discuss some structural properties of lattice ordered effect algebras. We will use these structural properties to find certain lattices and classes of lattices that do not admit an effect algebra structure. Finally, using these structural properties, we will show that if L is the face lattice of a convex polytope in $ R^3 $ with more than 3 vertices, then L does not admit an effect algebra structure.Dedicated to the memory of Gian-Carlo Rota     

Unimodality and Lie Superalgebras

It is well-known how the representation theory of the Lie algebra sl(2, ?) can be used to prove that certain sequences of integers are unimodal and that certain posets have the Sperner property. Here an analogous theory is developed for the Lie superalgebra osp(1,2). We obtain new classes of unimodal sequences (described in terms of cycle index polynomials) and a new class of posets (the “super analogue” of the lattice L(m,n) of Young diagrams contained in an m × n rectangle) which have the Sperner property.     

Weighted infinitesimal unitary bialgebras,pre-Lie,matrix algebras,and polynomial algebras

Motivated by comatrix coalgebras, we introduce the concept of a Newtonian comatrix coalgebra. We construct an infinitesimal unitary bialgebra on matrix algebras, via the construction of a suitable coproduct. As a consequence, a Newtonian comatrix coalgebra is established. Furthermore, an infinitesimal unitary Hopf algebra, under the view of Aguiar, is constructed on matrix algebras. By the close relationship between pre-Lie algebras and infinitesimal unitary bialgebras, we erect a pre-Lie algebra and a new Lie algebra on matrix algebras. Finally, a weighted infinitesimal unitary bialgebra on non-commutative polynomial algebras is also given.     

Counting Simsun Permutations by Descents

We count in the present work simsun permutations of length n by their number of descents. Properties studied include the recurrence relation and real-rootedness of the generating function of the number of n-simsun permutations with k descents. By means of generating function arguments, we show that the descent number is equidistributed over n-simsun permutations and n-André permutations. We also compute the mean and variance of the random variable X _n taking values the descent number of random n-simsun permutations, and deduce that the distribution of descents over random simsun permutations of length n satisfies a central and a local limit theorem as n ?? +???.     

Colored Posets and Colored Quasisymmetric Functions

The colored quasisymmetric functions, like the classic quasisymmetric functions, are known to form a Hopf algebra with a natural peak subalgebra. We show how these algebras arise as the image of the algebra of colored posets. To effect this approach, we introduce colored analogs of P-partitions and enriched P-partitions. We also frame our results in terms of Aguiar, Bergeron, and Sottile’s theory of combinatorial Hopf algebras and its colored analog.     

Lattice congruences, fans and Hopf algebras

We give a unified explanation of the geometric and algebraic properties of two well-known maps, one from permutations to triangulations, and another from permutations to subsets. Furthermore we give a broad generalization of the maps. Specifically, for any lattice congruence of the weak order on a Coxeter group we construct a complete fan of convex cones with strong properties relative to the corresponding lattice quotient of the weak order. We show that if a family of lattice congruences on the symmetric groups satisfies certain compatibility conditions then the family defines a sub Hopf algebra of the Malvenuto–Reutenauer Hopf algebra of permutations. Such a sub Hopf algebra has a basis which is described by a type of pattern avoidance. Applying these results, we build the Malvenuto–Reutenauer algebra as the limit of an infinite sequence of smaller algebras, where the second algebra in the sequence is the Hopf algebra of non-commutative symmetric functions. We also associate both a fan and a Hopf algebra to a set of permutations which appears to be equinumerous with the Baxter permutations.     

The Flagged Double Schur Function

The double Schur function is a natural generalization of the factorial Schur function introduced by Biedenharn and Louck. It also arises as the symmetric double Schubert polynomial corresponding to a class of permutations called Grassmannian permutations introduced by A. Lascoux. We present a lattice path interpretation of the double Schur function based on a flagged determinantal definition, which readily leads to a tableau interpretation similar to the original tableau definition of the factorial Schur function. The main result of this paper is a combinatorial treatment of the flagged double Schur function in terms of the lattice path interpretations of divided difference operators. Finally, we find lattice path representations of formulas for the symplectic and orthogonal characters for sp(2n) and so(2n + 1) based on the tableau representations due to King and El-Shakaway, and Sundaram. Based on the lattice path interpretations, we obtain flagged determinantal formulas for these characters.     

Lattice polytopes,Hecke operators,and the Ehrhart polynomial

Let P be a simple lattice polytope. We define an action of the Hecke operators on E(P), the Ehrhart polynomial of P, and describe their effect on the coefficients of E(P). We also describe how the Brion–Vergne formula for E(P) transforms under the Hecke operators for nonsingular lattice polytopes P.      

Chain and distributive coalgebras

We show that coalgebras whose lattice of right coideals is distributive are coproducts of coalgebras whose lattice of right coideals is a chain. Those chain coalgebras are characterized as finite duals of Noetherian chain rings whose residue field is a finite dimensional division algebra over the base field. They also turn out to be coreflexive. Infinite dimensional chain coalgebras are finite duals of left Noetherian chain domains. Given any finite dimensional division algebra D and D-bimodule structure on D, we construct a chain coalgebra as a cotensor coalgebra. Moreover if D is separable over the base field, every chain coalgebra of type D can be embedded in such a cotensor coalgebra. As a consequence, cotensor coalgebras arising in this way are the only infinite dimensional chain coalgebras over perfect fields. Finite duals of power series rings with coeficients in a finite dimensional division algebra D are further examples of chain coalgebras, which also can be seen as tensor products of D^∗, and the divided power coalgebra and can be realized as the generalized path coalgebra of a loop. If D is central, any chain coalgebra is a subcoalgebra of the finite dual of D[[x]].     

On the predecessor relation in abstract algebras

In this paper we generalize the Dedekind theory of order for the natural numbers N to abstract algebras with arbitrarily many finitary or infinitary operations. For any algebra ??, we introduce an algebraic predecessor relation P?? and its transitive hull P*?? coinciding in N with the unary injective successor function' resp. the >-relation. For some important classes of algebras ??, including Peano algebras (absolutely free algebras, word algebras), the algebraic predecessor relation is well-founded. Hence, its transitive hull, the natural ordering >?? of ??, is a well-founded partial order, which turns out to be a convenient device for classifying Peano algebras with respect to the number of operations and their arities. Moreover, the property of well-foundedness is an efficient tool for giving simple proofs of structure theorems as, e. g., that the class of all Peano algebras is closed under subalgebras and non-void direct products. - Finally, we will show how in the case of a formal language ??, i. e., the Peano algebra ?? of expressions (= terms & formulas), relations P??, resp. P*_?? can be used to define basic syntactical notions as occurences of free and bound variables etc. without any reference to a particular representation (“coding”) of the formal language. MSC: 03B22, 03E30, 03E75, 03F35, 08A55, 08B20.     

The PBW filtration and convex polytopes in type B

We study the PBW filtration on irreducible finite-dimensional representations for the Lie algebra of type ${\mathtt{B}}_n$. We prove in various cases, including all multiples of the adjoint representation and all irreducible finite-dimensional representations for ${\mathtt{B}}_3$, that there exists a normal polytope such that the lattice points of this polytope parametrize a basis of the corresponding associated graded space. As a consequence we obtain several classes of examples for favourable modules and graded combinatorial character formulas.