Wednesday, July 18, 2018

Wednesday, July 18, 2018 — 12:30 PM EDT

Anil Pacaci, PhD candidate
David R. Cheriton School of Computer Science

Wednesday, July 18, 2018 — 1:30 PM EDT

Finn Lidbetter, Master’s candidate
David R. Cheriton School of Computer Science

The fundamental problem of additive number theory is to determine whether there exists an integer m such that every nonnegative integer (resp., every sufficiently large nonnegative integer) is the sum of at most m elements of S. If so, we call S an additive basis of order m (resp., an asymptotic additive basis of order m). If such an m exists, we also want to find the smallest such m.

S M T W T F S
28
29
30
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
  1. 2020 (155)
    1. September (1)
    2. August (20)
    3. July (14)
    4. June (19)
    5. May (17)
    6. April (20)
    7. March (17)
    8. February (25)
    9. January (22)
  2. 2019 (255)
    1. December (21)
    2. November (25)
    3. October (16)
    4. September (20)
    5. August (18)
    6. July (12)
    7. June (23)
    8. May (23)
    9. April (32)
    10. March (25)
    11. February (16)
    12. January (24)
  3. 2018 (220)
    1. December (16)
    2. November (19)
    3. October (26)
    4. September (22)
    5. August (17)
    6. July (20)
    7. June (13)
    8. May (25)
    9. April (34)
    10. March (24)
    11. February (3)
    12. January (1)
  4. 2017 (36)
  5. 2016 (21)
  6. 2015 (36)
  7. 2014 (33)
  8. 2013 (23)
  9. 2012 (4)
  10. 2011 (1)
  11. 2010 (1)
  12. 2009 (1)
  13. 2008 (1)