On the Fully Commutative Elements of Coxeter Groups

Let W be a Coxeter group. We define an element w ε W to be fully commutative if any reduced expression for w can be obtained from any other by means of braid relations that only involve commuting generators. We give several combinatorial characterizations of this property, classify the Coxeter groups with finitely many fully commutative elements, and classify the parabolic quotients whose members are all fully commutative. As applications of the latter, we classify all parabolic quotients with the property that (1) the Bruhat ordering is a lattice, (2) the Bruhat ordering is a distributive lattice, (3) the weak ordering is a distributive lattice, and (4) the weak ordering and Bruhat ordering coincide. Partially supported by NSF Grants DMS-9057192 and DMS-9401575.     

Order Varieties and Monotone Retractions of Finite Posets

In this paper we introduce a new version of the concept of order varieties. Namely, in addition to closure under retracts and products we require that the class of posets should be closed under taking idempotent subalgebras. As an application we prove that the variety generated by an order-primal algebra on a finite connected poset P is congruence modular if and only if every idempotent subalgebra of P is connected. We give a polynomial time algorithm to decide whether or not a variety generated by an order-primal algebra admits a near unanimity function and so we answer a problem of Larose and Zádori.     

Coxeter群的半直积分解(英文)

本文证明了满足一定条件的Coxeter群都可以分解成两个Coxeter群的半直积.     

Homomorphisms of Edge-Colored Graphs and Coxeter Groups

Let be two edge-colored graphs (without multiple edges or loops). A homomorphism is a mapping : for which, for every pair of adjacent vertices u and v of G ₁, (u) and (v) are adjacent in G ₂ and the color of the edge (u)(v) is the same as that of the edge uv.We prove a number of results asserting the existence of a graphG , edge-colored from a set C, into which every member from a given class of graphs, also edge-colored from C, maps homomorphically.We apply one of these results to prove that every three-dimensional hyperbolic reflection group, having rotations of orders from the setM ={m₁, m₂,..., m_k}, has a torsion-free subgroup of index not exceeding some bound, which depends only on the setM .     

On Negative Orbits of Finite Coxeter Groups

For a Coxeter group W, X a subset of W and a positive root, we define the negative orbit of under X to be {w · | w X} ^–, where ^– is the set of negative roots. Here we investigate the sizes of such sets as varies in the case when W is a finite Coxeter group and X is a conjugacy class of W.     

The Enumeration of Fully Commutative Elements of Coxeter Groups

A Coxeter group element w is fully commutative if any reduced expression for w can be obtained from any other via the interchange of commuting generators. For example, in the symmetric group of degree n, the number of fully commutative elements is the nth Catalan number. The Coxeter groups with finitely many fully commutative elements can be arranged into seven infinite families A_n, B_n, D_n, E_n,F_n, H_n and I₂(m). For each family, we provide explicit generating functions for the number of fully commutative elements and the number of fully commutative involutions; in each case, the generating function is algebraic.     

The Greedy Algorithm and Coxeter Matroids

The notion of matroid has been generalized to Coxeter matroid by Gelfand and Serganova. To each pair (W, P) consisting of a finite irreducible Coxeter group W and parabolic subgroup P is associated a collection of objects called Coxeter matroids. The (ordinary) matroids are a special case, the case W = A (isomorphic to the symmetric group Sym_{_n+1}) and P a maximal parabolic subgroup. The main result of this paper is that for Coxeter matroids, just as for ordinary matroids, the greedy algorithm provides a solution to a naturally associated combinatorial optimization problem. Indeed, in many important cases, Coxeter matroids are characterized by this property. This result generalizes the classical Rado-Edmonds and Gale theorems.A corollary of our theorem is that, for Coxeter matroids L, the greedy algorithm solves the L-assignment problem. Let W be a finite group acting as linear transformations on a Euclidean space , and let

Rigidity of Coxeter Groups and Artin Groups

A Coxeter group is rigid if it cannot be defined by two nonisomorphic diagrams. There have been a number of recent results showing that various classes of Coxeter groups are rigid, and a particularly interesting example of a nonrigid Coxeter group has been given by Bernhard Mühlherr. We show that this example belongs to a general operation of diagram twisting. We show that the Coxeter groups defined by twisted diagrams are isomorphic, and, moreover, that the Artin groups they define are also isomorphic, thus answering a question posed by Charney. Finally, we show a number of Coxeter groups are reflection rigid once twisting is taken into account.     

