Dyadic critical mixing solved and an exact general flip-graph reduction
Statement
Edge-flip chain on dyadic tilings and rectangular dissections (Sarah Cannon)
Consider rectangular dissections of an lattice into rectangles of area , where . The edge-flip chain proceeds by picking an edge bordering two rectangles and replacing it by its bisector. In the \emph{dyadic} case, the edge is flipped provided the resulting tiling remains dyadic. In the weighted setting, a parameter is fixed, and the weight of a dissection is given by
where is the total edge-length. The chains (in the dyadic and general cases) then correspond to the Glauber dynamics.
For , can we establish a polynomial upper-bound (fast-mixing) for the mixing time of the edge-flip chain on dyadic tilings or on rectangular dissections?
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.