Related papers: Freely braided elements in Coxeter groups, II
Let W be an infinite irreducible Coxeter group with (s_1, ..., s_n) the simple generators. We give a simple proof that the word s_1 s_2 ... s_n s_1 s_2 >... s_n ... s_1 s_2 ... s_n is reduced for any number of repetitions of s_1 s_2 >...…
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…
We study the lattice of finite-index extensions of a given finitely generated subgroup $H$ of a free group $F$. This lattice is finite and we give a combinatorial characterization of its greatest element, which is the commensurator of $H$.…
We generalize presentations of the fundamental group of discriminant complements and arrive at a class of presentations associated naturally with words in the free monoid of the alphabet $\sigma_1,\dots,\sigma_{n-1}$. Our study addresses…
Irreducible Artin groups of finite type can be parametrized via their associated Coxeter diagrams into six sporadic examples and four infinite families, each of which is further parametrized by the natural numbers. Within each of these four…
We isolate a tractable class of HNN-extensions of a free group, namely, multiple HNN-extensions by basis-conjugating embeddings. For this class, we construct a normal form and establish a practical version of the ping-pong lemma that…
We prove that, on a large cone containing the constant multiplicities, the only free multiplicities on the braid arrangement are those identified in work of Abe, Nuida, and Numata (2009). We also give a conjecture on the structure of all…
We consider the group $\mathfrak{X}(G)$ obtained from $G\ast G$ by forcing each element $g$ in the first free factor to commute with the copy of $g$ in the second free factor. Deceptively complicated finitely presented groups arise from…
We determine upper bounds for the maximum order of an element of a finite almost simple group with socle T in terms of the minimum index m(T) of a maximal subgroup of T: for T not an alternating group we prove that, with finitely many…
We construct and study polyhedral product models for classifying spaces of right-angled Artin and Coxeter groups, general graph product groups and their commutator subgroups. By way of application, we give a criterion of freeness for the…
We obtain vanishing ranges for the mod $p$ cohomology of alternating subgroups of finite $p$-free Coxeter groups. Here a Coxeter group $W$ is $p$-free if the order of the product $st$ is prime to $p$ for every pair of Coxeter generators…
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…
A family of mixed finite elements is proposed for solving the first order system of linear elasticity equations in any space dimension, where the stress field is approximated by symmetric finite element tensors. This family of elements has…
We define the notion of braided Coxeter category, which is informally a tensor category carrying compatible, commuting actions of a generalised braid group B_W and Artin's braid groups B_n on the tensor powers of its objects. The data which…
A model for a finite group is a set of linear characters of subgroups that can be induced to obtain every irreducible character exactly once. A perfect model for a finite Coxeter group is a model in which the relevant subgroups are the…
We provide two alternative ways to determine the number of (bi-)twisted conjugacy classes in a finite group: one by counting certain irreducible characters and one by counting certain twisted conjugacy classes of other endomorphisms. In…
Using totally symmetric sets, Chudnovsky, Kordek, Li, and Partin gave a superexponential lower bound on the cardinality of non-abelian finite quotients of the braid group. In this paper, we develop new techniques using multiple totally…
An element of a Coxeter group $W$ is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. In the present work, we focus on fully commutative involutions,…
We give an upper bound for the dealternating number of a closed 3-braid. As applications, we determine the dealternating numbers, the alternation numbers and the Turaev genera of some closed positive 3-braids. We also show that there exist…
Let $F_2$ be the free group on two generators and let $H$ be a subgroup of $F_2$. We investigate a method for calculating the number of elements in a coset of $H$ that have a given length when written in reduced form. More specifically,…