Computing weight modular forms of level

For a prime we describe an algorithm for computing the Brandt matrices giving the action of the Hecke operators on the space of modular forms of weight and level . For we define a special Hecke stable subspace of which contains the space of modular forms with CM by the ring of integers of and we describe the calculation of the corresponding Brandt matrices.

     

-class groups of certain extensions of degree

Let be an odd prime number. In this article we study the distribution of -class groups of cyclic number fields of degree , and of cyclic extensions of degree of an imaginary quadratic field whose class number is coprime to . We formulate a heuristic principle predicting the distribution of the -class groups as Galois modules, which is analogous to the Cohen-Lenstra heuristics concerning the prime-to--part of the class group, although in our case we have to fix the number of primes that ramify in the extensions considered. Using results of Gerth we are able to prove part of this conjecture. Furthermore, we present some numerical evidence for the conjecture.

     

On the nonexistence of -cycles for the problem

This article generalizes a proof of Steiner for the nonexistence of -cycles for the problem to a proof for the nonexistence of -cycles. A lower bound for the cycle length is derived by approximating the ratio between numbers in a cycle. An upper bound is found by applying a result of Laurent, Mignotte, and Nesterenko on linear forms in logarithms. Finally numerical calculation of convergents of shows that -cycles cannot exist.

     

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.

     

On the greatest prime factor of with effective constants

Let denote a prime. In this article we provide the first published lower bounds for the greatest prime factor of exceeding in which the constants are effectively computable. As a result we prove that it is possible to calculate a value such that for every x_0$"> there is a with the greatest prime factor of exceeding . The novelty of our approach is the avoidance of any appeal to Siegel's Theorem on primes in arithmetic progression.

     

Balanced multi-wavelets in

The notion of -balancing was introduced a few years ago as a condition for the construction of orthonormal scaling function vectors and multi-wavelets to ensure the property of preservation/annihilation of scalar-valued discrete polynomial data of order (or degree ), when decomposed by the corresponding matrix-valued low-pass/high-pass filters. While this condition is indeed precise, to the best of our knowledge only the proof for is known. In addition, the formulation of the -balancing condition for is so prohibitively difficult to satisfy that only a very few examples for and vector dimension 2 have been constructed in the open literature. The objective of this paper is to derive various characterizations of the -balancing condition that include the polynomial preservation property as well as equivalent formulations that facilitate the development of methods for the construction purpose. These results are established in the general multivariate and bi-orthogonal settings for any .

     

Solutions of the congruence

To supplement existing data, solutions of are tabulated for primes with and . For , five new solutions 2^{32}$"> are presented. One of these, for , also satisfies the ``reverse' congruence . An effective procedure for searching for such ``double solutions' is described and applied to the range , . Previous to this, congruences are generally considered for any and fixed prime to see where the smallest prime solution occurs.

     

Error estimates on anisotropic elements for functions in weighted Sobolev spaces

In this paper we prove error estimates for a piecewise average interpolation on anisotropic rectangular elements, i.e., rectangles with sides of different orders, in two and three dimensions.

Our error estimates are valid under the condition that neighboring elements have comparable size. This is a very mild assumption that includes more general meshes than those allowed in previous papers. In particular, strong anisotropic meshes arising naturally in the approximation of problems with boundary layers fall under our hypotheses.

Moreover, we generalize the error estimates allowing on the right-hand side some weighted Sobolev norms. This extension is of interest in singularly perturbed problems.

Finally, we consider the approximation of functions vanishing on the boundary by finite element functions with the same property, a point that was not considered in previous papers on average interpolations for anisotropic elements.

As an application we consider the approximation of a singularly perturbed reaction-diffusion equation and show that, as a consequence of our results, almost optimal order error estimates in the energy norm, valid uniformly in the perturbation parameter, can be obtained.

     

Superconvergence of spectral collocation and -version methods in one dimensional problems

Superconvergence phenomenon of the Legendre spectral collocation method and the -version finite element method is discussed under the one dimensional setting. For a class of functions that satisfy a regularity condition (M): on a bounded domain, it is demonstrated, both theoretically and numerically, that the optimal convergent rate is supergeometric. Furthermore, at proper Gaussian points or Lobatto points, the rate of convergence may gain one or two orders of the polynomial degree.

     

