首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
We consider a fully practical finite element approximation of the degenerate Cahn-Hilliard equation with elasticity: Find the conserved order parameter, , and the displacement field, , such that

   
   

subject to an initial condition on and boundary conditions on both equations. Here is the interfacial parameter, is a non-smooth double well potential, is the symmetric strain tensor, is the possibly anisotropic elasticity tensor, with and is the degenerate diffusional mobility. In addition to showing stability bounds for our approximation, we prove convergence, and hence existence of a solution to this nonlinear degenerate parabolic system in two space dimensions. Finally, some numerical experiments are presented.

  相似文献   


2.
Let be an imaginary quadratic field and let be the associated real quadratic field. Starting from the Cohen-Lenstra heuristics and Scholz's theorem, we make predictions for the behaviors of the 3-parts of the class groups of these two fields as varies. We deduce heuristic predictions for the behavior of the Iwasawa -invariant for the cyclotomic -extension of and test them computationally.

  相似文献   


3.
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) .

  相似文献   


4.
For , we consider the set . The polynomials are in , with only mild restrictions, and is the Weil height of . We show that this set is dense in for some effectively computable limit point .

  相似文献   


5.
We present an algorithm for computing the cardinality of the Jacobian of a random Picard curve over a finite field. If the underlying field is a prime field , the algorithm has complexity .

  相似文献   


6.
An error in the program for verifying the Ankeny-Artin-Chowla (AAC) conjecture is reported. As a result, in the case of primes which are , the AAC conjecture has been verified using a different multiple of the regulator of the quadratic field than was meant. However, since any multiple of this regulator is suitable for this purpose, provided that it is smaller than , the main result that the AAC conjecture is true for all the primes which are , remains valid.

As an addition, we have verified the AAC conjecture for all the primes between and , with the corrected program.

  相似文献   


7.

The present paper is a continuation of an earlier work by the author. We propose some new definitions of -adic continued fractions. At the end of the paper we give numerical examples illustrating these definitions. It turns out that for every if then has a periodic continued fraction expansion. The same is not true in for some larger values of

  相似文献   


8.
Let denote the locally free class group, that is the group of stable isomorphism classes of locally free -modules, where is the ring of algebraic integers in the number field and is a finite group. We show how to compute the Swan subgroup, , of when , a primitive -th root of unity, , where is an odd (rational) prime so that and 2 is inert in We show that, under these hypotheses, this calculation reduces to computing a quotient ring of a polynomial ring; we do the computations obtaining for several primes a nontrivial divisor of These calculations give an alternative proof that the fields for =11, 13, 19, 29, 37, 53, 59, and 61 are not Hilbert-Speiser.

  相似文献   


9.
In this paper we are concerned with the estimation of integrals on the unit circle of the form by means of the so-called Szegö quadrature formulas, i.e., formulas of the type with distinct nodes on the unit circle, exactly integrating Laurent polynomials in subspaces of dimension as high as possible. When considering certain weight functions related to the Jacobi functions for the interval nodes and weights in Szegö quadrature formulas are explicitly deduced. Illustrative numerical examples are also given.

  相似文献   


10.
We prove that there are exactly genus two curves defined over such that there exists a nonconstant morphism defined over and the jacobian of is -isogenous to the abelian variety attached by Shimura to a newform . We determine the corresponding newforms and present equations for all these curves.

  相似文献   


11.
J. Tate has determined the group (called the tame kernel) for six quadratic imaginary number fields where Modifying the method of Tate, H. Qin has done the same for and and M. Skaba for and

In the present paper we discuss the methods of Qin and Skaba, and we apply our results to the field

In the Appendix at the end of the paper K. Belabas and H. Gangl present the results of their computation of for some other values of The results agree with the conjectural structure of given in the paper by Browkin and Gangl.

  相似文献   


12.
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.

  相似文献   


13.
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 .

  相似文献   


14.
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.

  相似文献   


15.
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.

  相似文献   


16.
Boneh and Venkatesan have proposed a polynomial time algorithm for recovering a hidden element , where is prime, from rather short strings of the most significant bits of the residue of modulo for several randomly chosen . González Vasco and the first author have recently extended this result to subgroups of of order at least for all and to subgroups of order at least for almost all . Here we introduce a new modification in the scheme which amplifies the uniformity of distribution of the multipliers and thus extend this result to subgroups of order at least for all primes . As in the above works, we give applications of our result to the bit security of the Diffie-Hellman secret key starting with subgroups of very small size, thus including all cryptographically interesting subgroups.

  相似文献   


17.
In previous papers the arithmetic of hierarchical matrices has been described, which allows us to compute the inverse, for instance, of finite element stiffness matrices discretising an elliptic operator The required computing time is up to logarithmic factors linear in the dimension of the matrix. In particular, this technique can be used for the computation of the discrete analogue of a resolvent

In the present paper, we consider various operator functions, the operator exponential negative fractional powers , the cosine operator function and, finally, the solution operator of the Lyapunov equation. Using the Dunford-Cauchy representation, we get integrals which can be discretised by a quadrature formula which involves the resolvents mentioned above. We give error estimates which are partly exponentially, partly polynomially decreasing.

  相似文献   


18.
In this paper, we propose a generalization of the algorithm we developed previously. Along the way, we also develop a theory of quaternionic -symbols whose definition bears some resemblance to the classical -symbols, except for their combinatorial nature. The theory gives a more efficient way to compute Hilbert modular forms over totally real number fields, especially quadratic fields, and we have illustrated it with several examples. Namely, we have computed all the newforms of prime levels of norm less than 100 over the quadratic fields and , and whose Fourier coefficients are rational or are defined over a quadratic field.

  相似文献   


19.
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.

  相似文献   


20.
This paper presents an algorithm that, given an integer , finds the largest integer such that is a th power. A previous algorithm by the first author took time where ; more precisely, time ; conjecturally, time . The new algorithm takes time . It relies on relatively complicated subroutines--specifically, on the first author's fast algorithm to factor integers into coprimes--but it allows a proof of the bound without much background; the previous proof of relied on transcendental number theory.

The computation of is the first step, and occasionally the bottleneck, in many number-theoretic algorithms: the Agrawal-Kayal-Saxena primality test, for example, and the number-field sieve for integer factorization.

  相似文献   


设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号