A family of reductions for Schubert intersection problems (Q536568): Difference between revisions

The Schubert intersection problem is the problem of counting \(r\)-dimensional subspaces of \(\mathbb{C}^n\) having certain adjacency properties with given subspaces (flags) of \(\mathbb{C}^n\). In certain situations such a Schubert intersection problem can be reduced to another Schubert intersection problem with smaller \(n\). The paper under review extends an earlier such reduction result of Thompson-Therianos to a large family of reduction results. In fact, the reductions presented in this paper are sufficient for the complete solution of a special class of intersection problems, when the Littlewood-Richardson coefficient is 1. The reductions presented are in connection with known multiplicative properties of Littlewood-Richardson coefficients. The method of the proof is a very careful analysis of a combinatorial rule (involving `measures', similar to `puzzles') for Littlewood-Richardson coefficients.