Existence of short simple separating cycles in random high-genus triangulations
Statement
Fix and a sequence such that . Let be a uniform triangulation of genus with faces. A simple separating non-contractible cycle is a simple cycle that is separating and non-contractible. The short simple separating cycle conjecture. For every , there exists a constant such that, with high probability, contains a simple, non-contractible, separating cycle of length less than .
The theorem preceding this conjecture proves only logarithmic upper and lower bounds for the unrestricted separating systole. This conjecture would establish a logarithmically short simple separating cycle in the random model, despite the deterministic existence problem remaining 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.