Searcharxiv⌕ Search

arXiv · math/9712243

Semisimple orbits of Lie algebras and card shuffling measures on Coxeter groups

Abstract

Solomon's descent algebra is used to define a family of signed measures M(W,x) for a finite Coxeter group W and non-zero x. The measures corresponding to W of types A and B are known to arise from the theory of card shuffling and to be related to the Poincare-Birkhoff-Witt theorem and splittings of Hochschild homology. Formulas for these measures are obtained in special cases. The eigenvalues of the associated Markov chains are computed. By elementary algebraic group theory, choosing a random semisimple orbit on a Lie algebra corresponding to a finite group of Lie type G^F induces a measure on the conjugacy classes of the Weyl group W of G^F. It is conjectured that this measure on conjugacy classes is equal to the measure arising from M(W,q) (and further that M(W,q) is non-negative on all elements of W). This conjecture is proved for all types for the identity conjugacy class of W, and is confirmed for all conjugacy classes for W of types A, B, and C.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jason Fulman. 1998-01-17. Semisimple orbits of Lie algebras and card shuffling measures on Coxeter groups. https://searcharxiv.com/abs/math/9712243

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