arXiv math/99030121999-03math.GRmath.CO

Semisimple orbits of Lie algebras and card shuffling on Coxeter groups

Jason Fulman

备注：: Added new section and example

英文摘要：

Random walk on the chambers of hyperplanes arrangements is used to define a family of card shuffling measures $H_{W,x}$ for a finite Coxeter group W and real $x \neq 0$. By algebraic group theory, there is a map from the semisimple orbits of the adjoint action of a finite group of Lie type on its Lie algebra to the conjugacy classes of the Weyl group. Choosing such a semisimple orbit uniformly at random thereby induces a probability measure on the conjugacy classes of the Weyl group. For types A, B, and the identity conjugacy class of W for all types, it is proved that for q very good, this measure on conjugacy classes is equal to the measure arising from $H_{W,q}$.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

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

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…

1998-01-17math.COmath.GR

Descent algebras, hyperplane arrangements, and shuffling cards

Two notions of riffle shuffling on finite Coxeter groups are given: one using Solomon's descent algebra and another using random walk on chambers of hyperplane arrangements. These coincide for types $A$,$B$,$C$, $H_3$, and rank two groups. Both notions have the same, simple eigenvalues. The hyperplane definition is especially natural and satisfies a positivity property when $W$ is crystallographic and the relevant parameter is a good prime. The hyperplane viewpoint suggests interesting connections with Lie theory and leads to a notion of riffle shuffling for arbitrary real hyperplane arrangeme…

1999-07-15math.COmath.GR

Applications of the Brauer complex: card shuffling, permutation statistics, and dynamical systems

By algebraic group theory, there is a map from the semisimple conjugacy classes of a finite group of Lie type to the conjugacy classes of the Weyl group. Picking a semisimple class uniformly at random yields a probability measure on conjugacy classes of the Weyl group. Using the Brauer complex, it is proved that this measure agrees with a second measure on conjugacy classes of the Weyl group induced by a construction of Cellini using the affine Weyl group. Formulas for Cellini's measure in type $A$ are found. This leads to new models of card shuffling and has interesting combinatorial and numb…

2001-05-09math.COmath.DSmath.GR

On the rank of Coxeter groups

We show that the standard generating set of a Coxeter group is of minimal cardinality provided that the non-diagonal entries of the Coxeter matrix are sufficiently large.

2009-10-26math.GR

Generalised shuffle groups

The mathematics of shuffling a deck of $2n$ cards with two "perfect shuffles" was brought into clarity by Diaconis, Graham and Kantor. Here we consider a generalisation of this problem, with a so-called "many handed dealer" shuffling $kn$ cards by cutting into $k$ piles with $n$ cards in each pile and using $k!$ shuffles. A conjecture of Medvedoff and Morrison suggests that all possible permutations of the deck of cards are achieved, so long as $k\neq 4$ and $n$ is not a power of $k$. We confirm this conjecture for three doubly infinite families of integers: all $(k,n)$ with $k>n$; all $(k, n)…

2019-08-14math.GR

On the rank of a Coxeter group

Let W be a Coxeter group with Coxeter generators S. The rank of the Coxeter system (W,S) is the cardinality |S| of S. The Coxeter system (W,S) has finite rank if and only if W is finitely generated. If (W,S) has infinite rank, then |S| = |W|, since every element of W is represented by a finite product of elements of S. Thus if W is not finitely generated, the rank of (W,S) is uniquely determined by W. If W is finitely generated, then W may have sets of Coxeter generators S and S' of different ranks. In this paper, we determine the set of all possible ranks for an arbitrary finitely generated C…

2007-06-26math.GR

更多相关论文收起更多论文

Counting semisimple orbits of finite Lie algebras by genus

The adjoint action of a finite group of Lie type on its Lie algebra is studied. A simple formula is conjectured for the number of split semisimple orbits of a given genus. This conjecture is proved for type A, and partial results are obtained for other types. For type A a probabilistic interpretation is given in terms of card shuffling.

1999-05-01math.COmath.GR

Geodesic growth of right-angled Coxeter groups based on trees

