Kolmogorov-Barzdin embedding conjecture for higher-dimensional simplicial complexes
Statement
Let be a -dimensional simplicial complex with simplices, and suppose that each vertex lies in at most simplices. Let . An embedding is 1-thick if the distance between the images of any two non-adjacent simplices is at least . Higher-dimensional Kolmogorov-Barzdin conjecture. There is a 1-thick embedding of into the -dimensional ball of radius
This conjecture seeks the sharp higher-dimensional analogue of the Kolmogorov-Barzdin estimates for thick embeddings of graphs. The paper establishes an upper bound with an additional factor of and proves near-sharpness up to such factors, so the conjectured removal of the loss remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.