Generating random elements in finite groups.

MaRDI QIDQ1010821zbMATH OpenFDO

Authors John D. Dixon

Publication date 7 April 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/130477, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1r94.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

algorithmsfinite groupsprobability distributionsrandom elementsrandom generators of groups

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05) Probabilistic methods in group theory (20P05) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Randomized algorithms (68W20)

Recommendations

• Generating random elements of a finite group
• Random walks on generating sets for finite groups
• Combining random generators by group operation
• Generating random elements of abelian groups
• scientific article; zbMATH DE number 96387

Cited in

(22)

• Generating random elements of finite distributive lattices
• Strong involutions in finite special linear groups of odd characteristic
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
• Experimental study of the hypothesis on the order of a random element of the matrix modular group
• Black box exceptional groups of Lie type.
• Translation-randomizable distributions via random walks
• Combining random generators by group operation
• Finite groups and complexity theory: from Leningrad to Saint Petersburg via Las Vegas
• On layers in the system of generators of the subdirect product of subgroups of a finite group.
• scientific article; zbMATH DE number 5012619 (Why is no real title available?)
• The Subgroup Algorithm for Generating Uniform Random Variables
• Black box exceptional groups of Lie type. II.
• Generating random elements of a finite group
• Towards constructing fully homomorphic encryption without ciphertext noise from group theory
• An Implementation of the Neumann–Praeger Algorithm for the Recognition of Special Linear Groups
• Generating random elements of abelian groups
• On generation of random covers for finite groups
• Interactions of computational complexity theory and mathematics
• Random generation of finite and profinite groups and group enumeration.
• The product replacement prospector.
• How (not) to hash into class groups of imaginary quadratic fields?
• A polynomial-time reduction algorithm for groups of semilinear or subfield class.

This page was built for publication: Generating random elements in finite groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010821)