q-RSK Sampling of Domino Tilings of the Aztec Diamond
domino-tilings
Leonid Petrov
Simulation Info
q-RSK Sampling of Domino Tilings of the Aztec Diamond
domino-tilings
Leonid Petrov
Interactive simulation of Aztec diamond domino tilings sampled via the q-deformed Robinson-Schensted-Knuth correspondence. Adjust diamond size n, q-Whittaker parameter q, and Schur specializations x,y. View modes include dominoes, dimer, double dimer loops, height fluctuations, and 3D stepped surface.
About the Simulation
q-RSK Sampling generates random domino tilings of the Aztec diamond using the q-deformed Robinson-Schensted-Knuth correspondence. At q=0, this gives uniform tilings; as q approaches 1, tilings concentrate near "frozen" configurations.
Phases: 0: Initial partitions | 1: Form dimers (λ-κ blue, κ-μ orange) | 2: Identify blocks (B markers) | 3: Slide dimers → AFTER | 4: Final result with Δ indicators
Current Aztec Diamond
After completing each anti-diagonal, the corresponding Aztec diamond is shown
Classical Domino Shuffling Algorithm (EKLP 1992)
Setup: The Aztec diamond $\mathcal{A}_n$ of order $n$ consists of all unit squares $[i, i+1] \times [j, j+1]$ with $|i| + |j| < n$. It contains $2n(n+1)$ unit squares and is tiled by $n(n+1)$ dominoes.
Domino Types: Each domino is classified by orientation and parity:
North (N): vertical domino with black square on top
South (S): vertical domino with white square on top
East (E): horizontal domino with black square on right
West (W): horizontal domino with white square on right
The Shuffling Map $\mathcal{A}_n \to \mathcal{A}_{n+1}$:
Deletion: Find all $2 \times 2$ blocks containing exactly two dominoes that form either:
Two horizontal dominoes stacked (one N, one S), or
Two vertical dominoes side-by-side (one E, one W)
These are called bad blocks. Delete all dominoes in bad blocks.
Sliding: Each remaining domino slides outward by one unit in its natural direction:
$$\begin{aligned}
\text{N dominoes} &\to \text{slide up (} +y \text{)} \\
\text{S dominoes} &\to \text{slide down (} -y \text{)} \\
\text{E dominoes} &\to \text{slide right (} +x \text{)} \\
\text{W dominoes} &\to \text{slide left (} -x \text{)}
\end{aligned}$$
Creation: After sliding, empty $2 \times 2$ blocks appear. Each block is filled with exactly one of two choices:
Two horizontal dominoes (N on top, S on bottom), or
Two vertical dominoes (W on left, E on right)
For uniform random tilings, each choice is made independently with probability $\tfrac{1}{2}$.
Key Properties:
The map is a $2^{n+1}$-to-1 correspondence from tilings of $\mathcal{A}_{n+1}$ to tilings of $\mathcal{A}_n$
Uniform measure on $\mathcal{A}_n$ lifts to uniform measure on $\mathcal{A}_{n+1}$
Starting from the unique tiling of $\mathcal{A}_0$ and shuffling $n$ times samples uniformly from $\mathcal{A}_n$
Key Insight: The q-deformation modifies only Step 3 (Creation). Steps 1 and 2 remain unchanged.
In the classical case, block-filling is deterministic: geometric constraints force a unique cascade. In the q-Whittaker case, particles have probabilistic "stickiness"—even when a particle could move, it might stay with probability depending on $q$.
Step 3': q-Weighted Creation
Empty 2×2 blocks form islands—consecutive positions where new dominoes must be placed. For each island $[k, m]$:
(note: parameters in the code might differ from the ones in
simulation results below)
Link to code
(This simulation is interactive, written in JavaScript)
Link to code
(C++ source code (compiled to WebAssembly))
Dear colleagues:
Feel free to use code (unless otherwise specified next to the corresponding link),
data, and visualizations to illustrate your research in talks and papers,
with attribution (CC BY-SA 4.0 (opens in new tab)).
Some images are available in very high resolution upon request.
I can also produce other simulations upon request - email me at lenia.petrov@gmail.com
This material is based upon work supported by the National Science Foundation under Grant DMS-2153869