The feasible region for consecutive patterns of permutations is a cycle polytope (Q5919059)

A polytope is a generalization in any number of dimensions of the three-dimensional polyhedron. The authors ``study proportions of consecutive occurrences of permutations of a given size. Specifically, the limit of such proportions on large permutations forms a region, called feasible region''. As the main result the authors ``show that this feasible region is a polytope, more precisely the cycle polytope of a specific graph called overlap graph''. The dimension, vertices and faces of this cyclic polytope are computed, and the equation defining it is also given. Finally they ``prove that the limit of classical occurrences and consecutive occurrences are in some sense independent''.