4 problems

Khanna–Putterman–Sudan conjecture. For their notion of CSP sparsifiability, the dependence on the number of variables is always a polynomial with an integral exponent.

Carbonnel's conjecture. The non-redundancy of any CSP is approximately an upper bound on the kernelization of that CSP.

Finite Mal'tsev embedding conjecture. Any predicate over a finite domain with an infinite Mal'tsev embedding also has a finite Mal'tsev embedding. In particular, any predicate with…

Superquadratic non-redundancy conjecture. For the concrete example $p=3$ and $f(x)=(x_1+x_2+x_3)(x_1+x_2+x_3-1)$, there exists $\delta>0$ such that