Sweeps, polytopes, oriented matroids, and allowable graphs of permutations

DOI10.1007/s00493-023-00062-3arXiv2102.06134OpenAlexW3129190938MaRDI QIDQ6126414

Eva Philippe, Arnau Padrol

Publication date: 9 April 2024

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

polytopesoriented matroidsmonotone path polytopesgeneralized Baues problempermutahedraallowable sequences of permutationssweep algorithms

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial aspects of matroids and geometric lattices (05B35) Shellability for polytopes and polyhedra (52B22) Oriented matroids in discrete geometry (52C40) Lattices (06B99)

This page was built for publication: Sweeps, polytopes, oriented matroids, and allowable graphs of permutations