English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

For a positive integer n and a subset S of [n-1], the descent polytope DP_Sis the set of points x_1, ..., x_n in the n-dimensional unit cube [0,1]^n suchthat x_i >= x_{i+1} for i in S and x_i <= x_{i+1} otherwise. First, we expressthe f-vector of DP_S as a sum over all subsets of [n-1]. Second, we use certainfactorizations of the associated word over a two-letter alphabet to describethe f-vector. We show that the f-vector is maximized when the set S is thealternating set {1,3,5, ...}. We derive a generating function for thef-polynomial F_S(t) of DP_S, written as a formal power series in twonon-commuting variables with coefficients in Z[t]. We also obtain thegenerating function for the Ehrhart polynomials of the descent polytopes.

The f-vector of the descent polytope