Independence measures of arithmetic functions II
Takao Komatsu, Vichian Laohakosol, Pattira Ruengsinsub (2012)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Applications of differential algebra to algebraic independence of arithmetic functions”
Independence measures of arithmetic functions II
Addendum to: On volumes of arithmetic quotients of SO (1, n)
Mikhail Belolipetsky (2007)
Annali della Scuola Normale Superiore di Pisa - Classe di Scienze
Similarity:
There are errors in the proof of uniqueness of arithmetic subgroups of the smallest covolume. In this note we correct the proof, obtain certain results which were stated as a conjecture, and we give several remarks on further developments.
Some results on Oppenheim's "Factorisatio Numerorum" function
Florian Luca, Anirban Mukhopadhyay, Kotyada Srinivas (2010)
Acta Arithmetica
Similarity:
Algebra with Arithmetic and Mensuration
Brahmagupta
Similarity:
The Elements of Arithmetic
Augustus DeMorgan
Similarity:
Some remarks on bicommutability
M. Artigue, E. Isambert, M. Perrin, A. Zalc (1978)
Fundamenta Mathematicae
Similarity:
Some proofs of undecidability of arithmetic
Andrzej Grzegorczyk (1956)
Fundamenta Mathematicae
Similarity:
On the structure of sets with many k-term arithmetic progressions
(2009)
Acta Arithmetica
Similarity:
A generalization of Freiman's 3k-3 Theorem
Yahya Ould Hamidoune, Alain Plagne (2002)
Acta Arithmetica
Similarity:
On non-intersecting arithmetic progressions
Régis de la Bretèche, Kevin Ford, Joseph Vandehey (2013)
Acta Arithmetica
Similarity:
We improve known bounds for the maximum number of pairwise disjoint arithmetic progressions using distinct moduli less than x. We close the gap between upper and lower bounds even further under the assumption of a conjecture from combinatorics about Δ-systems (also known as sunflowers).
On the lonely runner conjecture
Ram Krishna Pandey (2010)
Mathematica Bohemica
Similarity:
Suppose runners having nonzero distinct constant speeds run laps on a unit-length circular track. The Lonely Runner Conjecture states that there is a time at which a given runner is at distance at least from all the others. The conjecture has been already settled up to seven () runners while it is open for eight or more runners. In this paper the conjecture has been verified for four or more runners having some particular speeds using elementary tools.