The hyperdeterminant and triangulations of the 4-cube

The hyperdeterminant of format is a polynomial of degree in unknowns which has terms. We compute the Newton polytope of this polynomial and the secondary polytope of the -cube. The regular triangulations of the -cube are classified into -equivalence classes, one for each vertex of the Newton polytope. The -cube has coarsest regular subdivisions, one for each facet of the secondary polytope, but only of them come from the hyperdeterminant.

     

The Euler implicit/explicit scheme for the 2D time-dependent Navier-Stokes equations with smooth or non-smooth initial data

This paper considers the stability and convergence results for the Euler implicit/explicit scheme applied to the spatially discretized two-dimensional (2D) time-dependent Navier-Stokes equations. A Galerkin finite element spatial discretization is assumed, and the temporal treatment is implicit/explict scheme, which is implicit for the linear terms and explicit for the nonlinear term. Here the stability condition depends on the smoothness of the initial data , i.e., the time step condition is in the case of , in the case of and in the case of for mesh size and some positive constant . We provide the -stability of the scheme under the stability condition with and obtain the optimal error estimate of the numerical velocity and the optimal error estimate of the numerical pressure under the stability condition with .

     

New expansions of numerical eigenvalues for by nonconforming elements

The paper explores new expansions of the eigenvalues for in with Dirichlet boundary conditions by the bilinear element (denoted ) and three nonconforming elements, the rotated bilinear element (denoted ), the extension of (denoted ) and Wilson's elements. The expansions indicate that and provide upper bounds of the eigenvalues, and that and Wilson's elements provide lower bounds of the eigenvalues. By extrapolation, the convergence rate can be obtained, where is the maximal boundary length of uniform rectangles. Numerical experiments are carried out to verify the theoretical analysis made.

     

A superconvergent LDG-hybridizable Galerkin method for second-order elliptic problems

We identify and study an LDG-hybridizable Galerkin method, which is not an LDG method, for second-order elliptic problems in several space dimensions with remarkable convergence properties. Unlike all other known discontinuous Galerkin methods using polynomials of degree for both the potential as well as the flux, the order of convergence in of both unknowns is . Moreover, both the approximate potential as well as its numerical trace superconverge in -like norms, to suitably chosen projections of the potential, with order . This allows the application of element-by-element postprocessing of the approximate solution which provides an approximation of the potential converging with order in . The method can be thought to be in between the hybridized version of the Raviart-Thomas and that of the Brezzi-Douglas-Marini mixed methods.

     

Identifying minimal and dominant solutions for Kummer recursions

We identify minimal and dominant solutions of three-term recurrence relations for the confluent hypergeometric functions and , where (not both equal to 0). The results are obtained by applying Perron's theorem, together with uniform asymptotic estimates derived by T. M. Dunster for Whittaker functions with large parameter values. The approximations are valid for complex values of , and , with .

     

Rationality problem of three-dimensional purely monomial group actions: the last case

A -automorphism of the rational function field is called purely monomial if sends every variable to a monic Laurent monomial in the variables . Let be a finite subgroup of purely monomial -automorphisms of . The rationality problem of the -action is the problem of whether the -fixed field is -rational, i.e., purely transcendental over , or not. In 1994, M. Hajja and M. Kang gave a positive answer for the rationality problem of the three-dimensional purely monomial group actions except one case. We show that the remaining case is also affirmative.

     

Weak coupling of solutions of first-order least-squares method

A theoretical analysis of a first-order least-squares finite element method for second-order self-adjoint elliptic problems is presented. We investigate the coupling effect of the approximate solutions for the primary function and for the flux . We prove that the accuracy of the approximate solution for the primary function is weakly affected by the flux . That is, the bound for is dependent on , but only through the best approximation for multiplied by a factor of meshsize . Similarly, we provide that the bound for is dependent on , but only through the best approximation for multiplied by a factor of the meshsize . This weak coupling is not true for the non-selfadjoint case. We provide the numerical experiment supporting the theorems in this paper.

     

On the distinctness of modular reductions of maximal length sequences modulo odd prime powers

We discuss the distinctness problem of the reductions modulo of maximal length sequences modulo powers of an odd prime , where the integer has a prime factor different from . For any two different maximal length sequences generated by the same polynomial, we prove that their reductions modulo are distinct. In other words, the reduction modulo of a maximal length sequence is proved to contain all the information of the original sequence.

     

