科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let (W, Sigma) be a finite Coxeter system, and theta an involution such that theta(Delta) = Delta, where Delta is a basis for the root system Phi associated with W, and I-theta = {w is an element of W vertical bar theta(w) = w(-1)} the set of theta-twisted involutions in W. The elements of I-theta can be characterized by sequences in Sigma which induce an ordering called the Richardson-Spinger Bruhat poset. The main algorithm of this paper computes this poset. Algorithms for finding conjugacy classes, the closure of an element and special cases are also given. A basic analysis of the complexity of the main algorithm and its variations is discussed, as well experience with implementation.
- 出版日期2012-6
