Upper bounds for the prime divisors of Wendt's determinant

Let be an even integer, . The resultant of the polynomials and is known as Wendt's determinant of order . We prove that among the prime divisors of only those which divide or can be larger than , where and is the th Lucas number, except when and . Using this estimate we derive criteria for the nonsolvability of Fermat's congruence.

     

Limiting set of second order spectra

Let be a self-adjoint operator acting on a Hilbert space . A complex number is in the second order spectrum of relative to a finite-dimensional subspace iff the truncation to of is not invertible. This definition was first introduced in Davies, 1998, and according to the results of Levin and Shargorodsky in 2004, these sets provide a method for estimating eigenvalues free from the problems of spectral pollution. In this paper we investigate various aspects related to the issue of approximation using second order spectra. Our main result shows that under fairly mild hypothesis on the uniform limit of these sets, as increases towards , contain the isolated eigenvalues of of finite multiplicity. Therefore, unlike the majority of the standard methods, second order spectra combine nonpollution and approximation at a very high level of generality.

     

Finding strong pseudoprimes to several bases

Define to be the smallest strong pseudoprime to all the first prime bases. If we know the exact value of , we will have, for integers , a deterministic primality testing algorithm which is not only easier to implement but also faster than either the Jacobi sum test or the elliptic curve test. Thanks to Pomerance et al. and Jaeschke, are known for . Upper bounds for were given by Jaeschke.

In this paper we tabulate all strong pseudoprimes (spsp's) to the first ten prime bases which have the form with odd primes and There are in total 44 such numbers, six of which are also spsp(31), and three numbers are spsp's to both bases 31 and 37. As a result the upper bounds for and are lowered from 28- and 29-decimal-digit numbers to 22-decimal-digit numbers, and a 24-decimal-digit upper bound for is obtained. The main tools used in our methods are the biquadratic residue characters and cubic residue characters. We propose necessary conditions for to be a strong pseudoprime to one or to several prime bases. Comparisons of effectiveness with both Jaeschke's and Arnault's methods are given.

     

On the uniformity of distribution of the RSA pairs

Let be a product of two distinct primes and . We show that for almost all exponents with the RSA pairs are uniformly distributed modulo when runs through

the group of units modulo (that is, as in the classical RSA scheme);

the set of -products , , where are selected at random (that is, as in the recently introduced RSA scheme with precomputation).

These results are based on some new bounds of exponential sums.

     

The -approximation order of surface spline interpolation

We show that if the open, bounded domain has a sufficiently smooth boundary and if the data function is sufficiently smooth, then the -norm of the error between and its surface spline interpolant is ( ), where and is an integer parameter specifying the surface spline. In case , this lower bound on the approximation order agrees with a previously obtained upper bound, and so we conclude that the -approximation order of surface spline interpolation is .

     

Bounds on differences of adjacent zeros of Bessel functions and iterative relations between consecutive zeros

Bounds for the distance between adjacent zeros of cylinder functions are given; and are such that ; stands for the th positive zero of the cylinder (Bessel) function , , .

These bounds, together with the application of modified (global) Newton methods based on the monotonic functions and , give rise to forward ( ) and backward ( ) iterative relations between consecutive zeros of cylinder functions.

The problem of finding all the positive real zeros of Bessel functions for any real and inside an interval , 0$">, is solved in a simple way.

     

Tenth degree number fields with quintic fields having one real place

In this paper, we enumerate all number fields of degree of discriminant smaller than in absolute value containing a quintic field having one real place. For each one of the (resp. found fields of signature (resp. the field discriminant, the quintic field discriminant, a polynomial defining the relative quadratic extension, the corresponding relative discriminant, the corresponding polynomial over , and the Galois group of the Galois closure are given.

In a supplementary section, we give the first coincidence of discriminant of (resp. nonisomorphic fields of signature (resp. .

     

The 192 solutions of the Heun equation

A machine-generated list of local solutions of the Heun equation is given. They are analogous to Kummer's  solutions of the Gauss hypergeometric equation, since the two equations are canonical Fuchsian differential equations on the Riemann sphere with four and three singular points, respectively. Tabulation is facilitated by the identification of the automorphism group of the equation with  singular points as the Coxeter group  . Each of the expressions is labeled by an element of  . Of the ,  are equivalent expressions for the local Heun function  , and it is shown that the resulting order- group of transformations of  is isomorphic to the symmetric group . The isomorphism encodes each transformation as a permutation of an abstract four-element set, not identical to the set of singular points.

     

Computing the tame kernel of quadratic imaginary fields

J. Tate has determined the group (called the tame kernel) for six quadratic imaginary number fields where Modifying the method of Tate, H. Qin has done the same for and and M. Skaba for and

In the present paper we discuss the methods of Qin and Skaba, and we apply our results to the field

In the Appendix at the end of the paper K. Belabas and H. Gangl present the results of their computation of for some other values of The results agree with the conjectural structure of given in the paper by Browkin and Gangl.

     

Korovkin tests, approximation, and ergodic theory

We consider sequences of matrices with a block structure spectrally distributed as an -variate matrix-valued function , and, for any , we suppose that is a linear and positive operator. For every fixed we approximate the matrix in a suitable linear space of matrices by minimizing the Frobenius norm of when ranges over . The minimizer is denoted by . We show that only a simple Korovkin test over a finite number of polynomial test functions has to be performed in order to prove the following general facts:

1.

the sequence is distributed as ,

2.

the sequence is distributed as the constant function (i.e. is spectrally clustered at zero).

The first result is an ergodic one which can be used for solving numerical approximation theory problems. The second has a natural interpretation in the theory of the preconditioning associated to cg-like algorithms.