Polymorphims play a major role in the dichotomy proof for the complexity of the Constraint Satisfaction Problem. However, polymorphisms also help us better understand relational structures. A popular type of relational structure is the directed graph (digraph).
It turns out that polymorphisms of directed graphs are close to being as general as possible: Jakub Bulin, Dejan Delic, Marcel Jackson and Todd Niven have shown that for each relational structure A there is a digraph G such that A and G are, roughly speaking, the same with respect to having many types of polymorphisms. However, one notable exception are the so-called Maltsev polymorphisms; we will show that whenever a digraph has Maltsev polymorphism, it must also have a majority polymorphism. This is an implication not true in general relational structures.
Polymorphisms of directed graphs
Jan. 21, 2021 5pm (Zoom (vir…
Rep Theory
Cuipo Jiang (Shanghai JiaoTong University)
X
We prove that the universal affine vertex algebra associated with a simple Lie algebra g is simple if and only if the associated variety of its unique simple quotient is equal to g*. We also derive an analogous result for the quantized Drinfeld-Sokolov reduction applied to the universal affine vertex algebra. This is a joint work with T. Arakawa and A. Moreau.