No abstract uploaded!

No abstract uploaded!

This paper provides a new construction of a supply of Darmon-like points on elliptic curves E defined over a quadratic extension of totally real number fields.

It is well-known that sparse grid algorithm has been widely accepted as an efficient tool to overcome the “curse of dimensionality" in some degree. In this note, we give the error estimate of hyperbolic cross (HC) approximations with all sorts of Askey polynomials. These polynomials are useful in generalized polynomial chaos (gPC) in the field of uncertainty quantification. The exponential convergences in both regular and optimized HC approximations have been shown under the condition that the random variable depends on the random inputs smoothly in some degree. Moreover, we apply gPC to numerically solve the ordinary differential equations with slightly higher dimensional random inputs. Both regular and optimized HC have been investigated with Laguerre-chaos, Charlier-chaos and Hermite-chaos in the numerical experiment. The discussion of the connection between the standard ANOVA approximation and Galerkin approximation is in the appendix.

This volume contains the written account of the Bonn seminar on arith-metic geometry 2003/2004. It gives a coherent exposition of the theory of intersections of modular correspondences. The focus of the seminar is the formula for the intersection number of arithmetic modular correspondences due to Gross and Keating. Other topics treated are Hurwitz's theorem on the intersection of modular correspondences over the field of complex numbers, and the relation of the arithmetic intersection numbers to Fourier coefficients of Siegel-Eisenstein series. Also included is background material on one-dimensional formal groups and their endomorphisms, and on quadratic forms over the ring of p-adic integers.