Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Polynomial concentration"”.

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

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

    waterloo Repository record for On the Erdös-Turán conjecture and related results (opens in a new tab)