Results 1  10
of
38
Classical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas perfect powers
 Annals of Math
"... Abstract. This is the second in a series of papers where we combine the classical approach to exponential Diophantine equations (linear forms in logarithms, Thue equations, etc.) with a modular approach based on some of the ideas of the proof of Fermat’s Last Theorem. In this paper we use a general ..."
Abstract

Cited by 33 (13 self)
 Add to MetaCart
Abstract. This is the second in a series of papers where we combine the classical approach to exponential Diophantine equations (linear forms in logarithms, Thue equations, etc.) with a modular approach based on some of the ideas of the proof of Fermat’s Last Theorem. In this paper we use a general and powerful new lower bound for linear forms in three logarithms, together with a combination of classical, elementary and substantially improved modular methods to solve completely the LebesgueNagell equation for D in the range 1 ≤ D ≤ 100. x 2 + D = y n, x, y integers, n ≥ 3, 1.
Lattices that admit logarithmic worstcase to averagecase connection factors
 In STOC
, 2007
"... Abstract We demonstrate an averagecase problem which is as hard as finding fl(n)approximateshortest vectors in certain ndimensional lattices in the worst case, where fl(n) = O(plog n).The previously best known factor for any class of lattices was fl(n) = ~O(n).To obtain our results, we focus on ..."
Abstract

Cited by 19 (9 self)
 Add to MetaCart
