Comparison theorems of Kolmogorov type and exact values of -widths on Hardy-Sobolev classes

Let be a strip in complex plane. denotes those -periodic, real-valued functions on which are analytic in the strip and satisfy the condition , . Osipenko and Wilderotter obtained the exact values of the Kolmogorov, linear, Gel'fand, and information -widths of in , , and 2-widths of in , , .

In this paper we continue their work. Firstly, we establish a comparison theorem of Kolmogorov type on , from which we get an inequality of Landau-Kolmogorov type. Secondly, we apply these results to determine the exact values of the Gel'fand -width of in , . Finally, we calculate the exact values of Kolmogorov -width, linear -width, and information -width of in , , .

     

A counterexample concerning the -projector onto linear spline spaces

For the -orthogonal projection onto spaces of linear splines over simplicial partitions in polyhedral domains in , , we show that in contrast to the one-dimensional case, where independently of the nature of the partition, in higher dimensions the -norm of cannot be bounded uniformly with respect to the partition. This fact is folklore among specialists in finite element methods and approximation theory but seemingly has never been formally proved.

     

Univariate splines: Equivalence of moduli of smoothness and applications

Several results on equivalence of moduli of smoothness of univariate splines are obtained. For example, it is shown that, for any , , and , the inequality , , is satisfied, where is a piecewise polynomial of degree on a quasi-uniform (i.e., the ratio of lengths of the largest and the smallest intervals is bounded by a constant) partition of an interval. Similar results for Chebyshev partitions and weighted Ditzian-Totik moduli of smoothness are also obtained. These results yield simple new constructions and allow considerable simplification of various known proofs in the area of constrained approximation by polynomials and splines.

     

On the embedding problem for representations

Let denote the double cover of corresponding to the element in where transpositions lift to elements of order and the product of two disjoint transpositions to elements of order . Given an elliptic curve , let denote its -torsion points. Under some conditions on elements in correspond to Galois extensions of with Galois group (isomorphic to) . In this work we give an interpretation of the addition law on such fields, and prove that the obstruction for having a Galois extension with gives a homomorphism . As a corollary we can prove (if has conductor divisible by few primes and high rank) the existence of -dimensional representations of the absolute Galois group of attached to and use them in some examples to construct modular forms mapping via the Shimura map to (the modular form of weight attached to) .

     

Two kinds of strong pseudoprimes up to

Let be an odd composite integer. Write with odd. If either mod or mod for some , then we say that is a strong pseudoprime to base , or spsp() for short. 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 efficient primality testing algorithm which is easy to implement. Thanks to Pomerance et al. and Jaeschke, the are known for . Conjectured values of were given by us in our previous papers (Math. Comp. 72 (2003), 2085-2097; 74 (2005), 1009-1024).

The main purpose of this paper is to give exact values of for ; to give a lower bound of : ; and to give reasons and numerical evidence of K2- and -spsp's to support the following conjecture: for any , where (resp. ) is the smallest K2- (resp. -) strong pseudoprime to all the first prime bases. For this purpose we describe procedures for computing and enumerating the two kinds of spsp's to the first 9 prime bases. The entire calculation took about 4000 hours on a PC Pentium IV/1.8GHz. (Recall that a K2-spsp is an spsp of the form: with primes and ; and that a -spsp is an spsp and a Carmichael number of the form: with each prime factor mod .)

     

On irregular prime power divisors of the Bernoulli numbers

Let ( ) denote the usual th Bernoulli number. Let be a positive even integer where or . It is well known that the numerator of the reduced quotient is a product of powers of irregular primes. Let be an irregular pair with . We show that for every the congruence has a unique solution where and . The sequence defines a -adic integer which is a zero of a certain -adic zeta function originally defined by T. Kubota and H. W. Leopoldt. We show some properties of these functions and give some applications. Subsequently we give several computations of the (truncated) -adic expansion of for irregular pairs with below 1000.

     

Real zeros of real odd Dirichlet -functions

Let be a real odd Dirichlet character of modulus , and let be the associated Dirichlet -function. As a consequence of the work of Low and Purdy, it is known that if and , , , then has no positive real zeros. By a simple extension of their ideas and the advantage of thirty years of advances in computational power, we are able to prove that if , then has no positive real zeros.

     

A second-order Magnus-type integrator for quasi-linear parabolic problems

In this paper, we consider an explicit exponential method of classical order two for the time discretisation of quasi-linear parabolic problems. The numerical scheme is based on a Magnus integrator and requires the evaluation of two exponentials per step. Our convergence analysis includes parabolic partial differential equations under a Dirichlet boundary condition and provides error estimates in Sobolev spaces. In an abstract formulation the initial boundary value problem is written as an initial value problem on a Banach space 

    given

