✦ LIBER ✦

Weakly arithmetic progressions in sets of natural numbers

✍ Scribed by Egbert Harzheim

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 186 KB
Volume: 89
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90404-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Independent Arithmetic Progressions in C

Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers

✍ David S. Gunderson; Imre Leader; Hans Jürgen Prömel; Vojtěch Rödl 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 179 KB

We show that if G is a K r -free graph on N, there is an independent set in G which contains an arbitrarily long arithmetic progression together with its difference. This is a common generalization of theorems of Schur, van der Waerden, and Ramsey. We also discuss various related questions regarding

ORDINAL NUMBERS IN ARITHMETIC PROGRESSIO

ORDINAL NUMBERS IN ARITHMETIC PROGRESSION

✍ Frederick Bagemihl; F. Bagemihl 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB

## Abstract The class of all ordinal numbers can be partitioned into two subclasses in such a way that neither subclass contains an arithmetic progression of order type ω, where an arithmetic progression of order type τ means an increasing sequence of ordinal numbers (ß + δγ)γ<γ<>r, δ ≠ 0.

On sets not containing arithmetic progre

On sets not containing arithmetic progressions of a certain kind

✍ Frank W Schmidt 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 140 KB

Discrepancy of Arithmetic Progressions i

Discrepancy of Arithmetic Progressions in Higher Dimensions

✍ Benedek Valkó 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 136 KB

proved that the discrepancy of arithmetic progressions contained in [1, N]={1, 2, ..., N} is at least cN 1/4 , and later it was proved that this result is sharp. We consider the d-dimensional version of this problem. We give a lower estimate for the discrepancy of arithmetic progressions on [1, N] d

On Infinite Sum-free Sets of Natural Num

On Infinite Sum-free Sets of Natural Numbers

✍ Tomasz łuczak; Tomasz Schoen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 346 KB

A subset of the natural numbers is k-sum-free if it contains no solutions of the equation x 1 + } } } +x k = y, and strongly k-sum-free when it is l-sum-free for every l=2, ..., k. It is shown that every k-sum-free set with upper density larger than 1Â(k+1) is a subset of a periodic k-sum-free set a

Effective Enumerations of Families of Fi

Effective Enumerations of Families of Finite Sets of Natural Numbers

✍ Angel V. Ditchev 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB

We construct a universal r.e. set in the following manner: For any (n, x) we construct a set Un,, E 8 such that the set of all (z, n, x ) such that z E U,,,, is r.e. We construct the set Un,x by steps, and on step s we build a finite approximation U,,.x,s of U,,,,, and finally we take Let us describ