Let be the graph on the roots of the root system, where any two distinct vertices and are connected by an edge with color equal to the inner product of and . For any set of colors, let be the subgraph of consisting of all the vertices, and all the edges whose color lies in . We consider cliques, i.e., complete subgraphs, of that are either monochromatic, or of size at most , or a maximal clique in for some color set , or whose vertices are the vertices of a face of the root polytope. We prove that, apart from two exceptions, two such cliques are conjugate under the automorphism group of if and only if they are isomorphic as colored graphs. Moreover, for an isomorphism from one such clique to another, we give necessary and sufficient conditions for to extend to an automorphism of , in terms of the restrictions of to certain special subgraphs of of size at most 7.

生成讲解博客的中文版本

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