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

zbMath1447.05001arXiv2003.12661MaRDI QIDQ5918948

Raul Penaguiao, Jacopo Borga

Publication date: 14 September 2020

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.12661

zbMATH Keywords

permutation patternsoverlap graphscycle polytopes

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Permutations, words, matrices (05A05)

Cites Work

• Unnamed Item
• Densities in large permutations and parameter testing
• A decorated tree approach to random permutations in substitution-closed classes
• Kostant partitions functions and flow polytopes
• Universal cycles for permutations
• Universal cycles for combinatorial structures
• The traveling salesman problem and its variations
• The Brownian limit of separable permutations
• Enumerating cycles in the graph of overlapping permutations
• On shortening \(u\)-cycles and \(u\)-words for permutations
• Limits of permutation sequences
• Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)
• On the cycle polytope of a directed graph and its relaxations
• The Circuit Polytope: Facets
• Circuit bases of strongly connected digraphs
• Permutations with fixed pattern densities
• On cycle cones and polyhedra

This page was built for publication: The feasible region for consecutive patterns of permutations is a cycle polytope