Weighted sequences in finite cyclic groups.
We introduce the concept of uniform weighted density (upper and lower) of a subset of , with respect to a given sequence of weights . 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...
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 and yielding a conditional upper bound for the irrationality measure of ; (2) a second-order Apéry-like recursion for and some low-order recursions for linear forms in odd zeta values; (3) a rich permutation group for a family...
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...
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.
In this paper, we establish an one-to-one mapping between complex-valued functions defined on and complex-valued functions defined on -adic number field , and introduce the definition and method of Weyl-Heisenberg frame on hormonic analysis to -adic anylysis.
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...