18 citations · 18 across the 2 of their papers we have counts for
2 papers
math.CO2009
Non-representability of finite projective planes by convex sets
Martin Tancer
We prove that there is no d such that all finite projective planes can be represented by convex sets in R^d, answering a question of Alon, Kalai, Matousek, and Meshulam. Here, if P…
cs.CG2008★ 18 cited
Hardness of embedding simplicial complexes in
Jiří Matoušek, Martin Tancer, Uli Wagner
Let EMBED(k,d) be the following algorithmic problem: Given a finite simplicial complex K of dimension at most k, does there exist a (piecewise linear) embedding of K into R^d? Know…