How to pick a random integer matrix? (and other questions)
From MaRDI portal
Publication:2792341
DOI10.1090/mcom/2986zbMath1332.15095arXiv1312.4607OpenAlexW1576809544MaRDI QIDQ2792341
Publication date: 9 March 2016
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.4607
Unimodular groups, congruence subgroups (group-theoretic aspects) (20H05) Random matrices (algebraic aspects) (15B52) Probabilistic methods in group theory (20P05)
Related Items (9)
Randomness and complexity in matrix groups ⋮ Random trigonometric polynomials: universality and non-universality of the variance for the number of real roots ⋮ Models of random knots ⋮ Volumes for \(\text{SL}_N(\mathbb{R})\), the Selberg integral and random lattices ⋮ Distribution of coefficients of rank polynomials for random sparse graphs ⋮ Volumes and distributions for random unimodular complex and quaternion lattices ⋮ Linear groups and computation ⋮ Universal knot diagrams ⋮ Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random walks on the mapping class group
- Finite simple groups of Lie type as expanders.
- Asymptotics for pseudo-Anosov elements in Teichmüller lattices
- Counting modular matrices with specified Euclidean norm
- Factoring polynomials with rational coefficients
- Density of integer points on affine homogeneous varieties
- Mixing, counting, and equidistribution in Lie groups
- Splitting fields of elements in arithmetic groups
- Groups of Lie type as products of \(\text{SL}_2\) subgroups.
- Universal lattices and unbounded rank expanders.
- Symmetric groups and expander graphs.
- Walks on groups, counting reducible matrices, polynomials, and surface and free group automorphisms
- A Note on the Generation of Random Normal Deviates
- Expander graphs and their applications
- Symplectic Lattice Reduction and NTRU
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
- Gauss' algorithm revisited
- Two-generator discrete subgroups of 𝑃𝑆𝐿(2,𝑅)
- Walks on graphs and lattices – effective bounds and applications
- Geometry and Topology for Mesh Generation
- Manin’s and Peyre’s conjectures on rational points and adelic mixing
- Symplectic Geometry
- Lie groups beyond an introduction
This page was built for publication: How to pick a random integer matrix? (and other questions)