关于群的阶与共轭类数

讨论群的共轭数与群阶的关系,获得两个新的数量不等式,同时改进了一些相关的已知结果。     

Spherical and geodesic growth rates of right-angled Coxeter and Artin groups are Perron numbers

We prove that for any infinite right-angled Coxeter or Artin group, its spherical and geodesic growth rates (with respect to the standard generating set) either take values in the set of Perron numbers, or equal 1. Also, we compute the average number of geodesics representing an element of given word-length in such groups.     

On Groups Generated by Elements of Pirme Order

In the first part of the paper we give a characterization of groups generated by elements of fixed prime order p. In the second part we study the group G _n ^(p) of n × n matrices with the pth power of the determinant equal to 1 over a field F containing a primitive pth root of 1. It is known that the group G _n ⁽²⁾ of n × n matrices of determinant ± 1 over a field F and the group SL _n (F) are generated by their involutions and that each element in these groups is a product of four involutions. We consider some subgroups G of G _n ^(p) and study the following problems: Is G generated by its elements of order p? If so, is every element of G a product of k elements of order p for some fixed integer k? We show that G _n ^(p) and SL _n (F) are generated by their elements of order p and that the bound k exists and is equal to 4. We show that every universal p-Coxeter group has faithful two-dimensional representations over many fields F (including ? and ?). For a universal p-Coxeter group of rank ≥ 2 for p ≥ 3 or of rank ≥ 3 for p = 2 there is no bound k.     

Order Dimension,Strong Bruhat Order and Lattice Properties for Posets

We determine the order dimension of the strong Bruhat order on finite Coxeter groups of types A, B and H. The order dimension is determined using a generalization of a theorem of Dilworth: dim (P)=width(Irr(P)), whenever P satisfies a simple order-theoretic condition called here the dissective property (or clivage). The result for dissective posets follows from an upper bound and lower bound on the dimension of any finite poset. The dissective property is related, via MacNeille completion, to the distributive property of lattices. We show a similar connection between quotients of the strong Bruhat order with respect to parabolic subgroups and lattice quotients.     

4p阶二面体群的弱3-CI性

决定了4p(p是奇素数)阶二面体群的连通3度Cayley图的完全分类,并证明4p阶二面体群不是弱3-CI群,从而否定了C.H.Li关于"所有有限群都是弱3-CI群"的猜想     

Strong Reality Properties of Normalizers of Parabolic Subgroups in Finite Coxeter Groups

Let W be a finite Coxeter group, P a parabolic subgroup of W, and N _W (P) the normalizer of P in W. We prove that every element in N _W (P) is strongly real in N _W (P), and that every irreducible complex character of N _W (P) has Frobenius-Schur indicator 1.     

The Length of the Element of Maximal Length in the Coxeter System of Type A_n,B_n/C_n and D_n

Let ω be the element of maximal length in a finite irreducible Coxetersystem(W,S).In the present paper,we get the length of ω when(W,S)is of typeA_n B_n/C_n or D_n.     

高阶广义微扰KdV方程的弱解(英文)

By using the theory of compensated compactness,we prove that there exists a sequence {uδε} converges nearly everywhere to the solution of the initial-value problem of generalized KdV equation with high order perturbation terms,namely we prove the existence of the weak solution.     

A Characterization of the Simply-Laced FC-Finite Coxeter Groups

We call an element of a Coxeter group fully covering (or a fully covering element) if its length is equal to the number of the elements it covers in the Bruhat ordering. It is easy to see that the notion of fully covering is a generalization of the notion of a 321-avoiding permutation and that a fully covering element is a fully commutative element. Also, we call a Coxeter group bi-full if its fully commutative elements coincide with its fully covering elements. We show that the bi-full Coxeter groups are the ones of type A_n, D_n, E_n with no restriction on n. In other words, Coxeter groups of type E₉, E₁₀,.... are also bi-full. According to a result of Fan, a Coxeter group is a simply-laced FC-finite Coxeter group if and only if it is a bi-full Coxeter group.AMS Subject Classification: 06A07, 20F55.     

A Short Derivation of the Möbius Function for the Bruhat Order

We give a short, self-contained derivation of the Möbius function for the Bruhat orderings of Coxeter groups and their parabolic quotients.