On Sets Projectively Equivalent to the Vertices of a Convex Polytope
From MaRDI portal
Publication:5660801
DOI10.1112/blms/4.1.6zbMath0248.52010OpenAlexW2076053977MaRDI QIDQ5660801
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
Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx)
Related Items (21)
Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data ⋮ Generalised Helly and Radon numbers ⋮ Tolerance for colorful Tverberg partitions ⋮ Rich cells in an arrangement of hyperplanes ⋮ 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 ⋮ A generalisation of Tverberg's theorem ⋮ Extensions of the colorful Helly theorem for d-collapsible and d-Leray complexes ⋮ Tolerance in Helly-type theorems ⋮ On \(k\)-neighborly reorientations of oriented matroids ⋮ Robust Tverberg and Colourful Carathéodory Results via Random Choice ⋮ Projective equivalences of \(k\)-neighbourly polytopes ⋮ Equal coefficients and tolerance in coloured 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 ⋮ Tverberg’s theorem is 50 years old: A survey ⋮ ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS ⋮ A problem of McMullen on the projective equivalences of polytopes ⋮ Helly-type problems
This page was built for publication: On Sets Projectively Equivalent to the Vertices of a Convex Polytope
