Related papers: The Excess Zero Graph of a Coxeter Group

For a finite Coxeter group $W$ and $w$ an element of $W$ the `excess' of $w$ is defined to be $e(w) = \min\{\ell(x) + \ell(y) - \ell(w) \; | \; w=xy, \; x^2 = y^2 = 1\}$ where $\ell$ is the length function on $W$. Here we investigate the…

The excess of an element $w$ of a finite Coxeter group $W$ is the minimal value of $l(x) + l(y) - l(w)$, where $x$, $y$ are elements of $W$ such that $x^2 = y^2 = 1$ and $w = xy$. Every element of a finite Coxeter group is either an…

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 $\mathcal{W}$ be the set of strongly real elements of $W$, a Coxeter group. Then for $w \in \mathcal{W}$, $e(w)$, the excess of $w$, is defined by $e(w) = \min\{\ell(x) + \ell(y) - \ell(w) \; | \; w=xy, x^2 = y^2 = 1\}$. When $W$ is…

We consider the question of determining whether a given group (especially one generated by involutions) is a right-angled Coxeter group. We describe a group invariant, the involution graph, and we characterize the involution graphs of…

We compute Aut(W) for any even Coxeter group whose Coxeter diagram is connected, contains no edges labeled 2, and cannot be separated into more than 2 connected components by removing a single vertex. The description is given explicitly in…

A type of directed multigraph called a W-digraph is introduced to model the structure of certain representations of Hecke algebras, including those constructed by Lusztig and Vogan from involutions in a Weyl group. Building on results of…

The enhanced power graph of a group $G$ is a graph with vertex set $G,$ where two distinct vertices $x$ and $y$ are adjacent if and only if there exists an element $w$ in $G$ such that both $x$ and $y$ are powers of $w.$ In this paper, we…

The special representations of a Weyl group can be regarded as the vertices of a graph with an involution i such that any edge e has the following property: either e or i(e) joins two vertices whose a-functions differ by 1.

The enhanced power graph, $\mathcal{E}(G)$, of a group $G$ has vertex set $G$ and two elements are adjacent if they generate a cyclic subgroup. In the case of finite groups, we identify some striking and unexpected properties of these…

Let $(W,S)$ be a Coxeter system of type $A$, so that $W$ can be identified with the symmetric group $\mathrm{Sym}(n)$ for some positive integer $n$ and $S$ with the set of simple transpositions $\{\,(i,i+1)\mid 1\leqslant i\leqslant…

We study divergence and thickness for general Coxeter groups $W$. We first characterise linear divergence, and show that if $W$ has superlinear divergence then its divergence is at least quadratic. We then formulate a computable…

An odd Coxeter group $W$ is one which admits a Coxeter system $(W,S)$ for which all the exponents $m_{ij}$ are either odd or infinity. The paper investigates the family of odd Coxeter groups whose associated labeled graphs…

The enhanced power graph of a finite group $G$, denoted by $\mathcal{P}_E(G)$, is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this…

Let $W$ be a finite Coxeter group and $X$ a subset of $W$. The length polynomial $L_{W,X}(t)$ is defined by $L_{W,X}(t) = \sum_{x \in X} t^{\ell(x)}$, where $\ell$ is the length function on $W$. In this article we derive expressions for the…

A Coxeter system is an ordered pair (W,S) where S is the generating set in a particular type of presentation for the Coxeter group W. A subgroup of W is called special if it is generated by a subset of S. Amalgamated product decompositions…

For a graph $G=(V,E)$, and a symplectic vector space $(W, \left<\cdot,\cdot\right>)$, we define a variety $X(G,W)$ consisting of all functions $w:V\to W$ satisfying $\left<w(u), w(v)\right> = 0$ for any edge $\{u,v\}$ in $G$. We study the…

This paper is the continuation of the work in~\cite{Yin}. In that paper we generalized the definition of $W$-graph ideal in the weighted Coxeter groups, and showed how to construct a $W$-graph from a given $W$-graph ideal in the case of…

A solution of the isomorphism problem is presented for the class of Coxeter groups W that have a finite set of Coxeter generators S such that the underlying graph of the presentation diagram of the system (W,S) has the property that every…

The Weyl group $W(\mathrm{E}_6)$ has an odd presentation due to Christopher Simons as factor group of the Coxeter group on the Petersen graph by deflation of the free hexagons. The goal of this paper is to give a geometric meaning for this…