The Diophantine Equation

We show that, within the hypercube , the Diophantine equation admits essentially one and only one nontrivial solution, namely . The investigation is based on a systematic search by computer.

     

A local Lagrange interpolation method based on cubic splines on Freudenthal partitions

A trivariate Lagrange interpolation method based on cubic splines is described. The splines are defined over a special refinement of the Freudenthal partition of a cube partition. The interpolating splines are uniquely determined by data values, but no derivatives are needed. The interpolation method is local and stable, provides optimal order approximation, and has linear complexity.

     

Hermite interpolation by Pythagorean Hodograph space curves

We solve the problem of Hermite interpolation by Pythagorean Hodograph (PH) space curves. More precisely, for any set of space boundary data (two points with associated first and second derivatives) we construct a four-dimensional family of PH interpolants of degree and introduce a geometrically invariant parameterization of this family. This parameterization is used to identify a particular solution, which has the following properties. First, it preserves planarity, i.e., the interpolant to planar data is a planar PH curve. Second, it has the best possible approximation order 6. Third, it is symmetric in the sense that the interpolant of the ``reversed' set of boundary data is simply the ``reversed' original interpolant. This particular PH interpolant is exploited for designing algorithms for converting (possibly piecewise) analytical curves into a piecewise PH curve of degree which is globally , and for simple rational approximation of pipe surfaces with a piecewise analytical spine curve. The algorithms are presented along with an analysis of their error and approximation order.

     

New irrationality measures for -logarithms

The three main methods used in diophantine analysis of -series are combined to obtain new upper bounds for irrationality measures of the values of the -logarithm function

when and .

     

Specialized Runge-Kutta methods for index differential-algebraic equations

We consider the numerical solution of systems of semi-explicit index differential-algebraic equations (DAEs) by methods based on Runge-Kutta (RK) coefficients. For nonstiffly accurate RK coefficients, such as Gauss and Radau IA coefficients, the standard application of implicit RK methods is generally not superconvergent. To reestablish superconvergence projected RK methods and partitioned RK methods have been proposed. In this paper we propose a simple alternative which does not require any extra projection step and does not use any additional internal stage. Moreover, symmetry of Gauss methods is preserved. The main idea is to replace the satisfaction of the constraints at the internal stages in the standard definition by enforcing specific linear combinations of the constraints at the numerical solution and at the internal stages to vanish. We call these methods specialized Runge-Kutta methods for index DAEs (SRK-DAE).

     

Refinable bivariate quartic -splines for multi-level data representation and surface display

In this paper, a second-order Hermite basis of the space of -quartic splines on the six-directional mesh is constructed and the refinable mask of the basis functions is derived. In addition, the extra parameters of this basis are modified to extend the Hermite interpolating property at the integer lattices by including Lagrange interpolation at the half integers as well. We also formulate a compactly supported super function in terms of the basis functions to facilitate the construction of quasi-interpolants to achieve the highest (i.e., fifth) order of approximation in an efficient way. Due to the small (minimum) support of the basis functions, the refinable mask immediately yields (up to) four-point matrix-valued coefficient stencils of a vector subdivision scheme for efficient display of -quartic spline surfaces. Finally, this vector subdivision approach is further modified to reduce the size of the coefficient stencils to two-point templates while maintaining the second-order Hermite interpolating property.

     

Integer points on the curve

We completely solve diophantine equations of the form where is a positive integer, using a reduction to some quartic elliptic equations, which can be solved with well known methods.

     

Five-dimensional -optimal lattice rules

A major search program is described that has been used to determine a set of five-dimensional -optimal lattice rules of enhanced trigonometric degrees up to 12. The program involved a distributed search, in which approximately 190 CPU-years were shared between more than 1,400 computers in many parts of the world.

     

Rational Landen transformations on

The Landen transformation preserves the value of an elliptic integral, and its iteration produces the classical arithmetic-geometric mean AGM. We present analogous transformations for rational functions integrated over the whole real line.

     

Normal integral bases for extensions of the rationals

We give an algorithm for constructing normal integral bases of tame Galois extensions of the rationals with group . Using earlier works we can do the same until degree .