Determination of bounds for the solutions to those binary Diophantine equations that satisfy the hypotheses of Runge’s theorem

The product formula for the measure of representations of a quadratic form over the rational number field was found by Siegel, and were generalized by Fractman to the higher-dimensional case over totally real algebraic number fields. We prove product formulas for quadratic forms over arbitrary algebraic number fields and generalize formulas given by Siegel and Fractman to the case of arbitrary algebraic number fields.

The purpose of this note is to prove that the Shintani lift of Hilbert modular forms over algebraic number fields commutes with the action of Hecke operators. We show our assertion using the commutativity of the Shimura lift with Hecke operators and some properties of adjoint mappings. This commutativity of the Shintani lift plays an essential role for the proof of the Waldspurger-type theorem concerning the Fourier coefficients of modular forms of half-integral weight over arbitrary algebraic number fields.

Hecke theory over arbitrary number fields

An eigenvalue problem for Maxwell’s equations with anisotropic cubic nonlinearity is studied. The problem describes propagation of transverse magnetic waves in a dielectric layer filled with (nonlinear) anisotropic Kerr medium. The nonlinearity involves two non-negative parameters a, b that are usually small. In the case a = b = 0 one arrives at a linear problem that has a finite number of solutions (eigenvalues and eigenwaves). If a > 0, b ⩾ 0, then the nonlinear problem has infinitely many solutions; only a finite number of these solutions have linear counterparts. This shows that perturbation theory methods are inapplicable to study the problem in this case. For a = 0, b > 0 the nonlinear problem has a finite number of solutions; in this case each solution has a linear counterpart. Asymptotic distribution of the eigenvalues is found, periodicity of the eigenfunctions is proved and exact formula for the period is found, zeros of the eigenfunctions are determined, and a (nonlinear) eigenvalue comparison theorem is proved. Numerical experiments are presented.

Given an unstable finite-dimensional linear system, one can relate the existence of a memoryless feedback law stabilizing the system to the existence of a real solution of a set of multivariable polynomial inequalities. From these inequalities, a set of equalities may be constructed with two properties: the equality set has a real solution precisely when the inequality set does; generically the equality set has a finite number of solutions. Multivariable polynomial resultants provide a method of solving the equalities subject to the condition that the equalities have a finite number of solutions. The property that there is a finite number of solutions is established using some results of algebraic geometry.

This paper gives polynomial time quantum algorithms for computing the ideal class group (CGP) under the Generalized Riemann Hypothesis and solving the principal ideal problem (PIP) in number fields of arbitrary degree. These are are fundamental problems in number theory and they are connected to many unproven conjectures in both analytic and algebraic number theory. Previously the best known algorithms by Hallgren [20] only allowed to solve these problems in quantum polynomial time for number fields of constant degree. In a recent breakthrough, Eisentrager et al. [11] showed how to compute the unit group in arbitrary fields, thus opening the way to the resolution of CGP and PIP in the general case. For example, Biasse and Song [3] pointed out how to directly apply this result to solve PIP in classes of cyclotomic fields of arbitrary degree.The methods we introduce in this paper run in quantum polynomial time in arbitrary classes of number fields. They can be applied to solve other problems in computational number theory as well including computing the ray class group and solving relative norm equations. They are also useful for ongoing cryptanalysis of cryptographic schemes based on ideal lattices [5, 10].Our algorithms generalize the quantum algorithm for computing the (ordinary) unit group [11]. We first show that CGP and PIP reduce naturally to the computation of S-unit groups, which is another fundamental problem in number theory. Then we show an efficient quantum reduction from computing S-units to the continuous hidden subgroup problem introduced in [11]. This step is our main technical contribution, which involves careful analysis of the metrical properties of lattices to prove the correctness of the reduction. In addition, we show how to convert the output into an exact compact representation, which is convenient for further algebraic manipulations.

