Random Fibonacci sequences and the number

For the familiar Fibonacci sequence (defined by , and for ), increases exponentially with at a rate given by the golden ratio . But for a simple modification with both additions and subtractions - the random Fibonacci sequences defined by , and for , , where each sign is independent and either or - with probability - it is not even obvious if should increase with . Our main result is that

with probability . Finding the number involves the theory of random matrix products, Stern-Brocot division of the real line, a fractal measure, a computer calculation, and a rounding error analysis to validate the computer calculation.

     

The Postage Stamp Problem: An algorithm to determine the

Given an integral ``stamp" basis with and a positive integer , we define the -range as

. For given and , the extremal basis has the largest possible extremal -range

We give an algorithm to determine the -range. We prove some properties of the -range formula, and we conjecture its form for the extremal -range. We consider parameter bases , where the basis elements are given functions of . For we conjecture the extremal parameter bases for .

     

Computation of relative class numbers of CM-fields by using Hecke -functions

We develop an efficient technique for computing values at of Hecke -functions. We apply this technique to the computation of relative class numbers of non-abelian CM-fields which are abelian extensions of some totally real subfield . We note that the smaller the degree of the more efficient our technique is. In particular, our technique is very efficient whenever instead of simply choosing (the maximal totally real subfield of ) we can choose real quadratic. We finally give examples of computations of relative class numbers of several dihedral CM-fields of large degrees and of several quaternion octic CM-fields with large discriminants.

     

Double roots of power series and related matters

For a given collection of distinct arguments , multiplicities and a real interval containing zero, we are interested in determining the smallest for which there is a power series with coefficients in , and roots of order respectively. We denote this by . We describe the usual form of the extremal series (we give a sufficient condition which is also necessary when the extremal series possesses at least non-dependent coefficients strictly inside , where is 1 or 2 as is real or complex). We focus particularly on , the size of the smallest double root of a power series lying on a given ray (of interest in connection with the complex analogue of work of Boris Solomyak on the distribution of the random series ). We computed the value of for the rationals in of denominator less than fifty. The smallest value we encountered was . For the one-sided intervals and the corresponding smallest values were and .

     

On the modular curves

Let denote an elliptic curve over and the modular curve classifying the elliptic curves over such that the representations of in the 7-torsion points of and of are symplectically isomorphic. In case is given by a Weierstraß equation such that the invariant is a square, we exhibit here nontrivial points of . From this we deduce an infinite family of curves for which has at least four nontrivial points.

     

Nonexistence conditions of a solution for the congruence

We obtain nonexistence conditions of a solution for of the congruence , where , and are integers, and is a prime power. We give nonexistence conditions of the form for , , , , , and of the form for , , , . Furthermore, we complete some tables concerned with Waring's problem in -adic fields that were computed by Hardy and Littlewood.

     

The number of primes is finite

For a positive integer let and let . The number of primes of the form is finite, because if , then is divisible by . The heuristic argument is given by which there exists a prime such that for all large ; a computer check however shows that this prime has to be greater than . The conjecture that the numbers are squarefree is not true because .

     

Families of irreducible polynomials of Gaussian periods and matrices of cyclotomic numbers

Given an odd prime we show a way to construct large families of polynomials , , where is a set of primes of the form mod and is the irreducible polynomial of the Gaussian periods of degree in . Examples of these families when are worked in detail. We also show, given an integer and a prime mod , how to represent by matrices the Gaussian periods of degree in , and how to calculate in a simple way, with the help of a computer, irreducible polynomials for elements of .

     

Solving polynomials by radicals with roots of unity in minimum depth

Let be an algebraic number field. Let be a root of a polynomial which is solvable by radicals. Let be the splitting field of over . Let be a natural number divisible by the discriminant of the maximal abelian subextension of , as well as the exponent of , the Galois group of over . We show that an optimal nested radical with roots of unity for can be effectively constructed from the derived series of the solvable Galois group of over .

     

Computing rational points on rank 1 elliptic curves via -series and canonical heights

Let be an elliptic curve of rank 1. We describe an algorithm which uses the value of and the theory of canonical heghts to efficiently search for points in and . For rank 1 elliptic curves of moderately large conductor (say on the order of to ) and with a generator having moderately large canonical height (say between 13 and 50), our algorithm is the first practical general purpose method for determining if the set contains non-torsion points.

     

Normal bases via general Gauss periods

Gauss periods have been used successfully as a tool for constructing normal bases in finite fields. Starting from a primitive th root of unity, one obtains under certain conditions a normal basis for over , where is a prime and for some integer . We generalize this construction by allowing arbitrary integers with , and find in many cases smaller values of than is possible with the previously known approach.

     

A quasi-randomized Runge-Kutta method

