SearcharxivSearch

arXiv · 1511.04975

A Perron theorem for matrices with negative entries and applications to Coxeter groups

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 $n\times 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jean-Philippe Labbé, Sébastien Labbé. 2015-11-16. A Perron theorem for matrices with negative entries and applications to Coxeter groups. https://arxiv.org/abs/1511.04975

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR