Wednesday, October 23, 2019 — 3:30 PM EDT

Don Hadwin, University of New Hampshire

"Tracial Stability for C*-algebras (and Groups)"

Thursday, October 24, 2019 — 4:00 PM EDT

Dan Ursu, Department of Pure Mathematics, University of Waterloo

"Ruler-compass constructions"

Monday, October 28, 2019 — 4:00 PM EDT

Alexander Yong, University of Illinois at Urbana-Champaign

"Complexity, combinatorial positivity, and Newton polytopes"

The Nonvanishing Problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby, in amenable cases, Nonvanishing is in the complexity class of problems with “good characterizations”. This suggests a new algebraic combinatorics viewpoint on complexity theory. 

S M T W T F S
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
2
  1. 2019 (163)
    1. October (16)
    2. September (13)
    3. August (7)
    4. July (12)
    5. June (18)
    6. May (22)
    7. April (11)
    8. March (25)
    9. February (17)
    10. January (22)
  2. 2018 (219)
    1. December (2)
    2. November (32)
    3. October (27)
    4. September (26)
    5. August (4)
    6. July (9)
    7. June (13)
    8. May (17)
    9. April (13)
    10. March (28)
    11. February (27)
    12. January (21)
  3. 2017 (281)
  4. 2016 (335)
  5. 2015 (209)
  6. 2014 (235)
  7. 2013 (251)
  8. 2012 (135)