On the minimal polynomial of Gauss periods for prime powers

For a positive integer , set and let denote the group of reduced residues modulo . Fix a congruence group of conductor and of order . Choose integers to represent the cosets of in . The Gauss periods

corresponding to are conjugate and distinct over with minimal polynomial

To determine the coefficients of the period polynomial (or equivalently, its reciprocal polynomial is a classical problem dating back to Gauss. Previous work of the author, and Gupta and Zagier, primarily treated the case , an odd prime, with fixed. In this setting, it is known for certain integral power series and , that for any positive integer

holds in for all primes except those in an effectively determinable finite set. Here we describe an analogous result for the case , a prime power ( ). The methods extend for odd prime powers to give a similar result for certain twisted Gauss periods of the form

where denotes the usual Legendre symbol and .

     

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 .

     

The monic integer transfinite diameter

We study the problem of finding nonconstant monic integer polynomials, normalized by their degree, with small supremum on an interval . The monic integer transfinite diameter is defined as the infimum of all such supremums. We show that if has length , then .

We make three general conjectures relating to the value of for intervals of length less than . We also conjecture a value for where . We give some partial results, as well as computational evidence, to support these conjectures.

We define functions and , which measure properties of the lengths of intervals with on either side of . Upper and lower bounds are given for these functions.

We also consider the problem of determining when is a Farey interval. We prove that a conjecture of Borwein, Pinner and Pritsker concerning this value is true for an infinite family of Farey intervals.

     

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.

     

Iterated function systems, Ruelle operators, and invariant projective measures

We introduce a Fourier-based harmonic analysis for a class of discrete dynamical systems which arise from Iterated Function Systems. Our starting point is the following pair of special features of these systems. (1) We assume that a measurable space comes with a finite-to-one endomorphism which is onto but not one-to-one. (2) In the case of affine Iterated Function Systems (IFSs) in , this harmonic analysis arises naturally as a spectral duality defined from a given pair of finite subsets in of the same cardinality which generate complex Hadamard matrices.

Our harmonic analysis for these iterated function systems (IFS) is based on a Markov process on certain paths. The probabilities are determined by a weight function on . From we define a transition operator acting on functions on , and a corresponding class of continuous -harmonic functions. The properties of the functions in are analyzed, and they determine the spectral theory of . For affine IFSs we establish orthogonal bases in . These bases are generated by paths with infinite repetition of finite words. We use this in the last section to analyze tiles in .

     

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.

     

Extrapolation methods and derivatives of limits of sequences

Let be an infinite sequence whose limit or antilimit can be approximated very efficiently by applying a suitable extrapolation method E to . Assume that the and hence also are differentiable functions of some parameter , being the limit or antilimit of , and that we need to approximate . A direct way of achieving this would be by applying again a suitable extrapolation method E to the sequence , and this approach has often been used efficiently in various problems of practical importance. Unfortunately, as has been observed at least in some important cases, when and have essentially different asymptotic behaviors as , the approximations to produced by this approach, despite the fact that they are good, do not converge as quickly as those obtained for , and this is puzzling. In this paper we first give a rigorous mathematical explanation of this phenomenon for the cases in which E is the Richardson extrapolation process and E is a generalization of it, thus showing that the phenomenon has very little to do with numerics. Following that, we propose a procedure that amounts to first applying the extrapolation method E to and then differentiating the resulting approximations to , and we provide a thorough convergence and stability analysis in conjunction with the Richardson extrapolation process. It follows from this analysis that the new procedure for has practically the same convergence properties as E for . We show that a very efficient way of implementing the new procedure is by actually differentiating the recursion relations satisfied by the extrapolation method used, and we derive the necessary algorithm for the Richardson extrapolation process. We demonstrate the effectiveness of the new approach with numerical examples that also support the theory. We discuss the application of this approach to numerical integration in the presence of endpoint singularities. We also discuss briefly its application in conjunction with other extrapolation methods.

     

Littlewood polynomials with high order zeros

Let be the minimal length of a polynomial with coefficients divisible by . Byrnes noted that for each , and asked whether in fact . Boyd showed that for all , but . He further showed that , and that is one of the 5 numbers , or . Here we prove that . Similarly, let be the maximal power of dividing some polynomial of degree with coefficients. Boyd was able to find for . In this paper we determine for .

     

Lower bounds for the condition number of a real confluent Vandermonde matrix

Lower bounds on the condition number of a real confluent Vandermonde matrix are established in terms of the dimension , or and the largest absolute value among all nodes that define the confluent Vandermonde matrix and the interval that contains the nodes. In particular, it is proved that for any modest (the largest multiplicity of distinct nodes), behaves no smaller than , or than if all nodes are nonnegative. It is not clear whether those bounds are asymptotically sharp for modest .

     

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.

     

Sharpening ``Primes is in P' for a large family of numbers

We present algorithms that are deterministic primality tests for a large family of integers, namely, integers for which an integer is given such that the Jacobi symbol , and integers for which an integer is given such that . The algorithms we present run in time, where is the exact power of dividing when and if . The complexity of our algorithms improves up to when . We also give tests for a more general family of numbers and study their complexity.

     

Special prime numbers and discrete logs in finite prime fields

A set of primes involving numbers such as , where and , is defined. An algorithm for computing discrete logs in the finite field of order with is suggested. Its heuristic expected running time is for , where as , , and . At present, the most efficient algorithm for computing discrete logs in the finite field of order for general is Schirokauer's adaptation of the Number Field Sieve. Its heuristic expected running time is for . Using rather than general does not enhance the performance of Schirokauer's algorithm. The definition of the set and the algorithm suggested in this paper are based on a more general congruence than that of the Number Field Sieve. The congruence is related to the resultant of integer polynomials. We also give a number of useful identities for resultants that allow us to specify this congruence for some .

     

A priori error estimates for Galerkin approximations to porous medium and fast diffusion equations

Galerkin approximations to solutions of a Cauchy-Dirichlet problem governed by the generalized porous medium equation

on bounded convex domains are considered. The range of the parameter includes the fast diffusion case . Using an Euler finite difference approximation in time, the semi-discrete solution is shown to converge to the exact solution in norm with an error controlled by for and for . For the fully discrete problem, a global convergence rate of in norm is shown for the range . For , a rate of is shown in norm.

     

Newton-Cotes integration for approximating Stieltjes (generalized Euler) constants

In the Laurent expansion

of the Riemann-Hurwitz zeta function, the coefficients are known as Stieltjes, or generalized Euler, constants. [When , (the Riemann zeta function), and .] We present a new approach to high-precision approximation of . Plots of our results reveal much structure in the growth of the generalized Euler constants. Our results when for , and when for (for such as 53/100, 1/2, etc.) suggest that published bounds on the growth of the Stieltjes constants can be much improved, and lead to several conjectures. Defining , we conjecture that is attained: for any given , for some (and similarly that, given and , is within of for infinitely many ). In addition we conjecture that satisfies for 1$">. We also conjecture that , a special case of a more general conjecture relating the values of and for . Finally, it is known that for . Using this to define for all real 0$">, we conjecture that for nonintegral , is precisely times the -th (Weyl) fractional derivative at of the entire function . We also conjecture that , now defined for all real arguments 0$">, is smooth. Our numerical method uses Newton-Cotes integration formulae for very high-degree interpolating polynomials; it differs in implementation from, but compares in error bounding to, Euler-Maclaurin summation based methods.

     

On the optimal convergence rate of universal and nonuniversal algorithms for multivariate integration and approximation

We study the maximal rate of convergence (mrc) of algorithms for (multivariate) integration and approximation of -variate functions from reproducing kernel Hilbert spaces . Here is an arbitrary kernel all of whose partial derivatives up to order satisfy a Hölder-type condition with exponent . Algorithms use function values and we analyze their rate of convergence as tends to infinity. We focus on universal algorithms which depend on , , and but not on the specific kernel , and nonuniversal algorithms which may depend additionally on .

For universal algorithms the mrc is for both integration and approximation, and for nonuniversal algorithms it is for integration and with for approximation. Hence, the mrc for universal algorithms suffers from the curse of dimensionality if is large relative to , whereas the mrc for nonuniversal algorithms does not since it is always at least for integration, and for approximation. This is the price we have to pay for using universal algorithms. On the other hand, if is large relative to , then the mrc for universal and nonuniversal algorithms is approximately the same.

We also consider the case when we have the additional knowledge that the kernel has product structure, . Here are some univariate kernels whose all derivatives up to order satisfy a Hölder-type condition with exponent . Then the mrc for universal algorithms is for both integration and approximation, and for nonuniversal algorithms it is for integration and with for approximation. If or for all , then the mrc is at least , and the curse of dimensionality is not present. Hence, the product form of reproducing kernels breaks the curse of dimensionality even for universal algorithms.

     

Tractability of quasilinear problems II: Second-order elliptic problems

In a previous paper, we developed a general framework for establishing tractability and strong tractability for quasilinear multivariate problems in the worst case setting. One important example of such a problem is the solution of the Helmholtz equation in the -dimensional unit cube, in which depends linearly on , but nonlinearly on . Here, both and  are -variate functions from a reproducing kernel Hilbert space with finite-order weights of order . This means that, although  can be arbitrarily large, and  can be decomposed as sums of functions of at most  variables, with independent of .

In this paper, we apply our previous general results to the Helmholtz equation, subject to either Dirichlet or Neumann homogeneous boundary conditions. We study both the absolute and normalized error criteria. For all four possible combinations of boundary conditions and error criteria, we show that the problem is tractable. That is, the number of evaluations of and  needed to obtain an -approximation is polynomial in  and , with the degree of the polynomial depending linearly on . In addition, we want to know when the problem is strongly tractable, meaning that the dependence is polynomial only in  , independently of . We show that if the sum of the weights defining the weighted reproducing kernel Hilbert space is uniformly bounded in  and the integral of the univariate kernel is positive, then the Helmholtz equation is strongly tractable for three of the four possible combinations of boundary conditions and error criteria, the only exception being the Dirichlet boundary condition under the normalized error criterion.

     

A complete description of Golay pairs for lengths up to 100

In his 1961 paper, Marcel Golay showed how the search for pairs of binary sequences of length with complementary autocorrelation is at worst a problem. Andres, in his 1977 master's thesis, developed an algorithm which reduced this to a search and investigated lengths up to 58 for existence of pairs. In this paper, we describe refinements to this algorithm, enabling a search at length 82. We find no new pairs at the outstanding lengths 74 and 82. In extending the theory of composition, we are able to obtain a closed formula for the number of pairs of length generated by a primitive pair of length . Combining this with the results of searches at all allowable lengths up to 100, we identify five primitive pairs. All others pairs of lengths less than 100 may be derived using the methods outlined.

     

Stabilized finite element method based on the Crank-Nicolson extrapolation scheme for the time-dependent Navier-Stokes equations

This paper provides an error analysis for the Crank-Nicolson extrapolation scheme of time discretization applied to the spatially discrete stabilized finite element approximation of the two-dimensional time-dependent Navier-Stokes problem, where the finite element space pair for the approximation of the velocity and the pressure is constructed by the low-order finite element: the quadrilateral element or the triangle element with mesh size . Error estimates of the numerical solution to the exact solution with are derived.

     

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.

     

Integer transfinite diameter and polynomials with small Mahler measure

In this work, we show how suitable generalizations of the integer transfinite diameter of some compact sets in give very good bounds for coefficients of polynomials with small Mahler measure. By this way, we give the list of all monic irreducible primitive polynomials of of degree at most with Mahler measure less than and of degree and with Mahler measure less than .