2 citations · 3 across the 4 of their papers we have counts for
5 papers
Primitive Positive Constructions Among Finite Permutation Groups
Sebastian Meyer
Primitive positive constructions of first order structures have been shown to be a very useful tool in universal algebra for the study of constraint satisfaction problems. However,…
Almost Symmetric Linear Arc Monadic Datalog and Transitive Tournaments
Sebastian Meyer, Florian Starke
We introduce -almost symmetric Datalog and study -almost symmetric linear arc monadic Datalog. We characterize the finite relational structures whose constraint satisfaction…
A topological proof of the Hell-Nešetřil dichotomy
Sebastian Meyer, Jakub Opršal
We provide a new proof of a theorem of Hell and Nešetřil [J. Comb. Theory B, 48(1):92-110, 1990] using tools from topological combinatorics based on ideas of Lovász [J. Comb. Theor…
Finite Simple Groups in the Primitive Positive Constructability Poset
Sebastian Meyer, Florian Starke
We show that any clone over a finite domain that has a quasi Maltsev operation and fully symmetric operations of all arities has an incoming minion homomorphism from I, the clone o…
A Dichotomy for Finite Abstract Simplicial Complexes
Sebastian Meyer
Given two finite abstract simplicial complexes A and B, one can define a new simplicial complex on the set of simplicial maps from A to B. After adding two technicalities, we call…