The search session has expired. Please query the service again.

Displaying 1441 – 1460 of 16591

Showing per page

An explicit formula for the Hilbert symbol of a formal group

Floric Tavares Ribeiro (2011)

Annales de l’institut Fourier

A Brückner-Vostokov formula for the Hilbert symbol of a formal group was established by Abrashkin under the assumption that roots of unity belong to the base field. The main motivation of this work is to remove this hypothesis. It is obtained by combining methods of ( ϕ , Γ )-modules and a cohomological interpretation of Abrashkin’s technique. To do this, we build ( ϕ , Γ )-modules adapted to the false Tate curve extension and generalize some related tools like the Herr complex with explicit formulas for the...

An explicit formula of Atkinson type for the product of the Riemann zeta-function and a Dirichlet polynomial

Hideaki Ishikawa, Kohji Matsumoto (2011)

Open Mathematics

We prove an explicit formula of Atkinson type for the error term in the asymptotic formula for the mean square of the product of the Riemann zeta-function and a Dirichlet polynomial. To deal with the case when coefficients of the Dirichlet polynomial are complex, we apply the idea of the first author in his study on mean values of Dirichlet L-functions.

An exponential Diophantine equation related to the sum of powers of two consecutive k-generalized Fibonacci numbers

Carlos Alexis Gómez Ruiz, Florian Luca (2014)

Colloquium Mathematicae

A generalization of the well-known Fibonacci sequence F n 0 given by F₀ = 0, F₁ = 1 and F n + 2 = F n + 1 + F for all n ≥ 0 is the k-generalized Fibonacci sequence F ( k ) n - ( k - 2 ) whose first k terms are 0,..., 0, 1 and each term afterwards is the sum of the preceding k terms. For the Fibonacci sequence the formula F ² + F ² n + 1 ² = F 2 n + 1 holds for all n ≥ 0. In this paper, we show that there is no integer x ≥ 2 such that the sum of the xth powers of two consecutive k-generalized Fibonacci numbers is again a k-generalized Fibonacci number. This generalizes...

An extension of a theorem of Duffin and Schaeffer in Diophantine approximation

Faustin Adiceam (2014)

Acta Arithmetica

Duffin and Schaeffer have generalized the classical theorem of Khintchine in metric Diophantine approximation in the case of any error function under the assumption that all the rational approximants are irreducible. This result is extended to the case where the numerators and the denominators of the rational approximants are related by a congruential constraint stronger than coprimality.

Currently displaying 1441 – 1460 of 16591