A divisibility result on combinatorics of generalized braids
classification
🧮 math.CO
math.GR
keywords
gammabraidscoxeterfiniteformgarside-normalgroupresult
read the original abstract
For every finite Coxeter group $\Gamma$, each positive braids in the corresponding braid group admits a unique decomposition as a finite sequence of elements of $\Gamma$, the so-called Garside-normal form.The study of the associated adjacency matrix $Adj(\Gamma)$ allows to count the number of Garside-normal form of a given length.In this paper we prove that the characteristic polynomial of $Adj(B_n)$ divides the one of $Adj(B_{n+1})$. The key point is the use of a Hopf algebra based on signed permutations. A similar result was already known for the type $A$. We observe that this does not hold for type $D$. The other Coxeter types ($I$, $E$, $F$ and $H$) are also studied.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.