In this paper we exhibit two infinite families of trees $\{T^1_n\}_{n \geq 17}$ and $\{T^2_n\}_{n \geq 17}$ on $n$ vertices, such that $T^1_n$ and $T^2_n$ are non-isomorphic, co-spectral, and the right-angled Coxeter groups (RACGs) based on $T^1_n$ and $T^2_n$ have the same geodesic growth with respect to the standard generating set. We then show that the spectrum of a tree does is not sufficient to determine the geodesic growth of the RACG based on that tree, by providing two infinite families of trees $\{S^1_n\}_{n \geq 11}$ and $\{S^2_n\}_{n \geq 11}$, on $n$ vertices, such that $S^1_n$ and…

2020-01-17math.COmath.GR

反射群上的 Hurwitz 数 II：抛物拟 Coxeter 元素

Hurwitz numbers for reflection groups II: Parabolic quasi-Coxeter elements

本文在良生成复反射群中定义并刻画抛物拟 Coxeter 元素，计算其约化反射分解与相对生成集的基数，并将后者与 Frobenius 流形几何不变量关联，为后续统一公式奠定基础。

2022-09-22math.COmath.DGmath.GR

On the growth of a Coxeter group

For a Coxeter system $(W,S)$ let $a_n^{(W,S)}$ be the cardinality of the sphere of radius $n$ in the Cayley graph of $W$ with respect to the standard generating set $S$. It is shown that, if $(W,S)\preceq(W',S')$ then $a_n^{(W,S)}\leq a_n^{(W',S')}$ for all $n\in \mathbb{N}_0$, where $\preceq$ is a suitable partial order on Coxeter systems (cf. Thm. A). It is proven that there exists a constant $τ= 1.13\dots$ such that for any non-affine, non-spherical Coxeter system $(W,S)$ the growth rate $ω(W,S)=\limsup \sqrt[n]{a_n}$ satisfies $ω(W,S)\geq τ$ (cf. Thm. B). The constant $τ$ is a Perron numbe…

2015-03-31math.GR

小 Systle 集与 Coxeter 群

Small Systle Sets and Coxeter Groups

本文基于 Coxeter 群理论与初等数论，改进 Schmutz 的方法，构造了具有任意大亏格且其 systole 集合基数低至 o(g/ ln g) 仍能填充曲面的闭双曲曲面。

2023-10-24math.GRmath.GT

Peaks Sets of Classical Coxeter Groups

We say a permutation $π=π_1π_2\cdotsπ_n$ in the symmetric group $\mathfrak{S}_n$ has a peak at index $i$ if $π_{i-1}<π_i>π_{i+1}$ and we let $P(π)=\{i \in \{1, 2, \ldots, n\} \, \vert \, \mbox{$i$ is a peak of $π$}\}$. Given a set $S$ of positive integers, we let $P (S; n)$ denote the subset of $\mathfrak{S}_n$ consisting of all permutations $π$, where $P(π) =S$. In 2013, Billey, Burdzy, and Sagan proved $|P(S;n)| = p(n)2^{n-\lvert S\rvert-1}$, where $p(n)$ is a polynomial of degree $\max(S)- 1$. In 2014, Castro-Velez et al. considered the Coxeter group of type $B_n$ as the group of signed per…

2016-01-22math.GR

对称群代数中的单侧洗牌

The one-sided cycle shuffles in the symmetric group algebra

研究对称群代数中的单侧洗牌算子，计算其特征值与重数，证明可对角化条件，并给出随机到下方洗牌的强平稳时间。

2024-03-10math.COmath.GRmath.PR

群的图乘积中的轴双曲性与纯共轭自同构

Acylindrical Hyperbolicity and Pure Conjugating Automorphisms in Graph Products of Groups

University of Torino（都灵大学）；Vanderbilt University（范德堡大学）

该研究从两个视角刻画群的图乘积的轴双曲性，并确立纯共轭自同构的拓扑生成、闭性等性质，还给出阿贝尔群图乘积对应的典范拓扑半直积分解。

2026-09-03math.GR