This paper gives polynomial time quantum algorithms for computing the ideal class group (CGP) under the Generalized Riemann Hypothesis and solving the principal ideal problem (PIP) in number fields of arbitrary degree. These are are fundamental problems in number theory and they are connected to many unproven conjectures in both analytic and algebraic number theory. Previously the best known algorithms by Hallgren [20] only allowed to solve these problems in quantum polynomial time for number fields of constant degree. In a recent breakthrough, Eisentrager et al. [11] showed how to compute the unit group in arbitrary fields, thus opening the way to the resolution of CGP and PIP in the general case. For example, Biasse and Song [3] pointed out how to directly apply this result to solve PIP in classes of cyclotomic fields of arbitrary degree.The methods we introduce in this paper run in quantum polynomial time in arbitrary classes of number fields. They can be applied to solve other problems in computational number theory as well including computing the ray class group and solving relative norm equations. They are also useful for ongoing cryptanalysis of cryptographic schemes based on ideal lattices [5, 10].Our algorithms generalize the quantum algorithm for computing the (ordinary) unit group [11]. We first show that CGP and PIP reduce naturally to the computation of S-unit groups, which is another fundamental problem in number theory. Then we show an efficient quantum reduction from computing S-units to the continuous hidden subgroup problem introduced in [11]. This step is our main technical contribution, which involves careful analysis of the metrical properties of lattices to prove the correctness of the reduction. In addition, we show how to convert the output into an exact compact representation, which is convenient for further algebraic manipulations.

In Theorem 2.5 in previous paper [4], we determined the Fourier coefficients of the image of Shimura correspondence of modular forms f of half integral weight over arbitrary algebraic number fields in terms of those of f. It seems that there is a gap in the proof. We give a correct proof of Theorem 2.5 in [4]. Moreover, we deduce useful formulas between the product of Fourier coefficients of f and the central value of quadratic twisted L-series associated with the image of Shimura correspondence of f .

The Dirichlet class number formula expresses the residue at s = 1 of the Dedekind zeta function ζ F(s) of an arbitrary algebraic number field F as the product of a simple factor (involving the class number of the field) with the determinant of a matrix whose entries are logarithms of units in the field. On the other hand, if F is a totally real number field of degree n, then a famous theorem by Klingen and Siegel says that the value ζ F (m) for every positive even integer in is a rational multiple of π mn In [52] and [53], a conjectural generalization of these two results was formulated according to which the special value ζ F (m) for arbitrary number fields F and positive integers m can be expressed in terms of special values of a transcendental function depending only on m, namely the m th classical polylogarithm function. These instances are expected to form part of a much more general picture in which a special value of an L-series of “motivic origin” is expressed in terms of some transcendental function. In this survey we collect some pieces fitting into and illustrating this picture.

We give a conditional bound for the average analytic rank of elliptic curves over an arbitrary number field. In particular, under the assumptions that all elliptic curves over a number field K are modular and have L-functions which satisfy the Generalized Riemann Hypothesis, we show that the average analytic rank of isomorphism classes of elliptic curves over K is bounded above by $(9\deg (K)+1)/2$ , when ordered by naive height. A key ingredient in the proof is giving asymptotics for the number of elliptic curves over an arbitrary number field with a prescribed local condition; these results are obtained by proving general results for counting points of bounded height on weighted projective stacks with a prescribed local condition, which may be of independent interest.

For an arbitrary (not totally real) number field K of degree ≥3, we ask how many perfect powers γ p of algebraic integers γ in K exist, such that μ(τ(γ p ))≤X for each embedding τ of K into the complex field. (X a large real parameter, p≥2 a fixed integer, and μ(z)=max(| Re (z)|,| Im (z)|) for any complex z.) This quantity is evaluated asymptotically in the form c p,K X n/p +R p,K (X), with sharp estimates for the remainder R p,K (X). The argument uses techniques from lattice point theory along with W. Schmidt’s multivariate extension of K.F. Roth’s result on the approximation of algebraic numbers by rationals.

Computing the group of units in a field of algebraic numbers is one of the central tasks of computational algebraic number theory. It is believed to be hard classically, which is of interest for cryptography. In the quantum setting, efficient algorithms were previously known for fields of constant degree. We give a quantum algorithm that is polynomial in the degree of the field and the logarithm of its discriminant. This is achieved by combining three new results. The first is a classical algorithm for computing a basis for certain ideal lattices with doubly exponentially large generators. The second shows that a Gaussian-weighted superposition of lattice points, with an appropriate encoding, can be used to provide a unique representation of a real-valued lattice. The third is an extension of the hidden subgroup problem to continuous groups and a quantum algorithm for solving the HSP over the group Rn.

On the Fourier coefficients of Hilbert–Maass wave forms of half integral weight over arbitrary algebraic number fields

A note on odd zeta values over any number field and extended Eisenstein series

O-minimality on twisted universal torsors and Manin's conjecture over number fields