Search Sciweavers | Sciweavers

18 search results - page 1 / 4

» Sub-Ramsey Numbers for Arithmetic Progressions

click to vote

ENDM
2007

96views more ENDM 2007»

Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples

13 years 4 months ago

Download www.emis.de

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...

Jacob Fox, Veselin Jungic, Rados Radoicic

claim paper

Read More »

click to vote

GC
2006
Springer

82views Applied Computing» more GC 2006»

Sub-Ramsey Numbers for Arithmetic Progressions

13 years 4 months ago

Download orion.math.iastate.edu

Maria Axenovich, Ryan Martin

claim paper

Read More »

click to vote

EM
2010

154views Management» more EM 2010»

Chebyshev's Bias for Products of Two Primes

12 years 11 months ago

Download www.math.uiuc.edu

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...

Kevin Ford, Jason Sneed

claim paper

Read More »

click to vote

ITA
2006

100views Communications» more ITA 2006»

Sequences of low arithmetical complexity

13 years 4 months ago

Download www.math.nsc.ru

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...

Sergey V. Avgustinovich, Julien Cassaigne, Anna E....

claim paper

Read More »

click to vote

COMBINATORICS
2004

76views more COMBINATORICS 2004»

On Rainbow Arithmetic Progressions

13 years 4 months ago