مقاله

on rainbow 4-term arithmetic progressions

دانلود متن کاملرایگان، با حساب کاربری؛ ثبت نام با گوگل چند ثانیه است

چکیده(به انگلیسی؛ چکیده‌ی فارسی در دسترس نیست)

{sl let $[n]={1,dots, n}$ be colored in $k$ colors. a rainbow ap$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. conlon, jungi'{c} and radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow ap(4) free, when $n$ is even. based on their construction, we show that such a coloring of $[4n]$ also exists for odd $n>1$. we conclude that for nonnegative integers $kgeq 3$ and $n > 1$, every equinumerous $k$-coloring of $[kn]$ contains a rainbow ap$(k)$ if and only if $k=3$.}

اسناد مشابه

  • On rainbow 4-term arithmetic progressions

    مقاله۲۰۱۲Bulletin of the Iranian Mathematical SocietyM. H. Shirdareh Haghighi, P. Salehi Nowbandegani

    {sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbo

  • Rainbow 3-term Arithmetic Progressions

    سند علمی۲۰۰۳Veselin Jungić, Radoš Radoičić

    Consider a coloring of {1, 2, . . . , n} in 3 colors, where n ≡ 0 (mod 3). If all the color classes have the same cardinality, then there is a 3-term arithmetic progression whose elements are colored in distinct colors. This rainbow variant of van der Waerden’s theorem proves the

  • The number of subsets of integers with no k-term arithmetic progression

    سند علمی۲۰۱۶József Balogh, Hong Liu, Maryam Sharifzadeh

    Addressing a question of Cameron and Erdős, we show that, for infinitely many values of n, the number of subsets of {1, 2, . . . , n} that do not contain a k-term arithmetic progression is at most 2O(rk(n)), where rk(n) is the maximum cardinality of a subset of {1, 2, . . . , n}

  • The Minimal Number of Three-Term Arithmetic Progressions Modulo a Prime Converges to a Limit

    سند علمی۲۰۰۶Ernie Croot

    How few three-term arithmetic progressions can a subset S ⊆ ZN := Z/NZ have if |S| ≥ υN? (that is, S has density at least υ). Varnavides [4] showed that this number of arithmetic-progressions is at least c(υ)N for sufficiently large integers N ; and, it is well-known that determi

  • Sequences of Integers Avoiding 3-term Arithmetic Progressions

    سند علمی۲۰۱۲Electr. J. Comb.Arun Sharma

    The optimal length r(n) of a sequence in [1, n] containing no 3term arithmetic progression is determined for several new values of n and some results relating to the subadditivity of r are obtained. We also prove a particular case of a conjecture of Szekeres. A subsequence S = (a

  • Subsets of Fpn without three term arithmetic progressions have several large Fourier coefficients

    سند علمی۲۰۰۷Ernie Croot

    Suppose that f : Fpn → [0, 1] satisfies Σaf(m) = θF ∈ [F , F ], where F = |Fpn | = p. In this paper we will show the following: Let fj denote the size of the jth largest Fourier coefficient of f . If fj < θ j1/2+δF, for some integer j satisfying J0(δ, p) < j < F , then S = suppor