Coding the principal character formula for affine Kac-Moody lie algebras

In this paper, an algorithm for computing the principal character for affine Lie algebras is discussed and presented. The principal characters discovered using this program are given and/or proven. Results include level 2 and 3 character formulas in and the sole existence of the Rogers-Ramanujan products in , , , , , , .     

On the total number of prime factors of an odd perfect number

We say is perfect if , where denotes the sum of the positive divisors of . No odd perfect numbers are known, but it is well known that if such a number exists, it must have prime factorization of the form , where , , ..., are distinct primes and . We prove that if or for all , , then . We also prove as our main result that , where . This improves a result of Sayers given in 1986.

     

Computation of Stark-Tamagawa units

Let be a totally real number field and let denote an odd prime number. We design an algorithm which computes strong numerical evidence for the validity of the ``Equivariant Tamagawa Number Conjecture' for the -equivariant motive , where is a cyclic extension of degree and group . This conjecture is a very deep refinement of the classical analytic class number formula. In the course of the algorithm, we compute a set of special units which must be considered as a generalization of the (conjecturally existing) Stark units associated to first order vanishing Dirichlet -functions.

     

Analysis of a bilinear finite element for shallow shells. II: Consistency error

We consider a bilinear reduced-strain finite element of the MITC family for a shallow Reissner-Naghdi type shell. We estimate the consistency error of the element in both membrane- and bending-dominated states of deformation. We prove that in the membrane-dominated case, under severe assumptions on the domain, the finite element mesh and the regularity of the solution, an error bound can be obtained if the contribution of transverse shear is neglected. Here is the thickness of the shell, the mesh spacing, and a smoothness parameter. In the bending-dominated case, the uniformly optimal bound is achievable but requires that membrane and transverse shear strains are of order as . In this case we also show that under sufficient regularity assumptions the asymptotic consistency error has the bound .

     

Finding strong pseudoprimes to several bases. II

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 . Upper bounds for were first given by Jaeschke, and those for were then sharpened by the first author in his previous paper (Math. Comp. 70 (2001), 863-872).

In this paper, we first follow the first author's previous work to use biquadratic residue characters and cubic residue characters as main tools to tabulate all strong pseudoprimes (spsp's) to the first five or six prime bases, which have the form with odd primes and ; then we tabulate all Carmichael numbers , to the first six prime bases up to 13, which have the form with each prime factor . There are in total 36 such Carmichael numbers, 12 numbers of which are also spsp's to base 17; 5 numbers are spsp's to bases 17 and 19; one number is an spsp to the first 11 prime bases up to 31. As a result the upper bounds for and are lowered from 20- and 22-decimal-digit numbers to a 19-decimal-digit number:

We conjecture that

and give reasons to support this conjecture. The main idea for finding these Carmichael numbers is that we loop on the largest prime factor and propose necessary conditions on to be a strong pseudoprime to the first prime bases. Comparisons of effectiveness with Arnault's, Bleichenbacher's, Jaeschke's, and Pinch's methods for finding (Carmichael) numbers with three prime factors, which are strong pseudoprimes to the first several prime bases, are given.

     

A computational approach for solving

We present a computational approach for finding all integral solutions of the equation for even values of . By reducing this problem to that of finding integral solutions of a certain class of quartic equations closely related to the Pell equations, we are able to apply the powerful computational machinery related to quadratic number fields. Using our approach, we determine all integral solutions for assuming the Generalized Riemann Hypothesis, and for unconditionally.

     

Maximum-norm estimates for resolvents of elliptic finite element operators

Let be a convex domain with smooth boundary in . It has been shown recently that the semigroup generated by the discrete Laplacian for quasi-uniform families of piecewise linear finite element spaces on is analytic with respect to the maximum-norm, uniformly in the mesh-width. This implies a resolvent estimate of standard form in the maximum-norm outside some sector in the right halfplane, and conversely. Here we show directly that such a resolvent estimate holds outside any sector around the positive real axis, with arbitrarily small angle. This is useful in the study of fully discrete approximations based on -stable rational functions, with small.

     

A nonconforming combination of the finite element and volume methods with an anisotropic mesh refinement for a singularly perturbed convection-diffusion equation

In this paper we formulate and analyze a discretization method for a 2D linear singularly perturbed convection-diffusion problem with a singular perturbation parameter . The method is based on a nonconforming combination of the conventional Galerkin piecewise linear triangular finite element method and an exponentially fitted finite volume method, and on a mixture of triangular and rectangular elements. It is shown that the method is stable with respect to a semi-discrete energy norm and the approximation error in the semi-discrete energy norm is bounded by with independent of the mesh parameter , the diffusion coefficient and the exact solution of the problem.

     

