Universal Algebra SeminarExport this event to calendar

Wednesday, June 1, 2016 — 10:30 AM EDT

Adam Jaffe, Department of Pure Mathematics, University of Waterloo

“Bipartite graphs admitting a k-NU polymorphism”

A k-ary polymorphism on a graph G = (V, E) is a mapping from V k to V that in some sense preserves the edge relation E. Such a polymorphism m is said to be near-unanimity (NU) if when at least k 1 of the inputs agree, then the value of m will be that near-unanimous input. Relational structures that admit an NU polymorphism possess many nice properties. This seminar will provide a generating set for irreflexive graphs which admit a k-NU polymorphism.

MC 5501

S M T W T F S
27
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. 2022 (178)
    1. December (7)
    2. November (31)
    3. October (24)
    4. September (17)
    5. August (9)
    6. July (15)
    7. June (14)
    8. May (13)
    9. April (14)
    10. March (15)
    11. February (12)
    12. January (7)
  2. 2021 (135)
    1. December (11)
    2. November (22)
    3. October (15)
    4. September (5)
    5. August (15)
    6. July (17)
    7. June (15)
    8. May (1)
    9. April (4)
    10. March (11)
    11. February (9)
    12. January (10)
  3. 2020 (103)
  4. 2019 (199)
  5. 2018 (212)
  6. 2017 (281)
  7. 2016 (335)
  8. 2015 (211)
  9. 2014 (235)
  10. 2013 (251)
  11. 2012 (135)