We analyze a quasi-Monte Carlo method to solve the initial-value problem for a system of differential equations . The function is smooth in and we suppose that and are of bounded variation in and that is bounded in a neighborhood of the graph of the solution. The method is akin to the second order Heun method of the Runge-Kutta family. It uses a quasi-Monte Carlo estimate of integrals. The error bound involves the square of the step size as well as the discrepancy of the point set used for quasi-Monte Carlo approximation. Numerical experiments show that the quasi-randomized method outperforms a recently proposed randomized numerical method.

     

Zeros of 2-adic -functions and congruences for class numbers and fundamental units

We study the imaginary quadratic fields such that the Iwasawa -invariant equals 1, obtaining information on zeros of -adic -functions and relating this to congruences for fundamental units and class numbers.

     

A new bound for the smallest

Let denote the number of primes and let denote the usual integral logarithm of . We prove that there are at least integer values of in the vicinity of with . This improves earlier bounds of Skewes, Lehman, and te Riele. We also plot more than 10000 values of in four different regions, including the regions discovered by Lehman, te Riele, and the authors of this paper, and a more distant region in the vicinity of , where appears to exceed by more than . The plots strongly suggest, although upper bounds derived to date for are not sufficient for a proof, that exceeds for at least integers in the vicinity of . If it is possible to improve our bound for by finding a sign change before , our first plot clearly delineates the potential candidates. Finally, we compute the logarithmic density of and find that as departs from the region in the vicinity of , the density is , and that it varies from this by no more than over the next integers. This should be compared to Rubinstein and Sarnak.

     

Computing

Let denote the Von Mangoldt function and . We describe an elementary method for computing isolated values of . The complexity of the algorithm is time and space. A table of values of for up to is included, and some times of computation are given.

     

Computing automorphisms of abelian number fields

Let be an abelian number field of degree . Most algorithms for computing the lattice of subfields of require the computation of all the conjugates of . This is usually achieved by factoring the minimal polynomial of over . 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 -adic techniques. Given and a rational prime which does not divide the discriminant of , the algorithm computes the Frobenius automorphism of in time polynomial in the size of and in the size of . By repeatedly applying the algorithm to randomly chosen primes it is possible to compute all the conjugates of .

     

Continuous-time Kreiss resolvent condition on infinite-dimensional spaces

Given the infinitesimal generator of a -semigroup on the Banach space which satisfies the Kreiss resolvent condition, i.e., there exists an such that for all complex with positive real part, we show that for general Banach spaces this condition does not give any information on the growth of the associated -semigroup. For Hilbert spaces the situation is less dramatic. In particular, we show that the semigroup can grow at most like . Furthermore, we show that for every there exists an infinitesimal generator satisfying the Kreiss resolvent condition, but whose semigroup grows at least like . As a consequence, we find that for with the standard Euclidian norm the estimate cannot be replaced by a lower power of or .

     

Error estimates for 3- narrow finite elements

We obtain error estimates for finite element approximations of the lowest degree valid uniformly for a class of three-dimensional narrow elements. First, for the Lagrange interpolation we prove optimal error estimates, both in order and regularity, in for . For it is known that this result is not true. Applying extrapolation results we obtain an optimal order error estimate for functions sligthly more regular than . These results are valid both for tetrahedral and rectangular elements. Second, for the case of rectangular elements, we obtain optimal, in order and regularity, error estimates for an average interpolation valid for functions in with and .

     

On fundamental domains of arithmetic Fuchsian groups

Let be a totally real algebraic number field and an order in a quaternion algebra over . Assume that the group of units in with reduced norm equal to is embedded into as an arithmetic Fuchsian group. It is shown how Ford's algorithm can be effectively applied in order to determine a fundamental domain of as well as a complete system of generators of .

     

Finding -strong pseudoprimes

Let be odd primes and . Put

Then we call the kernel, the triple the signature, and the height of , respectively. We call a -number if it is a Carmichael number with each prime factor . If is a -number and a strong pseudoprime to the bases for , we call a -spsp . Since -numbers have probability of error (the upper bound of that for the Rabin-Miller test), they often serve as the exact values or upper bounds of (the smallest strong pseudoprime to all the first prime bases). If we know the exact value of , we will have, for integers , a deterministic efficient primality testing algorithm which is easy to implement.

In this paper, we first describe an algorithm for finding -spsp(2)'s, to a given limit, with heights bounded. There are in total -spsp's with heights . We then give an overview of the 21978 - spsp(2)'s and tabulate of them, which are -spsp's to the first prime bases up to ; three numbers are spsp's to the first 11 prime bases up to 31. No -spsp's to the first prime bases with heights were found. We conjecture that there exist no -spsp's to the first prime bases with heights and so that

which was found by the author in an earlier paper. We give reasons to support the conjecture. The main idea of our method for finding those -spsp's is that we loop on candidates of signatures and kernels with heights bounded, subject those candidates of -spsp's and their prime factors to Miller's tests, and obtain the desired numbers. At last we speed our algorithm for finding larger -spsp's, say up to , with a given signature to more prime bases. Comparisons of effectiveness with Arnault's and our previous methods for finding -strong pseudoprimes to the first several prime bases are given.