Corrected bounds and an exact critical-strip reduction for lattice triangulations
Statement
Edge-flip chain on triangulations
Consider the chain over triangulations of , in which, at each step, an edge is randomly chosen and, if it is the diagonal of convex quadrilateral, flipped to the opposite diagonal. Does this chain have polynomial mixing time?
Record
- Source
- Added
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.