Koponen's supersimplicity conjecture for finite relational languages
Koponen's conjecture. Every simple theory with quantifier elimination in a finite relational language is supersimple.
MathDB