18 search results - page 1 / 4 » Sub-Ramsey Numbers for Arithmetic Progressions |
ENDM
2007
15 years 1 months ago
2007
For a given positive integer k, sr(m, k) denotes the minimal positive integer such that every coloring of [n], n ≥ sr(m, k), that uses each color at most k times, yields a rainb...
86
Voted
GC
2006
Springer
15 years 1 months ago
2006
Springer
113
Voted
EM
2010
14 years 8 months ago
2010
Under two assumptions, we determine the distribution of the difference between two functions each counting the numbers x that are in a given arithmetic progression modulo q and the...
109
click to vote
ITA
2006
15 years 1 months ago
2006
Arithmetical complexity of a sequence is the number of words of length n that can be extracted from it according to arithmetic progressions. We study uniformly recurrent words of l...
103
Voted
COMBINATORICS
2004
15 years 26 days ago
2004
Consider natural numbers {1,