✦ LIBER ✦

Erdös-Turán type discrepancy bounds

✍ Scribed by Peter J. Grabner

Publisher: Springer Vienna
Year: 1991
Tongue: English
Weight: 268 KB
Volume: 111
Category: Article
ISSN: 0026-9255
DOI: 10.1007/bf01332351

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a Turán type problem of Erdös

✍ Zoltán Füredi 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 209 KB

General discrepancy estimates III: The E

General discrepancy estimates III: The Erdös-Turán-Koksma inequality for the Haar function system

✍ Peter Hellekalek 📂 Article 📅 1995 🏛 Springer Vienna 🌐 English ⚖ 774 KB

Proof of a conjecture of Erdös and Turán

✍ Eric Schmutz 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 514 KB

Erdös-Turán theorems on a system of Jord

Erdös-Turán theorems on a system of Jordan curves and arcs

✍ H. -P. Blatt; R. Grothmann 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 1003 KB

Generalized additive bases, König's lemm

Generalized additive bases, König's lemma, and the Erdős–Turán conjecture

✍ Melvyn B. Nathanson 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 211 KB

Let A be a set of nonnegative integers. For every nonnegative integer n and positive integer h; let r A ðn; hÞ denote the number of representations of n in the form n where a 1 ; a 2 ; y; a h AA and a 1 pa 2 p?pa h : The infinite set A is called a basis of order h if r A ðn; hÞX1 for every nonnegat

Upper Bounds for Turán Numbers

✍ Alexander Sidorenko 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 549 KB

A system of r-element subsets (blocks) of an n-element set X n is called a Tura n (n, k, r)-system if every k-element subset of X n contains at least one of the blocks. The Tura n number T(n, k, r) is the minimum size of such a system. We prove upper estimates: + as n Ä , r Ä , k=(#+o(1))r, #>1.