Back to search

University of Waterloo

On the Erdös-Turán conjecture and related results

Abstract

dc:description.abstract

The Erdös-Turán Conjecture, posed in 1941 in, states that if a subset B of natural numbers is such that every positive integer n can be written as the sum of a bounded number of terms from B, then the number of such representations must be unbounded as n tends to infinity. The case for h = 2 was given a positive answer by Erdös in 1956. The case for arbitrary h was given by Erdös and Tetali in 1990. Both of these proofs use the probabilistic method, and so the result only shows the existence of such bases but such bases are not given explicitly. Kolountzakis gave an effective algorithm that is polynomial with respect to the digits of n to compute such bases. Borwein, Choi, and Chu showed that the number of representations cannot be bounded by 7. Van Vu showed that the Waring bases contain thin sub-bases. We will discuss these results in the following work.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2011

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Xiao, Stanley Yao

Subjects

dc:subject × 5

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/6150

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Xiao, Stanley Yao. On the Erdös-Turán conjecture and related results. University of Waterloo, 2011. http://hdl.handle.net/10012/6150