Wednesday, October 1, 2014 — 3:40 AM EDT

Alex Wires, Department of Pure Mathematics, University of Waterloo

“Complexity of Young’s Lattice”

Young’s Lattice is the poset of integer partitions ordered according to inclusion of their Ferrers diagrams. It appears to be well-behaved since partitions enjoy various notions of Reconstruction (Pretzel, Siemons), but nuanced, as certain subposets have dihedral symmetry (Suter). How complicated is the lattice ordering? We describe the scope of definable sets and find it is as complicated as we can reasonably expect when we encounter second-order arithmetic.

Please note time.

Location 
MC - Mathematics & Computer Building
5046
200 University Avenue West

Waterloo, ON N2L 3G1
Canada

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