Septic fields with discriminant

We classify septic number fields which are unramified outside of by a targeted Hunter search; there are exactly such fields, all with Galois group . We also describe separate computations which strongly suggest that none of these fields come from specializing septic genus zero three-point covers.

     

The minimal number of solutions to

In 1958, A. Schinzel showed that for each fixed there are at least two solutions to . Using the same method and a computer search, Schinzel and A. Wakulicz extended the bound to all . Here we show that Schinzel's method can be used to further extend the bound when is even, but not when is odd.

     

Error bounds for Gauss-Turán quadrature formulae of analytic functions

We study the kernels of the remainder term of Gauss-Turán quadrature formulas

for classes of analytic functions on elliptical contours with foci at , when the weight is one of the special Jacobi weights ; ; , ; , . We investigate the location on the contour where the modulus of the kernel attains its maximum value. Some numerical examples are included.

     

Minimality and other properties of the width- nonadjacent form

Let be an integer and let be the set of integers that includes zero and the odd integers with absolute value less than . Every integer can be represented as a finite sum of the form , with , such that of any consecutive 's at most one is nonzero. Such representations are called width- nonadjacent forms (-NAFs). When these representations use the digits and coincide with the well-known nonadjacent forms. Width- nonadjacent forms are useful in efficiently implementing elliptic curve arithmetic for cryptographic applications. We provide some new results on the -NAF. We show that -NAFs have a minimal number of nonzero digits and we also give a new characterization of the -NAF in terms of a (right-to-left) lexicographical ordering. We also generalize a result on -NAFs and show that any base 2 representation of an integer, with digits in , that has a minimal number of nonzero digits is at most one digit longer than its binary representation.

     

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.

     

Finite element superconvergence on Shishkin mesh for 2-D convection-diffusion problems

In this work, the bilinear finite element method on a Shishkin mesh for convection-diffusion problems is analyzed in the two-dimensional setting. A superconvergence rate in a discrete -weighted energy norm is established under certain regularity assumptions. This convergence rate is uniformly valid with respect to the singular perturbation parameter . Numerical tests indicate that the rate is sharp for the boundary layer terms. As a by-product, an -uniform convergence of the same order is obtained for the -norm. Furthermore, under the same regularity assumption, an -uniform convergence of order in the norm is proved for some mesh points in the boundary layer region.

     

An estimate for the number of integers without large prime factors

denotes the number of positive integers and free of prime factors y$">. Hildebrand and Tenenbaum provided a good approximation of . However, their method requires the solution to the equation , and therefore it needs a large amount of time for the numerical solution of the above equation for large . Hildebrand also showed approximates for , where and is the unique solution to . Let be defined by for 0$">. We show approximates , and also approximates , where . Using these approximations, we give a simple method which approximates within a factor in the range , where is any positive constant.

     

Elliptic binomial diophantine equations

The complete sets of solutions of the equation are determined for the cases , , , , , , , . In each of these cases the equation is reduced to an elliptic equation, which is solved by using linear forms in elliptic logarithms. In all but one case this is more or less routine, but in the remaining case () we had to devise a new variant of the method.

     

Lower bounds for the total stopping time of iterates

The total stopping time of a positive integer is the minimal number of iterates of the function needed to reach the value , and is if no iterate of reaches . It is shown that there are infinitely many positive integers having a finite total stopping time such that 6.14316 \log n.$"> The proof involves a search of trees to depth 60, A heuristic argument suggests that for any constant , a search of all trees to sufficient depth could produce a proof that there are infinitely many such that \gamma\log n.$">It would require a very large computation to search trees to a sufficient depth to produce a proof that the expected behavior of a ``random' iterate, which is occurs infinitely often.

     

Linear algebra algorithms for divisors on an algebraic curve

We use an embedding of the symmetric th power of any algebraic curve of genus into a Grassmannian space to give algorithms for working with divisors on , using only linear algebra in vector spaces of dimension , and matrices of size . When the base field is finite, or if has a rational point over , these give algorithms for working on the Jacobian of that require field operations, arising from the Gaussian elimination. Our point of view is strongly geometric, and our representation of points on the Jacobian is fairly simple to deal with; in particular, none of our algorithms involves arithmetic with polynomials. We note that our algorithms have the same asymptotic complexity for general curves as the more algebraic algorithms in Florian Hess' 1999 Ph.D. thesis, which works with function fields as extensions of . However, for special classes of curves, Hess' algorithms are asymptotically more efficient than ours, generalizing other known efficient algorithms for special classes of curves, such as hyperelliptic curves (Cantor 1987), superelliptic curves (Galbraith, Paulus, and Smart 2002), and curves (Harasawa and Suzuki 2000); in all those cases, one can attain a complexity of .