Displaying 41 – 60 of 97

Showing per page

Weighted uniform densities

Rita Giuliano Antonini, Georges Grekos (2007)

Journal de Théorie des Nombres de Bordeaux

We introduce the concept of uniform weighted density (upper and lower) of a subset A of * , with respect to a given sequence of weights ( a n ) . This concept generalizes the classical notion of uniform density (for which the weights are all equal to 1). We also prove a theorem of comparison between two weighted densities (having different sequences of weights) and a theorem of comparison between a weighted uniform density and a weighted density in the classical sense. As a consequence, new bounds for the...

Well-poised hypergeometric service for diophantine problems of zeta values

Wadim Zudilin (2003)

Journal de théorie des nombres de Bordeaux

It is explained how the classical concept of well-poised hypergeometric series and integrals becomes crucial in studying arithmetic properties of the values of Riemann’s zeta function. By these well-poised means we obtain: (1) a permutation group for linear forms in 1 and ζ ( 4 ) = π 4 / 90 yielding a conditional upper bound for the irrationality measure of ζ ( 4 ) ; (2) a second-order Apéry-like recursion for ζ ( 4 ) and some low-order recursions for linear forms in odd zeta values; (3) a rich permutation group for a family...

Well-rounded sublattices of planar lattices

Michael Baake, Rudolf Scharlau, Peter Zeiner (2014)

Acta Arithmetica

A lattice in Euclidean d-space is called well-rounded if it contains d linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The task of enumerating well-rounded sublattices of a given lattice is of interest already in dimension 2, and has recently been treated by several authors. In this paper, we analyse the question more closely in the spirit of earlier work on similar sublattices and coincidence...

Weyl sums and atomic energy oscillations.

Antonio Córdoba, Charles L. Fefferman, Luis A. Seco (1995)

Revista Matemática Iberoamericana

We extend Van der Corput's method for exponential sums to study an oscillating term appearing in the quantum theory of large atoms. We obtain an interpretation in terms of classical dynamics and we produce sharp asymptotic upper and lower bounds for the oscillations.

Weyl-Heisenberg frame in p -adic analysis

Minggen Cui, Xueqin Lv (2005)

Annales mathématiques Blaise Pascal

In this paper, we establish an one-to-one mapping between complex-valued functions defined on R + { 0 } and complex-valued functions defined on p -adic number field Q p , and introduce the definition and method of Weyl-Heisenberg frame on hormonic analysis to p -adic anylysis.

What is the inverse of repeated square and multiply algorithm?

H. Gopalkrishna Gadiyar, K. M. Sangeeta Maini, R. Padma, Mario Romsy (2009)

Colloquium Mathematicae

It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm and what is its time compexity. The technical hitch is in fixing the right sign of the square root and this is the heart of the discrete logarithm problem over finite fields of characteristic not equal to 2. In this paper a couple of probabilistic algorithms to compute the discrete...

Currently displaying 41 – 60 of 97