The feasible region for consecutive patterns of permutations is a cycle polytope (Q5919059): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 02:56, 2 February 2024

scientific article; zbMATH DE number 7298401
Language Label Description Also known as
English
The feasible region for consecutive patterns of permutations is a cycle polytope
scientific article; zbMATH DE number 7298401

    Statements

    The feasible region for consecutive patterns of permutations is a cycle polytope (English)
    0 references
    0 references
    0 references
    19 January 2021
    0 references
    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''.
    0 references
    0 references
    permutation patterns
    0 references
    cycle polytopes
    0 references
    overlap graphs
    0 references

    Identifiers