A Brief Survey on Lattice Zonotopes

Zonotopes are a rich and fascinating family of polytopes, with connections to many areas of mathematics. In this article we provide a brief survey of classical and recent results related to lattice zonotopes. Our emphasis is on connections to combinatorics, both in the sense of enumeration (e.g. Ehrhart theory) and combinatorial structures (e.g. graphs and permutations)

Weighted quasisymmetric enumerator for generalized permutohedra

We introduce a weighted quasisymmetric enumerator function associated to generalized permutohedra. It refines the Billera, Jia and Reiner quasisymmetric function which also includes the Stanley chromatic symmetric function. Beside that it carries information of face numbers of generalized permutohedra. We consider more systematically the cases of nestohedra and matroid base polytopes

Convex Polytopes and Enumeration

AbstractThis is an expository paper on connections between enumerative combinatorics and convex polytopes. It aims to give an essentially self-contained overview of five specific instances when enumerative combinatorics and convex polytopes arise jointly in problems whose initial formulation lies in only one of these two subjects. These examples constitute only a sample of such instances occurring in the work of several authors. On the enumerative side, they involved ordered graphical sequences, combinatorial statistics on the symmetric and hyperoctahedral groups, lattice paths, Baxter, André, and simsun permutations,q-Catalan andq-Schröder numbers. From the subject of polytopes, the examples involve the Ehrhart polynomial, the permutohedron, the associahedron, polytopes arising as intersections of cubes and simplices with half-spaces, and thecd-index of a polytope

Brick polytopes, lattice quotients, and Hopf algebras

This paper is motivated by the interplay between the Tamari lattice, J.-L. Loday's realization of the associahedron, and J.-L. Loday and M. Ronco's Hopf algebra on binary trees. We show that these constructions extend in the world of acyclic $k$-triangulations, which were already considered as the vertices of V. Pilaud and F. Santos' brick polytopes. We describe combinatorially a natural surjection from the permutations to the acyclic $k$-triangulations. We show that the fibers of this surjection are the classes of the congruence $\equiv^k$ on $\mathfrak{S}_n$ defined as the transitive closure of the rewriting rule $U ac V_1 b_1 \cdots V_k b_k W \equiv^k U ca V_1 b_1 \cdots V_k b_k W$ for letters $a < b_1, \dots, b_k < c$ and words $U, V_1, \dots, V_k, W$ on $[n]$. We then show that the increasing flip order on $k$-triangulations is the lattice quotient of the weak order by this congruence. Moreover, we use this surjection to define a Hopf subalgebra of C. Malvenuto and C. Reutenauer's Hopf algebra on permutations, indexed by acyclic $k$-triangulations, and to describe the product and coproduct in this algebra and its dual in term of combinatorial operations on acyclic $k$-triangulations. Finally, we extend our results in three directions, describing a Cambrian, a tuple, and a Schr\"oder version of these constructions.Comment: 59 pages, 32 figure

On positivity of Ehrhart polynomials

Ehrhart discovered that the function that counts the number of lattice points in dilations of an integral polytope is a polynomial. We call the coefficients of this polynomial Ehrhart coefficients, and say a polytope is Ehrhart positive if all Ehrhart coefficients are positive (which is not true for all integral polytopes). The main purpose of this article is to survey interesting families of polytopes that are known to be Ehrhart positive and discuss the reasons from which their Ehrhart positivity follows. We also include examples of polytopes that have negative Ehrhart coefficients and polytopes that are conjectured to be Ehrhart positive, as well as pose a few relevant questions.Comment: 40 pages, 7 figures. To appear in in Recent Trends in Algebraic Combinatorics, a volume of the Association for Women in Mathematics Series, Springer International Publishin