On Sets Projectively Equivalent to the Vertices of a Convex Polytope

DOI10.1112/blms/4.1.6zbMath0248.52010MaRDI QIDQ5660801

David G. Larman

Publication date: 1972

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/blms/4.1.6

Mathematics Subject Classification ID

52A40: Inequalities and extremum problems involving convexity in convex geometry

52Bxx: Polytopes and polyhedra

Related Items

Robust Tverberg and Colourful Carathéodory Results via Random Choice, Tverberg’s theorem is 50 years old: A survey, Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data, ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS, Algorithms for Radon partitions with tolerance, 10 points in dimension 4 not projectively equivalent to the vertices of a convex polytope, Lawrence oriented matroids and a problem of McMullen on projective equivalences of polytopes, Helly-type problems, On the number of vertices of projective polytopes, Extensions of the colorful Helly theorem for d-collapsible and d-Leray complexes, On \(k\)-neighborly reorientations of oriented matroids, A generalisation of Tverberg's theorem, Projective equivalences of \(k\)-neighbourly polytopes, Equal coefficients and tolerance in coloured Tverberg partitions, Tolerance in Helly-type theorems, A problem of McMullen on the projective equivalences of polytopes, Rich cells in an arrangement of hyperplanes, Tolerance for colorful Tverberg partitions, New lower bounds for Tverberg partitions with tolerance in the plane, A note on the Tolerant Tverberg Theorem, Generalised Helly and Radon numbers