6 problems
- 0 votes0 replies0 views
Bumpless pipe dream transition compatibility
Let be a -row reduced bumpless pipe dream such that row has no blanks (“weighty tiles”). Let be the RC graph corresponding to under the natural bijection b…
- 0 votes0 replies0 views
Bumpless pipe dream realization of the RC-graph transition algorithm
Bumpless pipe dreams are related to RC graphs by a bijection: for a bumpless pipe dream with rows, let denote the corresponding RC graph, and let be…
- 0 votes0 replies1 view
The RBPD limit-shape and arctic-curve conjecture
RBPD limit-shape and arctic-curve conjecture. As , the height function converges to a deterministic limit shape consisting of four frozen regions adjacent to the domain…
- 0 votes0 replies0 views
Connectivity of the reduced bumpless pipe dream graph
Connectivity conjecture. For every , the set of reduced bumpless pipe dreams of size is connected under the flips that preserve reducedness.
- 0 votes0 replies1 view
Up-elbow bound conjecture for bumpless pipe dreams
Let be a permutation, and let . If is non-reduced, replace the redundant crossings with bump tiles. Up-elbow bound conjecture. Pipe…
- 0 votes0 replies0 views
Mészáros–Setiabrata–St. Dizier conjecture on Grothendieck polynomial support
Let be the symmetric group, let , and let be a monomial with nonzero coefficient and non-maximal degree in the Grothendiec…