Consider a real \(n\)-dimensional vector space with a fixed basis. Let \(x=(x_1, \ldots, x_{n+1})\) be an arbitrary point of this space. The permutohedron \(P_n(x_1, \ldots, x_{n+1})\) is the convex polytope defined as the convex hull of the points whose coordinates are obtain from the coordinates of \(x\) by permutations. Permutahedra appear in representation theory as weight polytopes of irreducible representations of \(GL_n\) and in geometry as moment polytopes.
The volume and the number of lattice points of a permutohedron \(P_n\) are given by certain multivariate polynomials that have remarkable combinatorial properties. The author introduces several different formulae for these polynomials. Additionally he studies a more general class of polytopes that includes the permutohedron, the associahedron, the cyclohedron, the Stanley-Pitman polytope, and various generalized associahedra related to wonderful compactifications of De Concini-Procesi. These polytopes are constructed as Minkowsky sums of simplices. The paper contains a calculation of their volumes and a description of their combinatorial structure. The coefficients of monomials in \(Vol P_n\) are certain positive integers, which are called the mixed Eulerian numbers. These numbers are equal to the mixed volumes of hypersimplices. Various specializations of these numbers give the usual Eulerian numbers, the Catalan numbers, the numbers of trees (i.e. \((n+1)^{n-1}\)), the binomial coefficients, etc. The author calculates the mixed Eulerian numbers using binary trees. Many results are extended to an arbitrary Weyl group.