Tuesday, January 28, 2014

Tuesday, January 28, 2014 — 2:30 PM EST

Winnie Lam, Department of Pure Mathematics, University of Waterloo

“Weak Prague Instance”

Tuesday, January 28, 2014 — 4:30 PM EST

Cameron Williams, Pure Mathematics & Cameron Marcott, Combinatorics Optimization, University of Waterloo

"Cameron and Cameron Present the Cyclic Sieving Phenomena with Cameron and Cameron "

We show how basic representation theory can be used to count the fixed points of a set under the action of a cyclic group. This basic representation theory has deep combinatorial applications only recently described as the "cyclic sieving phenomena".

S M T W T F S
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
30
31
1
  1. 2019 (182)
    1. November (16)
    2. October (19)
    3. September (13)
    4. August (7)
    5. July (12)
    6. June (18)
    7. May (22)
    8. April (11)
    9. March (25)
    10. February (17)
    11. 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)
    1. December (5)
    2. November (36)
    3. October (34)
    4. September (17)
    5. August (7)
    6. July (17)
    7. June (23)
    8. May (22)
    9. April (13)
    10. March (17)
    11. February (22)
    12. January (22)
  7. 2013 (251)
  8. 2012 (135)