ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XX be a kk-dimensional simplicial complex with NN simplices, and suppose that each vertex lies in at most LL simplices. Let n≥2k+1n\ge 2k+1. An embedding is 1-thick if the distance between the images of any two non-adjacent simplices is at least 11. Higher-dimensional Kolmogorov-Barzdin conjecture. There is a 1-thick embedding of XX into the nn-dimensional ball of radius

R≤C(n,L)N1n−k.R\le C(n,L)N^{\frac{1}{n-k}}.

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 NϵN^{\epsilon} and proves near-sharpness up to such factors, so the conjectured removal of the NϵN^{\epsilon} 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.