TY - JOUR
T1 - The f-Vector of the Descent Polytope
AU - Chebikin, Denis
AU - Ehrenborg, Richard
PY - 2011/4
Y1 - 2011/4
N2 - For a positive integer n and a subset S⊆[n-1], the descent polytope DP S is the set of points (x1,...,xn) in the n-dimensional unit cube [0,1]n such that xi≥xi+1 if i∈S and xi≤xi+1 otherwise. First, we express the f-vector as a sum over all subsets of [n-1]. Second, we use certain factorizations of the associated word over a two-letter alphabet to describe the f-vector. We show that the f-vector is maximized when the set S is the alternating set {1,3,5,...}∩[n-1]. We derive a generating function for FS(t), written as a formal power series in two non-commuting variables with coefficients in ℤ[t]. We also obtain the generating function for the Ehrhart polynomials of the descent polytopes.
AB - For a positive integer n and a subset S⊆[n-1], the descent polytope DP S is the set of points (x1,...,xn) in the n-dimensional unit cube [0,1]n such that xi≥xi+1 if i∈S and xi≤xi+1 otherwise. First, we express the f-vector as a sum over all subsets of [n-1]. Second, we use certain factorizations of the associated word over a two-letter alphabet to describe the f-vector. We show that the f-vector is maximized when the set S is the alternating set {1,3,5,...}∩[n-1]. We derive a generating function for FS(t), written as a formal power series in two non-commuting variables with coefficients in ℤ[t]. We also obtain the generating function for the Ehrhart polynomials of the descent polytopes.
KW - Alternating set
KW - Descent set statistics
KW - Ehrhart polynomial
KW - Maximizing inequalities
KW - Non-commutative rational generating function
UR - https://www.scopus.com/pages/publications/79751530763
UR - https://www.scopus.com/pages/publications/79751530763#tab=citedBy
U2 - 10.1007/s00454-010-9316-6
DO - 10.1007/s00454-010-9316-6
M3 - Article
AN - SCOPUS:79751530763
SN - 0179-5376
VL - 45
SP - 410
EP - 424
JO - Discrete and Computational Geometry
JF - Discrete and Computational Geometry
IS - 3
ER -