Fixed Points of Zircon Automorphisms

A zircon is a poset in which every principal order ideal is finite and equipped with a so-called special matching. We prove that the subposet induced by the fixed points of any automorphism of a zircon is itself a zircon. This provides a natural context in which to view recent results on Bruhat orders on twisted involutions in Coxeter groups.     

Shortest path poset of Bruhat intervals

We define the shortest path poset SP(u,v) of a Bruhat interval [u,v], by considering the shortest u–v paths in the Bruhat graph of a Coxeter group W, where u,v∈W. We consider the case of SP(u,v) having a unique rising chain under a reflection order and show that in this case SP(u,v) is a Gorenstein^? poset. This allows us to derive the nonnegativity of certain coefficients of the complete cd-index. We furthermore show that the shortest path poset of an irreducible, finite Coxeter group exhibits a symmetric chain decomposition.     

Homotopy type of the boolean complex of a Coxeter system

In any Coxeter group, the set of elements whose principal order ideals are boolean forms a simplicial poset under the Bruhat order. This simplicial poset defines a cell complex, called the boolean complex. In this paper it is shown that, for any Coxeter system of rank n, the boolean complex is homotopy equivalent to a wedge of (n−1)-dimensional spheres. The number of such spheres can be computed recursively from the unlabeled Coxeter graph, and defines a new graph invariant called the boolean number. Specific calculations of the boolean number are given for all finite and affine irreducible Coxeter systems, as well as for systems with graphs that are disconnected, complete, or stars. One implication of these results is that the boolean complex is contractible if and only if a generator of the Coxeter system is in the center of the group.     

Coxeter groups,Coxeter monoids and the Bruhat order

Associated with any Coxeter group is a Coxeter monoid, which has the same elements, and the same identity, but a different multiplication. (Some authors call these Coxeter monoids 0-Hecke monoids, because of their relation to the 0-Hecke algebras—the q=0 case of the Hecke algebra of a Coxeter group.) A Coxeter group is defined as a group having a particular presentation, but a pair of isomorphic groups could be obtained via non-isomorphic presentations of this form. We show that when we have both the group and the monoid structure, we can reconstruct the presentation uniquely up to isomorphism and present a characterisation of those finite group and monoid structures that occur as a Coxeter group and its corresponding Coxeter monoid. The Coxeter monoid structure is related to this Bruhat order. More precisely, multiplication in the Coxeter monoid corresponds to element-wise multiplication of principal downsets in the Bruhat order. Using this property and our characterisation of Coxeter groups among structures with a group and monoid operation, we derive a classification of Coxeter groups among all groups admitting a partial order.     

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.     

Involution words II: braid relations and atomic structures

Involution words are variations of reduced words for twisted involutions in Coxeter groups. They arise naturally in the study of the Bruhat order, of certain Iwahori–Hecke algebra modules, and of orbit closures in flag varieties. Specifically, to any twisted involutions x, y in a Coxeter group W with automorphism \(*\), we associate a set of involution words \(\hat{\mathcal {R}}_*(x,y)\). This set is the disjoint union of the reduced words of a set of group elements \(\mathcal {A}_*(x,y)\), which we call the atoms of y relative to x. The atoms, in turn, are contained in a larger set \(\mathcal {B}_*(x,y) \subset W\) with a similar definition, whose elements are referred to as Hecke atoms. Our main results concern some interesting properties of the sets \(\hat{\mathcal {R}}_*(x,y)\) and \(\mathcal {A}_*(x,y) \subset \mathcal {B}_*(x,y)\). For finite Coxeter groups, we prove that \(\mathcal {A}_*(1,y)\) consists of exactly the minimal-length elements \(w \in W\) such that \(w^* y \le w\) in Bruhat order, and we conjecture a more general property for arbitrary Coxeter groups. In type A, we describe a simple set of conditions characterizing the sets \(\mathcal {A}_*(x,y)\) for all involutions \(x,y \in S_n\), giving a common generalization of three recent theorems of Can et al. We show that the atoms of a fixed involution in the symmetric group (relative to \(x=1\)) naturally form a graded poset, while the Hecke atoms surprisingly form an equivalence class under the “Chinese relation” studied by Cassaigne et al. These facts allow us to recover a recent theorem of Hu and Zhang describing a set of “braid relations” spanning the involution words of any self-inverse permutation. We prove a generalization of this result giving an analogue of Matsumoto’s theorem for involution words in arbitrary Coxeter groups.     

Extended symmetric spaces and θ-twisted involution graphs

Abstract

For a Weyl group G and an automorphism θ of order 2, the set of involutions and θ-twisted involutions can be generated by considering actions by basis elements, creating a poset structure on the elements. Haas and Helminck showed that there is a relationship between these sets and their Bruhat posets. We extend that result by considering other bases and automorphisms. We show for G = S_n, θ an involution, and any basis consisting of transpositions, the extended symmetric space is generated by a similar algorithm. Moreover, there is an isomorphism of the poset graphs for certain bases and θ.     

Monotonicity of strata in the stratification of the cone of totally positive matrices

