For any finite-dimensional complex semisimple Lie algebra, two ellipsoids (primary and secondary) are considered. The equations of these ellipsoids are Diophantine equations, and the Weyl group acts on the sets of all...For any finite-dimensional complex semisimple Lie algebra, two ellipsoids (primary and secondary) are considered. The equations of these ellipsoids are Diophantine equations, and the Weyl group acts on the sets of all their Diophantine solutions. This provides two realizations (primary and secondary) of the Weyl group on the sets of Diophantine solutions of the equations of the ellipsoids. The primary realization of the Weyl group suggests an order on the Weyl group, which is stronger than the Chevalley-Bruhat ordering of the Weyl group, and which provides an algorithm for the Chevalley-Bruhat ordering. The secondary realization of the Weyl group provides an algorithm for constructing all reduced expressions for any of its elements, and thus provides another way for the Chevalley-Bruhat ordering of the Weyl group.展开更多
基金Supported by the PhD Programs Foundation of Ministry of Education of China(200803570003)Anhui Provincial Natural Science Foundation Grant(10040606Y33)+2 种基金Scientific Research Foundation for the PhDs of Anhui University(33190055)Academic Innovation Team of Anhui University(KJTD001B)Project of Anhui Province of Excellent Young Talents in University(2009SQRZ017ZD)
文摘For any finite-dimensional complex semisimple Lie algebra, two ellipsoids (primary and secondary) are considered. The equations of these ellipsoids are Diophantine equations, and the Weyl group acts on the sets of all their Diophantine solutions. This provides two realizations (primary and secondary) of the Weyl group on the sets of Diophantine solutions of the equations of the ellipsoids. The primary realization of the Weyl group suggests an order on the Weyl group, which is stronger than the Chevalley-Bruhat ordering of the Weyl group, and which provides an algorithm for the Chevalley-Bruhat ordering. The secondary realization of the Weyl group provides an algorithm for constructing all reduced expressions for any of its elements, and thus provides another way for the Chevalley-Bruhat ordering of the Weyl group.
