Discrepancy of cartesian products of arithmetic progressions.
Doerr, Benjamin, Srivastav, Anand, Wehr, Petra (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Discrepancy of sums of three arithmetic progressions.”
Discrepancy of cartesian products of arithmetic progressions.
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 a problem of Molluzzo concerning Steinhaus triangles in finite cyclic groups.
Chappelon, Jonathan (2008)
Integers
Similarity:
Arithmetic progressions in sums of subsets of sparse sets
Tomasz Schoen (2011)
Acta Arithmetica
Similarity:
On disjoint arithmetic progressions
Yong-Gao Chen (2005)
Acta Arithmetica
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 permutations containing no long arithmetic progressions
J. Davis, R. Entringer, R. Graham, G. Simmons (1977)
Acta Arithmetica
Similarity:
On sequences of integers containing no arithmetic progression
Felix Adalbert Behrend (1938)
Časopis pro pěstování matematiky a fysiky
Similarity:
Multiple set addition in .
Schoen, Tomasz (2003)
Integers
Similarity:
Algebra with Arithmetic and Mensuration
Brahmagupta
Similarity:
The Elements of Arithmetic
Augustus DeMorgan
Similarity:
Some results on Oppenheim's "Factorisatio Numerorum" function
Florian Luca, Anirban Mukhopadhyay, Kotyada Srinivas (2010)
Acta Arithmetica
Similarity: