ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Edge-flip chain on dyadic tilings and rectangular dissections (Sarah Cannon)

Consider rectangular dissections of an n×nn\times n lattice into nn rectangles of area nn, where n=2kn=2^k. 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 λ>0\lambda>0 is fixed, and the weight of a dissection is given by

π(σ)=λ∣σ∣Z,\pi(\sigma)=\frac{\lambda^{|\sigma |}}{Z} ,

where ∣σ∣|\sigma| is the total edge-length. The chains (in the dyadic and general cases) then correspond to the Glauber dynamics.

For λ=1\lambda=1, 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

Added
Links

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.