Arithmetic progressions in sums of subsets of sparse sets
Tomasz Schoen (2011)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Tomasz Schoen (2011)
Acta Arithmetica
Similarity:
Yahya Ould Hamidoune, Alain Plagne (2002)
Acta Arithmetica
Similarity:
(2009)
Acta Arithmetica
Similarity:
Yong-Gao Chen (2005)
Acta Arithmetica
Similarity:
Brahmagupta
Similarity:
Augustus DeMorgan
Similarity:
Florian Luca, Anirban Mukhopadhyay, Kotyada Srinivas (2010)
Acta Arithmetica
Similarity:
Andrzej Grzegorczyk (1956)
Fundamenta Mathematicae
Similarity:
M. Artigue, E. Isambert, M. Perrin, A. Zalc (1978)
Fundamenta Mathematicae
Similarity:
John Leslie
Similarity:
Florian Luca, Igor E. Shparlinski (2003)
Acta Arithmetica
Similarity:
Abercrombie Alex G., Banks William D., Shparlinski Igor E. (2009)
Acta Arithmetica
Similarity:
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).
Antonio Montalbán, Richard A. Shore (2016)
Fundamenta Mathematicae
Similarity:
We investigate the reverse mathematical strength of Turing determinacy up to Σ₅⁰, which is itself not provable in second order arithmetic.
Ernest S. Croot III (2003)
Acta Arithmetica
Similarity:
Qing-Zhong Ji (2011)
Acta Arithmetica
Similarity: