Statistical Evidence for Small Generating Sets

DOI10.2307/2152936zbMATH Open0784.11059OpenAlexW4245074849MaRDI QIDQ3137449FDOQ3137449

Authors: Eric Bach, Lorenz Huelsbergen 

Publication date: 4 April 1994

Full work available at URL: https://doi.org/10.2307/2152936

Recommendations

• Upper bounds for least witnesses and generating sets
• scientific article; zbMATH DE number 697832
• On the order of finitely generated subgroups of \(\mathbb{Q}^*\pmod p\) and divisors of \(p-1\)
• Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes
• scientific article; zbMATH DE number 2103551

zbMATH Keywords

primalitypseudoprime testing

Mathematics Subject Classification ID

Distribution of integers with specified multiplicative constraints (11N25) Primality (11Y11) Software, source code, etc. for problems pertaining to number theory (11-04) Values of arithmetic functions; tables (11Y70)

Cites Work

• Title not available (Why is that?)
• Inequalities: theory of majorization and its applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality
• On the Distribution of Additive Number-Theoretic Functions (II)
• Title not available (Why is that?)
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
• On Artin's conjecture.
• A classical invitation of algebraic numbers and class fields. With two appendices by Olga Taussky: ``Artin's 1932 Göttingen lectures on class field theory and ``Connections between algebraic number theory and integral matrices.
• Greatest of the Least Primes in Arithmetic Progressions Having a Given Modulus
• Some empirical observations on primitive roots
• Explicit Bounds for Primality Testing and Related Problems
• On Character Sums and Primitive Roots^†
• Lucas Pseudoprimes
• A Rigorous Subexponential Algorithm For Computation of Class Groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two fast parallel prime number sieves
• Primality testing
• On the First Occurrence of Values of a Character
• Integer Sequence having Prescribed Quadratic Character
• The Distribution of Primitive Roots
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Least r-Free Number in an Arithmetic Progression
• On Δ(x, n) = ϕ(x, n) - xϕ(n)/n
• A problem of Erdös concerning power residue sums.

Cited In (7)

• Dirichlet’s proof of the three-square theorem: An algorithmic perspective
• Automaticity. II: Descriptional complexity in the unary case
• Comments on search procedures for primitive roots
• Explicit bounds for primes in residue classes
• Some results on pseudosquares
• Two algorithms to find primes in patterns
• Cyclotomic identity testing and applications

This page was built for publication: Statistical Evidence for Small Generating Sets

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