Projective equivalences of \(k\)-neighbourly polytopes
From MaRDI portal
Publication:497336
DOI10.1007/s00373-014-1474-5zbMath1327.52015arXiv1303.3675OpenAlexW2166414793MaRDI QIDQ497336
David G. Larman, Natalia Garcia-Colin
Publication date: 24 September 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.3675
(n)-dimensional polytopes (52B11) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Oriented matroids in discrete geometry (52C40) Gale and other diagrams (52B35)
Related Items
A note on the Tolerant Tverberg Theorem, On the number of vertices of projective polytopes, New lower bounds for Tverberg partitions with tolerance in the plane, Extensions of the colorful Helly theorem for d-collapsible and d-Leray complexes, On \(k\)-neighborly reorientations of oriented matroids, Robust Tverberg and Colourful Carathéodory Results via Random Choice, Algorithms for Radon partitions with tolerance
Cites Work
- Unnamed Item
- Unnamed Item
- Shortest paths in Sierpiński graphs
- Unions of oriented matroids
- A problem of McMullen on the projective equivalences of polytopes
- Simplicial cells in arrangements and mutations of oriented matroids
- Hamilton Paths in Tournaments and a Problem of McMullen on Projective Transformations in R d
- Lectures on Polytopes
- A Generalization of Radon's Theorem
- On Sets Projectively Equivalent to the Vertices of a Convex Polytope