Connectivity of the reduced bumpless pipe dream graph

From papers

For each nn, consider the set of reduced bumpless pipe dreams of size nn. A 2×22\times2 flip is a local replacement of a valid 2×22\times2 tile block by another valid tiling with the same boundary conditions. Only flips that preserve reducedness are allowed.

Connectivity conjecture. For every nn, the set of reduced bumpless pipe dreams of size nn is connected under the 2×22\times2 flips that preserve reducedness.

The unrestricted flips connect the full ASM lattice, but reducedness may obstruct this property and causes the standard monotone coupling approach to fail. Establishing connectivity would justify using these local moves on the reduced state space, although the paper does not resolve the conjecture.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

David Anderson, Greta Panova and Leonid Petrov, “Computation and sampling for Schubert specializations”, arXiv:2603.20104 (2026).

Solutions 0

No solutions have been posted yet.