works on
constraint satisfaction problems 1finite permutation groups 1first-order structures 1primitive positive constructions 1universal algebra 1

From the 1 of 4 linked papers with an AI index.

collaborators

4 papers

math.GR2026

Primitive Positive Constructions Among Finite Permutation Groups

Sebastian Meyer

The paper investigates primitive positive constructions for finite permutation groups, giving a full classification and showing how these constructions relate to constraint satisfa…

cs.LO2026

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…

math.GR2025

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…

cs.CC2025

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. Th…