Related papers: Involution words II: braid relations and atomic st…

Given an involutive automorphism $\theta$ of a Coxeter system $(W,S)$, let $\mathfrak{I}(\theta) \subseteq W$ denote the set of twisted involutions. We provide a minimal set of moves that can be added to the braid moves, in order to connect…

Involution words are variations of reduced words for involutions in Coxeter groups, first studied under the name of "admissible sequences" by Richardson and Springer. They are maximal chains in Richardson and Springer's weak order on…

There is a natural analogue of weak Bruhat order on the involutions in any Coxeter group. The saturated chains of intervals in this order correspond to reduced words for a certain set of group elements called atoms. Brion gives a general…

Let $(W,S)$ be a Coxeter system and $\ast$ be an automorphism of $W$ with order $\leq 2$ such that $s^{\ast}\in S$ for any $s\in S$. Let $I_{\ast}$ be the set of twisted involutions relative to $\ast$ in $W$. In this paper we consider the…

An involution in a Coxeter group has an associated set of involution words, a variation on reduced words. These words are saturated chains in a partial order first considered by Richardson and Springer in their study of symmetric varieties.…

We describe an algorithm to identify a minimal set of "braid relations" which span and preserve all sets of involution words for twisted Coxeter systems of finite or affine type. We classify the cases in which adding the smallest possible…

A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…

The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…

For $W$ a Coxeter group, let $\mathcal{W} = \{ w \in W \;| \; w = xy \; \mbox{where} \; x, y \in W \; \mbox{and} \; x^2 = 1 = y^2 \}$. If $W$ is finite, then it is well known that $W = \mathcal{W}$. Suppose that $w \in \mathcal{W}$. Then…

The orbits of the orthogonal and symplectic groups on the flag variety are in bijection, respectively, with the involutions and fixed-point-free involutions in the symmetric group $S_n$. Wyser and Yong have described polynomial…

We study the restriction of the absolute order on a Coxeter group $W$ to an interval $[1,w]_T$, where $w\in W$ is an involution. We characterize and classify those involutions $w$ for which $[1,w]_T$ is a lattice, using the notion of…

In this article, we investigate the existence of joins in the weak order of an infinite Coxeter group W. We give a geometric characterization of the existence of a join for a subset X in W in terms of the inversion sets of its elements and…

In this article, we propose to initiate the general study of involution systems. An {\em involution system}, that is, a group $W$ generated by a set of involutions $S$, is naturally endowed with a {\em weak order} arising from orienting the…

There is a well-known classification of conjugacy classes of involutions in finite Coxeter groups, in terms of subsets of nodes of their Coxeter graphs. In many cases, the product of an involution with the longest element is again an…

We prove two extensions of Hansson and Hultman's word property for certain analogues of reduced words associated to twisted involutions in Coxeter groups. Our first extension concerns the superset of such words in which terms with a natural…

In this paper, we initiate the study of the twisted weak order associated to a twisted Bruhat order for a Coxeter group and explore the relationship between the lattice property of such order and the infinite reduced words. We show that for…

Let $(W, S)$ be a Coxeter system equipped with a fixed automorphism $\ast$ of order $\leq 2$ which preserves $S$. Lusztig (and with Vogan in some special cases) have shown that the space spanned by set of "twisted" involutions was naturally…

For an infinite Coxeter system, one can extend the weak right order to the set of infinite reduced words. This is called limit weak order. In [Transformation Groups 18(1), 2013, 179-231], Lam and Pylyavskyy showed that for affine Weyl…

Let $(W, R)$ be a Coxeter system and let $w \in W$. We say that $u$ is a prefix of $w$ if there is a reduced expression for $u$ that can be extended to one for $w$. That is, $w = uv$ for some $v$ in $W$ such that $\ell(w) = \ell(u) +…

We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete. We then…