Is there a polynomial-time algorithm to sample uniformly from closed 3-manifold triangulations with N tetrahedra, including when restricted to 3-spheres?
Statement
Is there a polynomial-time algorithm to sample uniformly from closed 3-manifold triangulations with N tetrahedra, including when restricted to 3-spheres? How do the homotopy groups of clique complexes of exchangeable random graphs behave, and are these random objects universal in any respect?
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.