A probabilistic approach toward conjugacy classes in the finite general linear and unitary groups
DOI10.1006/JABR.1998.7659zbMATH Open0980.20036OpenAlexW1978726641MaRDI QIDQ1284243FDOQ1284243
Authors: Jason Fulman 
Publication date: 28 February 2002
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jabr.1998.7659
Recommendations
- A probabilistic approach to conjugacy classes in the finite symplectic and orthogonal groups
- On the autoconjugate probability of finite groups
- scientific article; zbMATH DE number 1187233
- On some probabilistic aspects of (generalized) dicyclic groups
- The probability of generating a finite classical group
- Classical groups, probabilistic methods, and the \((2,3)\)-generation problem
- Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky
- Probabilistic methods in group theory
- Probabilistic and asymptotic aspects of finite simple groups.
- Asymptotic behaviour of the conjugacy probability of the alternating group.
partitionsalgorithmsconjugacy classessymmetric functionsgeneral linear groupsunitary groupsdiscrete probability measuresnumbers of unipotent elements
Conjugacy classes for groups (20E45) Linear algebraic groups over finite fields (20G40) Probabilistic methods in group theory (20P05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Statistical mechanics of combinatorial partitions, and their limit shapes
- Title not available (Why is that?)
- On the conjugacy classes in the unitary, symplectic and orthogonal groups
- A random \(q,t\)-hook walk and a sum of Pieri coefficients
- Cycle indices for the finite classical groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Rogers-Ramanujan identities, the finite general linear groups, and the Hall-Littlewood polynomials
- A Note on Counting Nilpotent Matrices of Fixed Rank
- Title not available (Why is that?)
- A probabilistic proof of a formula for the number of Young tableaux of a given shape
- A \(q\)-analog of the hook walk algorithm for random Young tableaux
- Some asymptotic results on finite vector spaces
- The cycle structure of a linear transformation over a finite field
- Title not available (Why is that?)
Cited In (20)
- Hall-Littlewood polynomials and Cohen-Lenstra heuristics for Jacobians of random graphs
- Transitivity in finite general linear groups
- A probabilistic approach to conjugacy classes in the finite symplectic and orthogonal groups
- Limits and fluctuations of \(p\)-adic random matrix products
- Finite affine groups: cycle indices, Hall-Littlewood polynomials, and probabilistic algorithms
- Random partitions and Cohen-Lenstra heuristics
- The Cohen-Lenstra heuristic: methodology and results
- Cohen Lenstra partitions and mutually annihilating matrices over a finite field
- On the autoconjugate probability of finite groups
- \(\operatorname{GL}_n(\mathbb{F}_q)\)-analogues of factorization problems in the symmetric group
- On the distribution of eigenspaces in classical groups over finite rings.
- Moments and interpretations of the Cohen-Lenstra-Martinet heuristics
- Law of large numbers for infinite random matrices over a finite field
- Universality for cokernels of random matrix products
- The eigenvalue distribution of a random unipotent matrix in its representation on lines
- Infinite 𝑝-adic random matrices and ergodic decomposition of 𝑝-adic Hua measures
- Cycle indices for finite orthogonal groups of even characteristic
- On the distribution of the number of fixed vectors for the finite classical groups
- Binomial transforms and integer partitions into parts of \(k\) different magnitudes
- Random matrix theory over finite fields
This page was built for publication: A probabilistic approach toward conjugacy classes in the finite general linear and unitary groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1284243)