Abstract We demonstrate an averagecase problem which is as hard as finding fl(n)approximateshortest vectors in certain ndimensional lattices in the worst case, where fl(n) = O(plog n).The previously best known factor for any class of lattices was fl(n) = ~O(n).To obtain our results, we focus on families of lattices having special algebraic structure. Specifically, we consider lattices that correspond to ideals in the ring of integers of an algebraicnumber field. The worstcase assumption we rely on is that in some `p length, it is hard to findapproximate shortest vectors in these lattices, under an appropriate form of preprocessing of the number field. Our results build upon prior works by Micciancio (FOCS 2002), Peikert andRosen (TCC 2006), and Lyubashevsky and Micciancio (ICALP 2006). For the connection factors fl(n) we achieve, the corresponding decisional promise problemson ideal lattices are not known to be NPhard; in fact, they are in P. However, the search approximation problems still appear to be very hard. Indeed, ideal lattices are wellstudiedobjects in computational number theory, and the best known algorithms for them seem to perform no better than the best known algorithms for general lattices.To obtain the best possible connection factor, we instantiate our constructions with infinite families of number fields having constant root discriminant. Such families are known to existand are computable, though no efficient construction is yet known. Our work motivates the search for such constructions. Even constructions of number fields having root discriminant upto O(n2/3ffl) would yield connection factors better than the current best of ~O(n).
Approximating Rings of Integers in Number Fields
, 1994
"... In this paper we study the algorithmic problem of finding the ring of integers of a given algebraic number field. In practice, this problem is often considered to be wellsolved, but theoretical results indicate that it is intractable for number fields that are defined by equations with very large ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
In this paper we study the algorithmic problem of finding the ring of integers of a given algebraic number field. In practice, this problem is often considered to be wellsolved, but theoretical results indicate that it is intractable for number fields that are defined by equations with very large coefficients. Such fields occur in the number field sieve algorithm for factoring integers. Applying a variant of a standard algorithm for finding rings of integers, one finds a subring of the number field that one may view as the "best guess" one has for the ring of integers. This best guess is probably often correct. Our main concern is what can be proved about this subring. We show that it has a particularly transparent local structure, which is reminiscent of the structure of tamely ramified extensions of local fields. A major portion of the paper is devoted to the study of rings that are "tame" in our more general sense. As a byproduct, we prove complexity results that elaborate upon a ...
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
"... Graph homomorphism problem has been studied intensively. Given an m × m symmetric matrix A, the graph homomorphism function is defined as ZA(G) = Aξ(u),ξ(v), ξ:V →[m] (u,v)∈E where G = (V, E) is any undirected graph. The function ZA(G) can encode many interesting graph properties, including counting ..."
Abstract

Cited by 15 (8 self)
 Add to MetaCart
Graph homomorphism problem has been studied intensively. Given an m × m symmetric matrix A, the graph homomorphism function is defined as ZA(G) = Aξ(u),ξ(v), ξ:V →[m] (u,v)∈E where G = (V, E) is any undirected graph. The function ZA(G) can encode many interesting graph properties, including counting vertex covers and kcolorings. We study the computational complexity of ZA(G) for arbitrary complex valued symmetric matrices A. Building on work by Dyer and Greenhill [6], Bulatov and Grohe [2], and especially the recent beautiful work by Goldberg,
Linear Differential Operators for Polynomial Equations
"... Given a squarefree polynomial P 2 k 0 [x; y], k 0 a number eld, we construct a linear dierential operator that allows one to calculate the genus of the complex curve dened by P = 0 (when P is absolutely irreducible), the absolute factorization of P over the algebraic closure of k 0 , and calculate i ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
Given a squarefree polynomial P 2 k 0 [x; y], k 0 a number eld, we construct a linear dierential operator that allows one to calculate the genus of the complex curve dened by P = 0 (when P is absolutely irreducible), the absolute factorization of P over the algebraic closure of k 0 , and calculate information concerning the Galois group of P over k 0 (x) as well as over k 0 (x).
Finiteness results for modular curves of genus at least 2
 Amer. J. Math
, 2005
"... Abstract. A curve X over Q is modular if it is dominated by X1(N) for some N; if in addition the image of its jacobian in J1(N) is contained in the new subvariety of J1(N), then X is called a new modular curve. We prove that for each g ≥ 2, the set of new modular curves over Q of genus g is finite a ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
Abstract. A curve X over Q is modular if it is dominated by X1(N) for some N; if in addition the image of its jacobian in J1(N) is contained in the new subvariety of J1(N), then X is called a new modular curve. We prove that for each g ≥ 2, the set of new modular curves over Q of genus g is finite and computable. For the computability result, we prove an algorithmic version of the de FranchisSeveri Theorem. Similar finiteness results are proved for new modular curves of bounded gonality, for new modular curves whose jacobian is a quotient of J0(N) new with N divisible by a prescribed prime, and for modular curves (new or not) with levels in a restricted set. We study new modular hyperelliptic curves in detail. In particular, we find all new modular curves of genus 2 explicitly, and construct what might be the complete list of all new modular hyperelliptic curves of all genera. Finally we prove that for each field k of characteristic zero and g ≥ 2, the set of genusg curves over k dominated by a Fermat curve is finite and computable. 1. Introduction. Let X1(N) be the usual modular curve over Q; see Section 3.1 for a definition. (All curves and varieties in this paper are smooth, projective, and geometrically integral, unless otherwise specified. When we write an affine equation for a curve, its smooth projective model is implied.) A curve X
A Montgomerylike Square Root for the Number Field Sieve
, 1998
"... The Number Field Sieve (NFS) is the asymptotically fastest factoring algorithm known. It had spectacular successes in factoring numbers of a special form. Then the method was adapted for general numbers, and recently applied to the RSA130 number [6], setting a new world record in factorization. Th ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
The Number Field Sieve (NFS) is the asymptotically fastest factoring algorithm known. It had spectacular successes in factoring numbers of a special form. Then the method was adapted for general numbers, and recently applied to the RSA130 number [6], setting a new world record in factorization. The NFS has undergone several modifications since its appearance. One of these modifications concerns the last stage: the computation of the square root of a huge algebraic number given as a product of hundreds of thousands of small ones. This problem was not satisfactorily solved until the appearance of an algorithm by Peter Montgomery. Unfortunately, Montgomery only published a preliminary version of his algorithm [15], while a description of his own implementation can be found in [7]. In this paper, we present a variant of the algorithm, compare it with the original algorithm, and discuss its complexity.
Algorithmic enumeration of ideal classes for quaternion orders
 SIAM J. Comput. (SICOMP
"... Abstract. We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the run time of these algorithms and consider several related problems, including the computation of twosided ideal ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
Abstract. We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the run time of these algorithms and consider several related problems, including the computation of twosided ideal classes, isomorphism classes of orders, connecting ideals for orders, and ideal principalization. We conclude by giving the complete list of definite Eichler orders with class number at most 2. Key words. quaternion algebras, maximal orders, ideal classes, number theory AMS subject classifications. 11R52 Since the very first calculations of Gauss for imaginary quadratic fields, the problem of computing the class group of a number field F has seen broad interest. Due to the evident close association between the class number and regulator (embodied in the Dirichlet class number formula), one often computes the class group and unit group in tandem as follows. Problem (ClassUnitGroup(ZF)). Given the ring of integers ZF of a number field F, compute the class group Cl ZF and unit group Z ∗ F.
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
Computing automorphisms of abelian number fields
 Math. Comput
, 1999
"... Abstract. Let L = Q(α) be an abelian number field of degree n. Most algorithms for computing the lattice of subfields of L require the computation of all the conjugates of α. This is usually achieved by factoring the minimal polynomial mα(x)ofαover L. In practice, the existing algorithms for factori ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
Abstract. Let L = Q(α) be an abelian number field of degree n. Most algorithms for computing the lattice of subfields of L require the computation of all the conjugates of α. This is usually achieved by factoring the minimal polynomial mα(x)ofαover L. In practice, the existing algorithms for factoring polynomials over algebraic number fields can handle only problems of moderate size. In this paper we describe a fast probabilistic algorithm for computing the conjugates of α, which is based on padic techniques. Given mα(x) anda rational prime p which does not divide the discriminant disc(mα(x)) of mα(x), the algorithm computes the Frobenius automorphism of p in time polynomial in the size of p and in the size of mα(x). By repeatedly applying the algorithm to randomly chosen primes it is possible to compute all the conjugates of α. 1.