Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA generalization of Coxeter groups, root systems, and Matsumotos theorem
128
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The root systems appearing in the theory of Lie superalgebras and Nichols algebras admit a large symmetry extending properly the one coming from the Weyl group. Based on this observation we set up a general framework in which the symmetry object is a groupoid. We prove that in our context the groupoid is generated by reflections and Coxeter relations. This answers a question of Serganova. Our weak version of the exchange condition allows us to prove Matsumotos theorem. Therefore the word problem is solved for the groupoid.
rate research
Read More
We study Artin-Tits braid groups $mathbb{B}_W$ of type ADE via the action of $mathbb{B}_W$ on the homotopy category $mathcal{K}$ of graded projective zigzag modules (which categorifies the action of the Weyl group $W$ on the root lattice). Following Brav-Thomas, we define a metric on $mathbb{B}_W$ induced by the canonical $t$-structure on $mathcal{K}$, and prove that this metric on $mathbb{B}_W$ agrees with the word-length metric in the canonical generators of the standard positive monoid $mathbb{B}_W^+$ of the braid group. We also define, for each choice of a Coxeter element $c$ in $W$, a baric structure on $mathcal{K}$. We use these baric structures to define metrics on the braid group, and we identify these metrics with the word-length metrics in the Birman-Ko-Lee/Bessis dual generators of the associated dual positive monoid $mathbb{B}_{W.c}^vee$. As consequences, we give new proofs that the standard and dual positive monoids inject into the group, give linear-algebraic solutions to the membership problem in the standard and dual positive monoids, and provide new proofs of the faithfulness of the action of $mathbb{B}_W$ on $mathcal{K}$. Finally, we use the compatibility of the baric and $t$-structures on $mathcal{K}$ to prove a conjecture of Digne and Gobet regarding the canonical word-length of the dual simple generators of ADE braid groups.
Coxeter groups are a special class of groups generated by involutions. They play important roles in the various areas of mathematics. This survey particularly focuses on how one use Coxeter groups to construct interesting examples of discrete subgroups of Lie group.
In the 1990s, J.H. Conway published a combinatorial-geometric method for analyzing integer-valued binary quadratic forms (BQFs). Using a visualization he named the topograph, Conway revisited the reduction of BQFs and the solution of quadratic Diophantine equations such as Pells equation. It appears that the crux of his method is the coincidence between the arithmetic group $PGL_2({mathbb Z})$ and the Coxeter group of type $(3,infty)$. There are many arithmetic Coxeter groups, and each may have unforeseen applications to arithmetic. We introduce Conways topograph, and generalizations to other arithmetic Coxeter groups. This includes a study of arithmetic flags and variants of binary quadratic forms.
We prove that certain families of Coxeter groups and inclusions $W_1hookrightarrow W_2hookrightarrow...$ satisfy homological stability, meaning that in each degree the homology $H_ast(BW_n)$ is eventually independent of $n$. This gives a uniform treatment of homological stability for the families of Coxeter groups of type $A_n$, $B_n$ and $D_n$, recovering existing results in the first two cases, and giving a new result in the third. The key step in our proof is to show that a certain simplicial complex with $W_n$-action is highly connected. To do this we show that the barycentric subdivision is an instance of the basic construction, and then use Daviss description of the basic construction as an increasing union of chambers to deduce the required connectivity.
Let W be an arbitrary Coxeter group. If two elements have expressions that are cyclic shifts of each other (as words), then they are conjugate (as group elements) in W. We say that w is cyclically fully commutative (CFC) if every cyclic shift of any reduced expression for w is fully commutative (i.e., avoids long braid relations). These generalize Coxeter elements in that their reduced expressions can be described combinatorially by acyclic directed graphs, and cyclically shifting corresponds to source-to-sink
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
