Five additional affine unimodular equivalences
The 28 classes reported in BLMM, Proposition 4.8 and Table 6, reduce to 23 after these five additional identifications. S1, …, S31 below are the labels of that table.
Coordinate convention: y = Ax + b in unshifted, ten-dimensional string coordinates from the original notebook. The coordinates x₁, …, x₁₀ and y₁, …, y₁₀ follow the source and target reduced words shown below. These are not the centered cluster coordinates in the seed browser, nor the raw 14-dimensional coordinates in the BLMM data export.
The maps were verified on complete vertex sets at ρ. At 2ρ, A is unchanged and b is doubled. The weight selector changes only this reference page; the seed browser uses 2ρ.
BLMM published chapter · arXiv Table 6 · Download A and b (JSON) · All 31 BLMM labels ↓
S2 → S19
det(A) = -1 · 379 vertices mapped exactly
Source word: [1, 2, 1, 3, 2, 4, 3, 2, 1, 2]
Target word: [2, 1, 2, 3, 2, 4, 3, 2, 1, 2]
b = [0, 2, 1, 0, 0, 0, 0, 0, 0, 0]
b = [0, 4, 2, 0, 0, 0, 0, 0, 0, 0]
Full integer matrix A (the same at both weights)
| 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | -1 | 0 | 1 | -1 | 0 | 1 | -1 | -1 | -1 |
| 0 | -1 | 1 | 1 | -2 | 0 | 1 | -2 | 1 | -2 |
| 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
S3 → S20
det(A) = 1 · 360 vertices mapped exactly
Source word: [1, 2, 1, 3, 4, 3, 2, 3, 1, 2]
Target word: [2, 1, 2, 3, 4, 3, 2, 1, 3, 2]
b = [0, 2, 1, 0, 0, 0, 0, 0, 0, 0]
b = [0, 4, 2, 0, 0, 0, 0, 0, 0, 0]
Full integer matrix A (the same at both weights)
| 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | -1 | 0 | 1 | 0 | 1 | -1 | 1 | -1 | -1 |
| 0 | -1 | 1 | 1 | 0 | 1 | -2 | 1 | 1 | -2 |
| 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
S4 → S17
det(A) = 1 · 334 vertices mapped exactly
Source word: [1, 2, 1, 4, 3, 2, 1, 4, 3, 2]
Target word: [1, 3, 4, 3, 2, 3, 1, 2, 4, 3]
b = [1, 1, 2, 1, 0, 0, 0, 0, 0, 0]
b = [2, 2, 4, 2, 0, 0, 0, 0, 0, 0]
Full integer matrix A (the same at both weights)
| 0 | 0 | 0 | -1 | 1 | 0 | 0 | -2 | 1 | 0 |
| -1 | 1 | -2 | 0 | 0 | 1 | -2 | 0 | 0 | 1 |
| 0 | -1 | 0 | 0 | 1 | -1 | -1 | 0 | 1 | -1 |
| 0 | -1 | 1 | 0 | 1 | -2 | 1 | 0 | 1 | -2 |
| 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
S5 → S31
det(A) = -1 · 368 vertices mapped exactly
Source word: [1, 2, 3, 2, 1, 2, 4, 3, 2, 1]
Target word: [2, 3, 4, 3, 2, 1, 3, 2, 3, 4]
b = [0, 0, 0, 0, 0, 4, 0, 3, 2, 1]
b = [0, 0, 0, 0, 0, 8, 0, 6, 4, 2]
Full integer matrix A (the same at both weights)
| 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | -1 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | -1 | 0 | 0 | 1 |
| 0 | 0 | 0 | 0 | 0 | 0 | -1 | 0 | 1 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | -1 | 1 | 0 | 0 |
S27 → S28
det(A) = -1 · 379 vertices mapped exactly
Source word: [2, 3, 2, 1, 2, 4, 3, 2, 1, 4]
Target word: [2, 3, 2, 1, 4, 3, 2, 1, 3, 4]
b = [0, 2, 1, 0, 0, 0, 0, 0, 0, 0]
b = [0, 4, 2, 0, 0, 0, 0, 0, 0, 0]
Full integer matrix A (the same at both weights)
| 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | -1 | 0 | 1 | -1 | 1 | -1 | -1 | 1 | 1 |
| 0 | -1 | 1 | 0 | 1 | 1 | -2 | 1 | 0 | 1 |
| 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 |
BLMM Table 6 labels and verified matches
Labels in the third column belong to the same affine unimodular class at ρ and 2ρ. Each sequence opens a cluster polytope equivalent to that string polytope at 2ρ when entered in the seed browser with n = 5. This is a polytope equivalence, not an assertion that the seed itself comes from the displayed reduced word.
| BLMM label | Reduced word | Equivalent BLMM labels | Cluster mutation sequence | Additional map |
|---|---|---|---|---|
| S1 | [1, 2, 1, 3, 2, 1, 4, 3, 2, 1] | S1, S18, S26, S29 | [] | — |
| S2 | [1, 2, 1, 3, 2, 4, 3, 2, 1, 2] | S2, S19 | [4] | View S2 → S19 |
| S3 | [1, 2, 1, 3, 4, 3, 2, 3, 1, 2] | S3, S20 | [4, 5] | View S3 → S20 |
| S4 | [1, 2, 1, 4, 3, 2, 1, 4, 3, 2] | S4, S17 | [4, 5, 6] | View S4 → S17 |
| S5 | [1, 2, 3, 2, 1, 2, 4, 3, 2, 1] | S5, S31 | [2] | View S5 → S31 |
| S6 | [1, 2, 3, 2, 1, 4, 3, 2, 1, 3] | S6 | [2, 5] | — |
| S7 | [1, 2, 3, 2, 4, 3, 2, 1, 2, 3] | S7 | [2, 4, 5] | — |
| S8 | [1, 2, 3, 4, 3, 2, 1, 2, 3, 2] | S8 | [4, 2, 5] | — |
| S9 | [1, 2, 3, 4, 3, 2, 1, 3, 2, 3] | S9 | [2, 4, 5, 2] | — |
| S10 | [1, 2, 4, 3, 2, 1, 2, 4, 3, 2] | S10 | [4, 2, 5, 6] | — |
| S11 | [1, 2, 4, 3, 2, 1, 4, 3, 2, 3] | S11 | [2, 4, 5, 2, 6] | — |
| S12 | [1, 3, 2, 1, 3, 2, 4, 3, 2, 1] | S12 | [2, 3] | — |
| S13 | [1, 3, 2, 1, 3, 4, 3, 2, 3, 1] | S13 | [2, 3, 5] | — |
| S14 | [1, 3, 2, 1, 4, 3, 2, 1, 4, 3] | S14 | [2, 3, 5, 6] | — |
| S15 | [1, 3, 2, 3, 4, 3, 2, 1, 2, 3] | S15 | [2, 3, 4, 5] | — |
| S16 | [1, 3, 2, 4, 3, 2, 1, 2, 4, 3] | S16 | [1, 4, 5, 3, 6] | — |
| S17 | [1, 3, 4, 3, 2, 3, 1, 2, 4, 3] | S4, S17 | [4, 5, 6] | View S4 → S17 |
| S18 | [2, 1, 2, 3, 2, 1, 4, 3, 2, 1] | S1, S18, S26, S29 | [] | — |
| S19 | [2, 1, 2, 3, 2, 4, 3, 2, 1, 2] | S2, S19 | [4] | View S2 → S19 |
| S20 | [2, 1, 2, 3, 4, 3, 2, 1, 3, 2] | S3, S20 | [4, 5] | View S3 → S20 |
| S21 | [2, 1, 3, 2, 1, 3, 4, 3, 2, 1] | S21 | [1, 2] | — |
| S22 | [2, 1, 3, 2, 1, 4, 3, 2, 1, 4] | S22 | [1, 2, 4] | — |
| S23 | [2, 1, 3, 2, 3, 4, 3, 2, 1, 2] | S23 | [1, 2, 6] | — |
| S24 | [2, 1, 3, 2, 4, 3, 2, 1, 2, 4] | S24 | [1, 2, 4, 6] | — |
| S25 | [2, 1, 3, 4, 3, 2, 1, 3, 2, 4] | S25 | [1, 2, 4, 6, 5] | — |
| S26 | [2, 3, 2, 1, 2, 3, 4, 3, 2, 1] | S1, S18, S26, S29 | [] | — |
| S27 | [2, 3, 2, 1, 2, 4, 3, 2, 1, 4] | S27, S28 | [1, 2, 3, 4] | View S27 → S28 |
| S28 | [2, 3, 2, 1, 4, 3, 2, 1, 3, 4] | S27, S28 | [1, 2, 3, 4] | View S27 → S28 |
| S29 | [2, 3, 2, 4, 3, 2, 1, 2, 3, 4] | S1, S18, S26, S29 | [] | — |
| S30 | [2, 3, 4, 3, 2, 1, 2, 3, 2, 4] | S30 | [2, 1, 3, 5] | — |
| S31 | [2, 3, 4, 3, 2, 1, 3, 2, 3, 4] | S5, S31 | [2] | View S5 → S31 |
References
- [BLMM]Lara Bossinger, Sara Lamboglia, Kalina Mincheva and Fatemeh Mohammadi, Computing Toric Degenerations of Flag Varieties, in Combinatorial Algebraic Geometry, Gregory G. Smith and Bernd Sturmfels (eds.), Fields Institute Communications 80, Springer (2017), 247–281.