Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Perron theorem for matrices with negative entries and applications to Coxeter groups
98
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Handelman (J. Operator Theory, 1981) proved that if the spectral radius of a matrix $A$ is a simple root of the characteristic polynomial and is strictly greater than the modulus of any other root, then $A$ is conjugate to a matrix $Z$ some power of which is positive. In this article, we provide an explicit conjugate matrix $Z$, and prove that the spectral radius of $A$ is a simple and dominant eigenvalue of $A$ if and only if $Z$ is eventually positive. For $ntimes n$ real matrices with each row-sum equal to $1$, this criterion can be declined into checking that each entry of some power is strictly larger than the average of the entries of the same column minus $frac{1}{n}$. We apply the criterion to elements of irreducible infinite nonaffine Coxeter groups to provide evidences for the dominance of the spectral radius, which is still unknown.
rate research
Read More
We prove that for any infinite right-angled Coxeter or Artin group, its spherical and geodesic growth rates (with respect to the standard generating set) either take values in the set of Perron numbers, or equal $1$. Also, we compute the average number of geodesics representing an element of given word length in such groups.
We define a large class of abstract Coxeter groups, that we call $infty$--spanned, and for which the word growth rate and the geodesic growth rate appear to be Perron numbers. This class contains a fair amount of Coxeter groups acting on hyperbolic spaces, thus corroborating a conjecture by Kellerhals and Perren. We also show that for this class the geodesic growth rate strictly dominates the word growth rate.
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 right-angled Coxeter groups. We use this characterization to describe a process for constructing candidate right-angled Coxeter presentations for a given group or proving that one cannot exist. We provide some first applications. In addition, we provide an elementary proof of rigidity of the defining graph for a right-angled Coxeter group. We also recover a result stating that if the defining graph contains no SILs, then Aut^0(W) is a right-angled Coxeter group.
A graph $X$ is defined inductively to be $(a_0,dots,a_{n-1})$-regular if $X$ is $a_0$-regular and for every vertex $v$ of $X$, the sphere of radius $1$ around $v$ is an $(a_1,dots,a_{n-1})$-regular graph. Such a graph $X$ is said to be highly regular (HR) of level $n$ if $a_{n-1} eq 0$. Chapman, Linial and Peled studied HR-graphs of level 2 and provided several methods to construct families of graphs which are expanders globally and locally. They ask whether such HR-graphs of level 3 exist. In this paper we show how the theory of Coxeter groups, and abstract regular polytopes and their generalisations, can lead to such graphs. Given a Coxeter system $(W,S)$ and a subset $M$ of $S$, we construct highly regular quotients of the 1-skeleton of the associated Wythoffian polytope $mathcal{P}_{W,M}$, which form an infinite family of expander graphs when $(W,S)$ is indefinite and $mathcal{P}_{W,M}$ has finite vertex links. The regularity of the graphs in this family can be deduced from the Coxeter diagram of $(W,S)$. The expansion stems from applying superapproximation to the congruence subgroups of the linear group $W$. This machinery gives a rich collection of families of HR-graphs, with various interesting properties, and in particular answers affirmatively the question asked by Chapman, Linial and Peled.
In this paper we will present the results of Artin--Markov on braid groups by using the Groebner--Shirshov basis. As a consequence we can reobtain the normal form of Artin--Markov--Ivanovsky as an easy corollary.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