According to a theorem of Bjorner [5], there exists a stratified space whose strata are labeled by the elements of [u, v] for every interval [u, v] in the Bruhat order of a Coxeter group W, and each closed stratum (respectively the boundary of each stratum) has the homology of a ball (respectively of a sphere). In [6], Fomin and Shapiro suggest a natural geometric realization of these stratified spaces for a Weyl group W of a semi-simple Lie group G, and then prove its validity in the case of the symmetric group. The stratified spaces arise as links in the Bruhat decomposition of the totally non-negative part of the unipotent radical of G. In this article, we verify the topological regularity property of the strata formed as a result of Bruhat partial ordering on the elements of theWeyl group (of rank 4) of a semi-simple simply connected algebraic group G which is SL(4,?) in our case here. The Weyl group here is the Coxeter group S ₄.     

Suites d’Applications Méromorphes Multivaluées et Courants Laminaires

Let F_n: X₁ → X₂ be a sequence of (multivalued) meromorphic maps between compact Kähler manifolds. We study the asymptotic distribution of preimages of points by F_n and, for multivalued self-maps of a compact Riemann surface, the asymptotic distribution of repelling fixed points. Let (Z_n) be a sequence of holomorphic images of ?^s in a projective manifold. We prove that the currents, defined by integration on Z_n, properly normalized, converge to currents which satisfy some laminarity property. We also show this laminarity property for the Green currents, of suitable bidimensions, associated to a regular polynomial automorphism of ?^k or an automorphism of a projective manifold.     

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.     

The sorting order on a Coxeter group

Let (W,S) be an arbitrary Coxeter system. For each word ω in the generators we define a partial order—called the ω-sorting order—on the set of group elements Wω⊆W that occur as subwords of ω. We show that the ω-sorting order is a supersolvable join-distributive lattice and that it is strictly between the weak and Bruhat orders on the group. Moreover, the ω-sorting order is a “maximal lattice” in the sense that the addition of any collection of Bruhat covers results in a nonlattice.Along the way we define a class of structures called supersolvable antimatroids and we show that these are equivalent to the class of supersolvable join-distributive lattices.     

On Flat Flag-Transitive c.c *-Geometries

We study flat flag-transitive c.c ^*-geometries. We prove that, apart from one exception related to Sym(6), all these geometries are gluings in the meaning of [6]. They are obtained by gluing two copies of an affine space over GF(2). There are several ways of gluing two copies of the n-dimensional affine space over GF(2). In one way, which deserves to be called the canonical one, we get a geometry with automorphism group G = 2²ⁿ · L _n(2) and covered by the truncated Coxeter complex of type D ₂ ⁿ . The non-canonical ways give us geometries with smaller automorphism group (G ≤ 2²ⁿ · (2 ^n?1)n) and which seldom (never ?) can be obtained as quotients of truncated Coxeter complexes.     

The Rohlin property for shifts of finite type

We show that an automorphism of a unital AF C^*-algebra with a certain approximate Rohlin property has the Rohlin property. This generalizes a result of Kishimoto. Using this we show that the shift automorphism on the bilateral C^*-algebra associated with an aperiodic irreducible shift of finite type has the Rohlin property.     

Deformations of permutation representations of Coxeter groups

The permutation representation afforded by a Coxeter group W acting on the cosets of a standard parabolic subgroup inherits many nice properties from W such as a shellable Bruhat order and a flat deformation over ?[q] to a representation of the corresponding Hecke algebra. In this paper we define a larger class of “quasiparabolic” subgroups (more generally, quasiparabolic W-sets), and show that they also inherit these properties. Our motivating example is the action of the symmetric group on fixed-point-free involutions by conjugation.     

The generalized lifting property of Bruhat intervals

In Tsukerman and Williams (Adv Math 285: 766–810, 2015), it is shown that every Bruhat interval of the symmetric group satisfies the so-called generalized lifting property. In this paper, we show that a Coxeter group satisfies this property if and only if it is finite and simply-laced.     

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.     

Combinatorial proof of the inversion formula on the Kazhdan–Lusztig R-polynomials

In this paper, we present a combinatorial proof of the inversion formula on the Kazhdan–Lusztig \(R\) -polynomials. This problem was raised by Brenti. As a consequence, we obtain a combinatorial interpretation of the equidistribution property due to Verma stating that any nontrivial interval of a Coxeter group in the Bruhat order has as many elements of even length as elements of odd length. The same argument leads to a combinatorial proof of an extension of Verma’s equidistribution to the parabolic quotients of a Coxeter group obtained by Deodhar. As another application, we derive a refinement of the inversion formula for the symmetric group by restricting the summation to permutations ending with a given element.     

Fixed points of automorphisms preserving the length of words in free solvable groups

Let ?? be an automorphism of prime order p of the free group F _n . Suppose ?? has no fixed points and preserves the length of words. By ?? :=??? ^(m) we denote the automorphism of the free solvable group ${F_{n}/F_n^{(m)} }$ induced by ??. We show that every fixed point of ?? has the form ${cc^{\sigma} \ldots c^{\sigma^{p-1}}}$ , where ${c\in F_n^{(m-1)}/F_n^{(m)}}$ . This is a generalization of some known results, including the Macedo??ska?CSolitar Theorem [10].