2 problems
Let be partitions, and let denote the corresponding character. Suppose … and that and belong to the minimal a…
Let be any positive integer and let be an alcove in the hypersimplex . Let be the breadth-first search order of root…
Let be partitions, and let denote the corresponding character. Suppose … and that and belong to the minimal a…
Let be any positive integer and let be an alcove in the hypersimplex . Let be the breadth-first search order of root…