Tverberg's theorem via number fields

From MaRDI portal
Publication:1802769

DOI10.1007/BF02808223zbMath0786.52005OpenAlexW2004331157MaRDI QIDQ1802769

Karanbir Singh Sarkaria

Publication date: 29 June 1993

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02808223




Related Items (30)

Tolerance for colorful Tverberg partitionsA colorful theorem on transversal lines to plane convex setsAn elementary proof of Tverberg's theoremCarathéodory, Helly and the others in the max-plus worldVery colorful theoremsHelge Tverberg is eighty: a personal tributeQuantitative Tverberg theorems over lattices and other discrete setsTverberg numbers for cellular bipartite graphsA generalisation of Tverberg's theoremExtensions of the colorful Helly theorem for d-collapsible and d-Leray complexesOn maximum volume simplices in polytopesThe intersection of a matroid and an oriented matroidA geometric proof of the colored Tverberg theoremRobust Tverberg and Colourful Carathéodory Results via Random ChoiceSome variations on Tverberg's theoremColourful linear programmingTverberg plus minusComputational aspects of the colorful Carathéodory theoremQuantitative combinatorial geometry for continuous parametersEqual coefficients and tolerance in coloured Tverberg partitionsA topological colorful Helly theoremPartitions of points into simplices with \(k\)-dimensional intersection. I: The conic Tverberg's theoremNotes about the Carathéodory numberRadon numbers and the fractional Helly theoremA user's guide to the topological Tverberg conjectureTverberg’s theorem is 50 years old: A surveyThe discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and TverbergALGORITHMS FOR TOLERANT TVERBERG PARTITIONSNo-dimensional Tverberg theorems and algorithmsHelly-type problems



Cites Work


This page was built for publication: Tverberg's theorem via number fields