摘要 : Forx is an element of End(Kappa(n)) satisfyingx(2)= 0 let F(x)be the variety of full flags stable under the action ofx(Springer fiber overx). The full classification of the components of F(x)according to their smoothness was provi... 展开 Forx is an element of End(Kappa(n)) satisfyingx(2)= 0 let F(x)be the variety of full flags stable under the action ofx(Springer fiber overx). The full classification of the components of F(x)according to their smoothness was provided in [4] in terms of both Young tableaux and link patterns. Moreover in [2] the purely combinatorial algorithm to compute the singular locus of a singular component of F(x)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, giving all the components of the singular locus of a singular component F(sigma)of F(x)in terms of link patterns constructed straightforwardly from the link pattern of sigma. 收起