3 problems

Let $\alpha$, $\beta$, and $\gamma$ be strings indexing Schubert classes in the two-step flag variety, and let $c^{\gamma}_{\alpha,\beta}$ denote the corresponding two-step Littlew…

Uniqueness conjecture. The 10 minimum universal sets are the only collections of 12 cubes that can build all 30 target cubes.

For an $m \times n$ Numbrix puzzle, call a set of clues defining exactly one puzzle a defining clue set, and let the minimum number of clues be the smallest size of such a set. Min…