共查询到20条相似文献,搜索用时 15 毫秒
1.
Let be an algebraic integer of degree , not or a root of unity, all of whose conjugates are confined to a sector . In the paper On the absolute Mahler measure of polynomials having all zeros in a sector, G. Rhin and C. Smyth compute the greatest lower bound of the absolute Mahler measure ( of , for belonging to nine subintervals of . In this paper, we improve the result to thirteen subintervals of and extend some existing subintervals.
2.
Ariel Pacetti. 《Mathematics of Computation》2007,76(260):2063-2075
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) .
3.
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.
4.
Bernd C. Kellner. 《Mathematics of Computation》2007,76(257):405-441
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.
5.
Fred J. Hickernell Ian H. Sloan Grzegorz W. Wasilkowski. 《Mathematics of Computation》2004,73(248):1903-1911
We prove that for every dimension and every number of points, there exists a point-set whose -weighted unanchored discrepancy is bounded from above by independently of provided that the sequence has for some (even arbitrarily large) . Here is a positive number that could be chosen arbitrarily close to zero and depends on but not on or . This result yields strong tractability of the corresponding integration problems including approximation of weighted integrals over unbounded domains such as . It also supplements the results that provide an upper bound of the form when .
6.
Amod Agashe William Stein with an Appendix by J. Cremona B. Mazur. 《Mathematics of Computation》2005,74(249):455-484
This paper provides evidence for the Birch and Swinnerton-Dyer conjecture for analytic rank abelian varieties that are optimal quotients of attached to newforms. We prove theorems about the ratio , develop tools for computing with , and gather data about certain arithmetic invariants of the nearly abelian varieties of level . Over half of these have analytic rank , and for these we compute upper and lower bounds on the conjectural order of . We find that there are at least such for which the Birch and Swinnerton-Dyer conjecture implies that is divisible by an odd prime, and we prove for of these that the odd part of the conjectural order of really divides by constructing nontrivial elements of using visibility theory. We also give other evidence for the conjecture. The appendix, by Cremona and Mazur, fills in some gaps in the theoretical discussion in their paper on visibility of Shafarevich-Tate groups of elliptic curves.
7.
Chris Hurlburt. 《Mathematics of Computation》2005,74(250):905-926
We present the computation modulo and explicit formulas for the unique isogeny covariant differential modular form of order one and weight called , an isogeny covariant differential modular form of order two and weight denoted by , and an isogeny covariant differential modular form of order two and weight .
8.
Karim Belabas. 《Mathematics of Computation》2004,73(248):2061-2074
Davenport and Heilbronn defined a bijection between classes of binary cubic forms and classes of cubic fields, which has been used to tabulate the latter. We give a simpler proof of their theorem then analyze and improve the table-building algorithm. It computes the multiplicities of the general cubic discriminants (real or imaginary) up to in time and space , or more generally in time and space for a freely chosen positive . A variant computes the -ranks of all quadratic fields of discriminant up to with the same time complexity, but using only units of storage. As an application we obtain the first real quadratic fields with , and prove that is the smallest imaginary quadratic field with -rank equal to .
9.
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.
10.
The convergence of harmonic Ritz values, harmonic Ritz vectors, and refined harmonic Ritz vectors 总被引:5,自引:0,他引:5
Zhongxiao Jia. 《Mathematics of Computation》2005,74(251):1441-1456
This paper concerns a harmonic projection method for computing an approximation to an eigenpair of a large matrix . Given a target point and a subspace that contains an approximation to , the harmonic projection method returns an approximation to . Three convergence results are established as the deviation of from approaches zero. First, the harmonic Ritz value converges to if a certain Rayleigh quotient matrix is uniformly nonsingular. Second, the harmonic Ritz vector converges to if the Rayleigh quotient matrix is uniformly nonsingular and remains well separated from the other harmonic Ritz values. Third, better error bounds for the convergence of are derived when converges. However, we show that the harmonic projection method can fail to find the desired eigenvalue --in other words, the method can miss if it is very close to . To this end, we propose to compute the Rayleigh quotient of with respect to and take it as a new approximate eigenvalue. is shown to converge to once tends to , no matter how is close to . Finally, we show that if the Rayleigh quotient matrix is uniformly nonsingular, then the refined harmonic Ritz vector, or more generally the refined eigenvector approximation introduced by the author, converges. We construct examples to illustrate our theory.
11.
Power series expansions for the even and odd angular Mathieu functions and , with small argument , are derived for general integer values of . The expansion coefficients that we evaluate are also useful for the calculation of the corresponding radial functions of any kind.
12.
Let denote the Von Mangoldt function and . We describe an elementary method for computing isolated values of . The complexity of the algorithm is time and space. A table of values of for up to is included, and some times of computation are given.
13.
Let be either the real, complex, or quaternion number system and let be the corresponding integers. Let be a vector in . The vector has an integer relation if there exists a vector , , such that . In this paper we define the parameterized integer relation construction algorithm PSLQ, where the parameter can be freely chosen in a certain interval. Beginning with an arbitrary vector , iterations of PSLQ will produce lower bounds on the norm of any possible relation for . Thus PSLQ can be used to prove that there are no relations for of norm less than a given size. Let be the smallest norm of any relation for . For the real and complex case and each fixed parameter in a certain interval, we prove that PSLQ constructs a relation in less than iterations.
14.
Counting primes in residue classes 总被引:1,自引:0,他引:1
Marc Delé glise Pierre Dusart Xavier-Franç ois Roblot. 《Mathematics of Computation》2004,73(247):1565-1575
We explain how the Meissel-Lehmer-Lagarias-Miller-Odlyzko method for computing can be used for computing efficiently , the number of primes congruent to modulo up to . As an application, we computed the number of prime numbers of the form less than for several values of up to and found a new region where is less than near .
15.
We develop an efficient technique for computing values at of Hecke -functions. We apply this technique to the computation of relative class numbers of non-abelian CM-fields which are abelian extensions of some totally real subfield . We note that the smaller the degree of the more efficient our technique is. In particular, our technique is very efficient whenever instead of simply choosing (the maximal totally real subfield of ) we can choose real quadratic. We finally give examples of computations of relative class numbers of several dihedral CM-fields of large degrees and of several quaternion octic CM-fields with large discriminants.
16.
Helen Avelin. 《Mathematics of Computation》2008,77(263):1779-1800
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.
17.
Predicting nonlinear pseudorandom number generators 总被引:3,自引:0,他引:3
Simon R. Blackburn Domingo Gomez-Perez Jaime Gutierrez Igor E. Shparlinski. 《Mathematics of Computation》2005,74(251):1471-1494
Let be a prime and let and be elements of the finite field of elements. The inversive congruential generator (ICG) is a sequence of pseudorandom numbers defined by the relation . We show that if sufficiently many of the most significant bits of several consecutive values of the ICG are given, one can recover the initial value (even in the case where the coefficients and are not known). We also obtain similar results for the quadratic congruential generator (QCG), , where . This suggests that for cryptographic applications ICG and QCG should be used with great care. Our results are somewhat similar to those known for the linear congruential generator (LCG), , but they apply only to much longer bit strings. We also estimate limits of some heuristic approaches, which still remain much weaker than those known for LCG.
18.
Given a two dimensional oriented surface equipped with a simplicial mesh, the standard lowest order finite element spaces provide a complex centered on Raviart-Thomas divergence conforming vector fields. It can be seen as a realization of the simplicial cochain complex. We construct a new complex of finite element spaces on the barycentric refinement of the mesh which can be seen as a realization of the simplicial chain complex on the original (unrefined) mesh, such that the duality is non-degenerate on for each . In particular is a space of -conforming vector fields which is dual to Raviart-Thomas -conforming elements. When interpreted in terms of differential forms, these two complexes provide a finite-dimensional analogue of Hodge duality.
19.
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 , , .
20.
Miodrag Zivkovic. 《Mathematics of Computation》1999,68(225):403-409
For a positive integer let and let . The number of primes of the form is finite, because if , then is divisible by . The heuristic argument is given by which there exists a prime such that for all large ; a computer check however shows that this prime has to be greater than . The conjecture that the numbers are squarefree is not true because .