For satisfying let be the variety of full flags stable under the action of (Springer fiber over ). The full classification of the components of according to their smoothness was provided in a paper of Fresse-Melnikov in terms of both Young tableaux and link patterns. Moreover in a paper of Fresse the purely combinatorial algorithm to compute the singular locus of a singular components of is provided. However this algorithm involves the computation of the graph of the component, and the complexity of computations grows very quickly, so that in practice it is impossible to use it. In this paper, we construct another algorithm, derived from the algorithm of Fresse, providing all the components of the singular locus of a singular component of in terms of link patterns constructed straightforwardly from its link pattern.

生成讲解博客的中文版本

生成AI智能校验的中文版本