Results 1  10
of
20
Searching for Primitive Roots in Finite Fields
, 1992
"... Let GF(p n ) be the finite field with p n elements where p is prime. We consider the problem of how to deterministically generate in polynomial time a subset of GF(p n ) that contains a primitive root, i.e., an element that generates the multiplicative group of nonzero elements in GF(p n ). ..."
Abstract

Cited by 39 (3 self)
 Add to MetaCart
Let GF(p n ) be the finite field with p n elements where p is prime. We consider the problem of how to deterministically generate in polynomial time a subset of GF(p n ) that contains a primitive root, i.e., an element that generates the multiplicative group of nonzero elements in GF(p n ). We present three results. First, we present a solution to this problem for the case where p is small, i.e., p = n O(1) . Second, we present a solution to this problem under the assumption of the Extended Riemann Hypothesis (ERH) for the case where p is large and n = 2. Third, we give a quantitative improvement of a theorem of Wang on the least primitive root for GF(p) assuming the ERH. Appeared in Mathematics of Computation 58, pp. 369380, 1992. An earlier version of this paper appeared in the 22nd Annual ACM Symposium on Theory of Computing (1990), pp. 546554. 1980 Mathematics Subject Classification (1985 revision): 11T06. 1. Introduction Consider the problem of finding a primitive ...
Explicit bounds for primes in residue classes
 Math. Comp
, 1996
"... Abstract. Let E/K be an abelian extension of number fields, with E ̸ = Q. Let ∆ and n denote the absolute discriminant and degree of E. Letσdenote an element of the Galois group of E/K. Weprovethefollowingtheorems, assuming the Extended Riemann Hypothesis: () (1) There is a degree1 prime p of K su ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
Abstract. Let E/K be an abelian extension of number fields, with E ̸ = Q. Let ∆ and n denote the absolute discriminant and degree of E. Letσdenote an element of the Galois group of E/K. Weprovethefollowingtheorems, assuming the Extended Riemann Hypothesis: () (1) There is a degree1 prime p of K such that p = σ, satis
Constructing nonresidues in finite fields and the extended Riemann hypothesis
 Math. Comp
, 1991
"... Abstract. We present a new deterministic algorithm for the problem of constructing kth power nonresidues in finite fields Fpn,wherepis prime and k is a prime divisor of pn −1. We prove under the assumption of the Extended Riemann Hypothesis (ERH), that for fixed n and p →∞, our algorithm runs in pol ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. We present a new deterministic algorithm for the problem of constructing kth power nonresidues in finite fields Fpn,wherepis prime and k is a prime divisor of pn −1. We prove under the assumption of the Extended Riemann Hypothesis (ERH), that for fixed n and p →∞, our algorithm runs in polynomial time. Unlike other deterministic algorithms for this problem, this polynomialtime bound holds even if k is exponentially large. More generally, assuming the ERH, in time (n log p) O(n) we can construct a set of elements
Polynomials with roots modulo every integer
 Proc. Amer. Math. Soc
, 1996
"... Abstract. Given a polynomial with integer coefficients, we calculate the density of the set of primes modulo which the polynomial has a root. We also give a simple criterion to decide whether or not the polynomial has a root modulo every nonzero integer. 1. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. Given a polynomial with integer coefficients, we calculate the density of the set of primes modulo which the polynomial has a root. We also give a simple criterion to decide whether or not the polynomial has a root modulo every nonzero integer. 1.
Removing Randomness From Computational Number Theory
, 1989
"... In recent years, many probabilistic algorithms (i.e., algorithms that can toss coins) that run in polynomial time have been discovered for problems with no known deterministic polynomial time algorithms. Perhaps the most famous example is the problem of testing large (say, 100 digit) numbers for pri ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In recent years, many probabilistic algorithms (i.e., algorithms that can toss coins) that run in polynomial time have been discovered for problems with no known deterministic polynomial time algorithms. Perhaps the most famous example is the problem of testing large (say, 100 digit) numbers for primality. Even for problems which are known to have deterministic polynomial time algorithms, these algorithms are often not as fast as some probabilistic algorithms for the same problem. Even though probabilistic algorithms are useful in practice, we would like to know, for both theoretical and practical reasons, if randomization is really necessary to obtain the most efficient algorithms for certain problems. That is, we would like to know for which problems there is an inherent gap between the deterministic and probabilistic complexities of these problems. In this research, we consider two problems of a number theoretic nature: factoring polynomials over finite fields and constructing irred...
GRAPH INVARIANTS OF FINITE GROUPS VIA A THEOREM OF LAGARIAS
, 2006
"... Abstract. We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each connected component corresponds to a division (Abteil ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each connected component corresponds to a division (Abteilung) of the group. We compute the divisions of the alternating group, and compile a list of characteristics of groups that the invariant reveals. We conjecture that the invariant distinguishes finite groups. Our exposition borrows elements from graph theory, group theory, and algebraic number theory. 1.
Results and estimates on pseudopowers
 Math. Comp
, 1996
"... Abstract. Let n be a positive integer. We say n looks like a power of 2moduloaprime pif there exists an integer ep ≥ 0 such that n ≡ 2 ep (mod p). First, we provide a simple proof of the fact that a positive integer which looks like a power of 2 modulo all but finitely many primes is in fact a power ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. Let n be a positive integer. We say n looks like a power of 2moduloaprime pif there exists an integer ep ≥ 0 such that n ≡ 2 ep (mod p). First, we provide a simple proof of the fact that a positive integer which looks like a power of 2 modulo all but finitely many primes is in fact a powerof2. Next, we define an xpseudopower of the base 2tobeapositiveintegern that is not a power of 2, but looks like a power of 2 modulo all primes p ≤ x. Let P2(x) denote the least such n. We give an unconditional upper bound on P2(x), a conditional result (on ERH) that gives a lower bound, and a heuristic argument suggesting that P2(x)isaboutexp(c2x/log x) for a certain constant c2. We compare our heuristic model with numerical data obtained by a sieve. Some results for bases other than 2 are also given. 1.
THE EFFECTIVE CHEBOTAREV DENSITY THEOREM AND MODULAR FORMS MODULO m
"... Abstract. Suppose that f (resp. g) is a modular form of integral (resp. halfintegral) weight with coefficients in the ring of integers OK of a number field K. For any ideal m ⊂ OK, we bound the first prime p for which f  Tp (resp. g  Tp2) is zero (mod m). Applications include the solution to a qu ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Suppose that f (resp. g) is a modular form of integral (resp. halfintegral) weight with coefficients in the ring of integers OK of a number field K. For any ideal m ⊂ OK, we bound the first prime p for which f  Tp (resp. g  Tp2) is zero (mod m). Applications include the solution to a question of Ono [AO] concerning partitions. 1.
The Chebotarev invariant of a finite group
"... Abstract. We consider invariants of a finite group G related to the number of random (independent, uniformly distributed) conjugacy classes which are required to generate it. These invariants are intuitively related to problems of Galois theory. We find grouptheoretic expressions for them and inves ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We consider invariants of a finite group G related to the number of random (independent, uniformly distributed) conjugacy classes which are required to generate it. These invariants are intuitively related to problems of Galois theory. We find grouptheoretic expressions for them and investigate their values both theoretically and numerically. 1.