involving the sectorial operator with domain independent of . Under reasonable regularity requirements on the problem, we prove the stability of the numerical method and derive error estimates in the norm of certain intermediate spaces between  and . Various applications and a numerical experiment illustrate the theoretical results.

     

Order of convergence of second order schemes based on the minmod limiter

Many second order accurate nonoscillatory schemes are based on the minmod limiter, e.g., the Nessyahu-Tadmor scheme. It is well known that the -error of monotone finite difference methods for the linear advection equation is of order for initial data in , . For second or higher order nonoscillatory schemes very little is known because they are nonlinear even for the simple advection equation. In this paper, in the case of a linear advection equation with monotone initial data, it is shown that the order of the -error for a class of second order schemes based on the minmod limiter is of order at least in contrast to the order for any formally first order scheme.

     

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.

     

Optimal two-dimensional interpolatory ternary subdivision schemes with two-ring stencils

For any interpolatory ternary subdivision scheme with two-ring stencils for a regular triangular or quadrilateral mesh, we show that the critical Hölder smoothness exponent of its basis function cannot exceed , where the critical Hölder smoothness exponent of a function is defined to be

On the other hand, for both regular triangular and quadrilateral meshes, we present several examples of interpolatory ternary subdivision schemes with two-ring stencils such that the critical Hölder smoothness exponents of their basis functions do achieve the optimal smoothness upper bound . Consequently, we obtain optimal smoothest interpolatory ternary subdivision schemes with two-ring stencils for the regular triangular and quadrilateral meshes. Our computation and analysis of optimal multidimensional subdivision schemes are based on the projection method and the -norm joint spectral radius.

     

On the distribution of zeros of the Hurwitz zeta-function

Assuming the Riemann hypothesis, we prove asymptotics for the sum of values of the Hurwitz zeta-function taken at the nontrivial zeros of the Riemann zeta-function when the parameter either tends to and , respectively, or is fixed; the case is of special interest since . If is fixed, we improve an older result of Fujii. Besides, we present several computer plots which reflect the dependence of zeros of on the parameter . Inspired by these plots, we call a zero of stable if its trajectory starts and ends on the critical line as varies from to , and we conjecture an asymptotic formula for these zeros.

     

Practical solution of the Diophantine equation

Let be an odd prime and , positive integers. In this note we prove that the problem of the determination of the integer solutions to the equation can be easily reduced to the resolution of the unit equation over . The solutions of the latter equation are given by Wildanger's algorithm.

     

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 .

     

Modular exponentiation via the explicit Chinese remainder theorem

Fix pairwise coprime positive integers . We propose representing integers modulo , where is any positive integer up to roughly , as vectors . We use this representation to obtain a new result on the parallel complexity of modular exponentiation: there is an algorithm for the Common CRCW PRAM that, given positive integers , , and in binary, of total bit length , computes in time using processors. For comparison, a parallelization of the standard binary algorithm takes superlinear time; Adleman and Kompella gave an expected time algorithm using processors; von zur Gathen gave an NC algorithm for the highly special case that is polynomially smooth.

     

Table of integrals of squared Jacobian elliptic functions and reductions of related hypergeometric -functions

Any product of real powers of Jacobian elliptic functions can be written in the form . If all three 's are even integers, the indefinite integral of this product with respect to is a constant times a multivariate hypergeometric function with half-odd-integral 's and , showing it to be an incomplete elliptic integral of the second kind unless all three 's are 0. Permutations of c, d, and n in the integrand produce the same permutations of the variables }, allowing as many as six integrals to take a unified form. Thirty -functions of the type specified, incorporating 136 integrals, are reduced to a new choice of standard elliptic integrals obtained by permuting , , and in , which is symmetric in its first two variables and has an efficient algorithm for numerical computation.

     

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.

     

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.

     

Computational estimation of the constant

The paper describes a computational estimation of the constant characterizing the bounds of . It is known that as

with , while the truth of the Riemann hypothesis would also imply that . In the range , two sets of estimates of are computed, one for increasingly small minima and another for increasingly large maxima of . As increases, the estimates in the first set rapidly fall below and gradually reach values slightly below , while the estimates in the second set rapidly exceed and gradually reach values slightly above . The obtained numerical results are discussed and compared to the implications of recent theoretical work of Granville and Soundararajan.

     

Computational estimation of the order of

The paper describes a search for increasingly large extrema (ILE) of in the range . For , the complete set of ILE (57 of them) was determined. In total, 162 ILE were found, and they suggest that . There are several regular patterns in the location of ILE, and arguments for these regularities are presented. The paper concludes with a discussion of prospects for further computational progress.