Equal moments division of a set

Let be the minimal positive integer , for which there exists a splitting of the set into  subsets, , , ..., , whose first moments are equal. Similarly, let be the maximal positive integer , such that there exists a splitting of into subsets whose first moments are equal. For , these functions were investigated by several authors, and the values of and have been found for and , respectively. In this paper, we deal with the problem for any prime . We demonstrate our methods by finding for any and for .

     

Short effective intervals containing primes in arithmetic progressions and the seven cubes problem

For any and any non-exceptional modulus , we prove that, for large enough ( ), the interval contains a prime in any of the arithmetic progressions modulo . We apply this result to establish that every integer larger than is a sum of seven cubes.

     

Optimal logarithmic energy points on the unit sphere

We study minimum energy point charges on the unit sphere in , , that interact according to the logarithmic potential , where is the Euclidean distance between points. Such optimal -point configurations are uniformly distributed as . We quantify this result by estimating the spherical cap discrepancy of optimal energy configurations. The estimate is of order . Essential is an improvement of the lower bound of the optimal logarithmic energy which yields the second term in the asymptotical expansion of the optimal energy. Previously, this was known for the unit sphere in only. Furthermore, we present an upper bound for the error of integration for an equally-weighted numerical integration rule with the nodes forming an optimal logarithmic energy configuration. For polynomials of degree at most this bound is as . For continuous functions of satisfying a Lipschitz condition with constant the bound is as .

     

Prime factors of consecutive integers

This note contains a new algorithm for computing a function introduced by Erdős to measure the minimal gap size in the sequence of integers at least one of whose prime factors exceeds . This algorithm enables us to show that is not monotone, verifying a conjecture of Ecklund and Eggleton.

     

Monotonicity of some functions involving the gamma and psi functions

Let , where is Euler's gamma function. We determine conditions for the numbers so that the function is strongly completely monotonic on . Through this result we obtain some inequalities involving the ratio of gamma functions and provide some applications in the context of trigonometric sum estimation. We also give several other examples of strongly completely monotonic functions defined in terms of and functions. Some limiting and particular cases are also considered.

     

Pointwise approximation of corner singularities for a singularly perturbed reaction-diffusion equation in an -shaped domain

A singularly perturbed reaction-diffusion equation is posed in a two-dimensional -shaped domain subject to a continuous Dirchlet boundary condition. Its solutions are in the Hölder space and typically exhibit boundary layers and corner singularities. The problem is discretized on a tensor-product Shishkin mesh that is further refined in a neighboorhood of the vertex of angle . We establish almost second-order convergence of our numerical method in the discrete maximum norm, uniformly in the small diffusion parameter. Numerical results are presented that support our theoretical error estimate.

     

Fast algorithms for computing isogenies between elliptic curves

We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an isogeny of degree ( different from the characteristic) in time quasi-linear with respect to . This is based in particular on fast algorithms for power series expansion of the Weierstrass -function and related functions.

     

On the irreducibility of Hecke polynomials

Let be the characteristic polynomial of the th Hecke operator acting on the space of cusp forms of weight for the full modular group. We record a simple criterion which can be used to check the irreducibility of the polynomials . Using this criterion with some machine computation, we show that if there exists such that is irreducible and has the full symmetric group as Galois group, then the same is true of for each prime .

     

Divided differences of inverse functions and partitions of a convex polygon

We derive a formula for an -th order divided difference of the inverse of a function. The formula has a simple and surprising structure: it is a sum over partitions of a convex polygon with vertices. The formula provides a numerically stable method of computing divided differences of -th roots. It also provides a new way of enumerating all partitions of a convex polygon of a certain type, i.e., with a specified number of triangles, quadrilaterals, and so on, which includes Catalan numbers as a special case.

     

Computations of Eisenstein series on Fuchsian groups

We present numerical investigations of the value distribution and distribution of Fourier coefficients of the Eisenstein series on arithmetic and non-arithmetic Fuchsian groups. Our numerics indicate a Gaussian limit value distribution for a real-valued rotation of as , and also, on non-arithmetic groups, a complex Gaussian limit distribution for when near and , at least if we allow at some rate. Furthermore, on non-arithmetic groups and for fixed with near , our numerics indicate a Gaussian limit distribution for the appropriately normalized Fourier coefficients.

     

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.

     

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.