共查询到20条相似文献,搜索用时 15 毫秒
1.
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.
2.
Konstantinos A. Draziotis. 《Mathematics of Computation》2006,75(255):1493-1505
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.
3.
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.
4.
Garikai Campbell. 《Mathematics of Computation》2004,73(248):2093-2108
5.
Helen Avelin. 《Mathematics of Computation》2007,76(257):361-384
We develop an algorithm for numerical computation of the Eisenstein series on a Riemann surface of constant negative curvature. We focus in particular on the computation of the poles of the Eisenstein series. Using our numerical methods, we study the spectrum of the Laplace-Beltrami operator as the surface is being deformed. Numerical evidence of the destruction of -cusp forms is presented.
6.
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.
7.
Tapani Matala-aho Keijo Vä ä nä nen Wadim Zudilin. 《Mathematics of Computation》2006,75(254):879-889
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 .
8.
Jeffrey Stopple. 《Mathematics of Computation》2007,76(260):2051-2062
An algorithm is given to efficiently compute -functions with large conductor in a restricted range of the critical strip. Examples are included for about 24000 dihedral Galois representations with conductor near . The data shows good agreement with a symplectic random matrix model.
9.
Mark Watkins. 《Mathematics of Computation》2004,73(245):415-423
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.
10.
Zhenxiang Zhang. 《Mathematics of Computation》2005,74(250):1009-1024
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.
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.
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.
11.
Ichiro Shimada. 《Mathematics of Computation》2004,73(248):1989-2017
We investigate configurations of rational double points with the total Milnor number on supersingular surfaces. The complete list of possible configurations is given. As an application, we also give the complete list of extremal (quasi-)elliptic fibrations on supersingular surfaces.
12.
Ariel Pacetti Fernando Rodriguez Villegas with an appendix by B. Gross. 《Mathematics of Computation》2005,74(251):1545-1557
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.
13.
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.
14.
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.
15.
Christian Wittmann. 《Mathematics of Computation》2005,74(250):937-947
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.
16.
We give new bounds for the number of integral points on elliptic curves. The method may be said to interpolate between approaches via diophantine techniques and methods based on quasi-orthogonality in the Mordell-Weil lattice. We apply our results to break previous bounds on the number of elliptic curves of given conductor and the size of the -torsion part of the class group of a quadratic field. The same ideas can be used to count rational points on curves of higher genus.
17.
Tadej Kotnik. 《Mathematics of Computation》2004,73(246):949-956
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.
18.
John L. Simons. 《Mathematics of Computation》2005,74(251):1565-1572
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.
19.
Susanne C. Brenner. 《Mathematics of Computation》2004,73(247):1041-1066
The convergence of -cycle and -cycle multigrid algorithms with a sufficiently large number of smoothing steps is established for nonconforming finite element methods for second order elliptic boundary value problems.
20.
Li-Chien Shen 《Transactions of the American Mathematical Society》2005,357(5):2043-2058
Based on properties of the hypergeometric series , we develop a theory of elliptic functions that shares many striking similarities with the classical Jacobian elliptic functions.