Related papers: W-graph determining elements in type A
In this article, we establish some new combinatorial properties of cone types in Coxeter groups. Firstly, we show that for any element $x$ in a Coxeter group $W$ and root $\beta$ in its inversion set $\Phi(x)$, the set of elements $y \in W$…
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…
Let $C(T)$ be a generalized Coxeter group, which has a natural map onto one of the classical Coxeter groups, either $B_n$ or $D_n$. Let $C_Y(T)$ be a natural quotient of $C(T)$, and if $C(T)$ is simply-laced (which means all the relations…
In 1972, R. Carter introduced admissible diagrams to classify conjugacy classes in a finite Weyl group W. We say that an admissible diagram \Gamma is a Carter diagram if any edge {\alpha, \beta} with inner product (\alpha, \beta) > 0 (resp.…
In this paper, we study the Kazhdan--Lusztig cells of a Coxeter group $W$ in a ``relative'' setting, with respect to a parabolic subgroup $W_I \subseteq W$. This relies on a factorization of the Kazhdan--Lusztig basis $\{C_w\}$ of the…
For W a finite (2-)reflection group and B its (generalized) braid group, we determine the Zariski closure of the image of B inside the corresponding Iwahori-Hecke algebra. The Lie algebra of this closure is reductive and generated in the…
Let $\mathrm{Int}(n)$ denote the set of nonempty left weak Bruhat intervals in the symmetric group $\mathfrak{S}_n$. We investigate the equivalence relation $\overset{D}{\simeq}$ on $\mathrm{Int}(n)$, where $I \overset{D}{\simeq} J$ if and…
To any element of a connected, simply connected, semisimple complex algebraic group G and a choice of an element of the corresponding Weyl group there is an associated Lusztig variety. When the element of G is regular semisimple, the…
To every semigroup presentation $\mathcal{P}= \langle \Sigma \mid \mathcal{R} \rangle$ and every baseword $w \in \Sigma^+$ can be associated a diagram group $D(\mathcal{P},w)$, defined as the fundamental group of the so-called Squier…
The Weisfeiler-Leman (WL) algorithms form a family of incomplete approaches to the graph isomorphism problem. They recently found various applications in algorithmic group theory and machine learning. In fact, the algorithms form a…
An element w of a Coxeter group W is said to be fully commutative, if any reduced expression of w can be obtained from any other by transposing adjacent pairs of generators. These elements were described in 1996 by Stembridge in the case of…
A Coxeter group of classical type $A_n$, $B_n$ or $D_n$ contains a chain of subgroups of the same type. We show that intersections of conjugates of these subgroups are again of the same type, and make precise in which sense and to what…
Affine subgroups having the same Coxeter number with the affine Coxeter groups W(An), W(Dn), and W(En) are constructed by graph folding technique. The affine groups W(Cn) and W(Bn) are obtained from the Coxeter groups W(A2n-1) and W(D2n-1)…
In a seminal work, Bessis gave a geometric interpretation of the noncrossing lattice $NC(W)$ associated to a well-generated complex reflection group $W$. Chief component of this was the trivialization theorem, a fundamental correspondence…
A linked system of symmetric designs (LSSD) is a $w$-partite graph ($w\geq 2$) where the incidence between any two parts corresponds to a symmetric design and the designs arising from three parts are related. The original construction for…
Let g be a Lie algebra of type A,D,E with fixed Cartan subalgebra h, root system R and Weyl group W. We show that a choice of Coxeter element C gives a root basis for g. Moreover we show that this root basis gives a purely combinatorial…
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…
Let $W$ denote a simply-laced Coxeter group with $n$ generators. We construct an $n$-dimensional representation $\phi$ of $W$ over the finite field $F_2$ of two elements. The action of $\phi(W)$ on $F_2^n$ by left multiplication is…
For a finite group $G$, let $B$ be an equivalence (equality, conjugacy or order) relation on $G$ and let $A$ be a (power, enhanced power or commuting) graph with vertex set $G$. The $B$ super $A$ graph is a simple graph with vertex set $G$…
Let $W$ be a finitely generated right-angled Coxeter group with group von Neumann algebra $\mathcal{L}(W)$. We prove the following dichotomy: either $\mathcal{L}(W)$ is strongly solid or $W$ contains $\mathbb{Z} \times \mathbb{F}_2$ as a…