56 search results - page 1 / 12 » On Rainbow Arithmetic Progressions |
COMBINATORICS
2004
13 years 4 months ago
2004
Consider natural numbers {1,
COMBINATORICS
2002
13 years 4 months ago
2002
A sequence u = u1u2...un is said to be nonrepetitive if no two adjacent blocks of u are exactly the same. For instance, the sequence abcbcba contains a repetition bcbc, while abca...
ENDM
2007
13 years 4 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...
ITA
2006
13 years 4 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...
APAL
1999
13 years 4 months ago
1999
This article surveys R. Parikh's work on feasibility, bounded arithmetic and the complexity of proofs. We discuss in depth two of Parikh's papers on these subjects and s...