Generating random elements in \(SL_ n(F_ q)\) by random transvections

DOI10.1023/A:1022472220105zbMath0766.60089MaRDI QIDQ1204333

Martin V. Hildebrand

Publication date: 15 March 1993

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

representation theoryrandom walkupper bound lemmarandom transvections

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Combinatorial aspects of representation theory (05E10) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)

Related Items

Characters and random walks on finite classical groups, Walks on generating sets of Abelian groups, Kazhdan constants for conjugacy classes of compact groups., Mixing and generation in simple groups., Reflection factorizations of Singer cycles, Character ratios for finite groups of Lie type, and applications, Conjugacy classes, growth and complexity, Lusztig induction, unipotent supports, and character bounds, Nash inequalities for finite Markov chains, Convergence rates of random walk on irreducible representations of finite groups, Random walk on the symplectic forms over a finite field, Cutoff phenomena for random walks on random regular graphs, Enumeration and random walks on finite groups, Rank and duality in representation theory, Double coset Markov chains

Cites Work

• Representations of finite classical groups. A Hopf algebra approach
• The Characters of the Finite General Linear Groups
• The Subgroup Algorithm for Generating Uniform Random Variables
• Generating a random permutation with random transpositions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item