3 problems

The combinatorial low-degree correlation conjecture for pairwise-connected distributions
Let $\Sigma$ be a finite alphabet, let $k\in\mathbb{N}$ , and let $\mu$ be a pairwise-connected distribution over $\Sigma^k$ in which every atom has mass at least $\alpha$ . A functi…
openFrom papersanalysis-of-boolean-functions constraint-satisfaction-problems probabilistic-combinatorics
0 responses
25
The finitely bounded homogeneous CSP dichotomy conjecture
Finitely bounded homogeneous CSP dichotomy conjecture. Exactly one of the following holds: either $\operatorname{Pol}(\mathbb A)$ has a uniformly continuous minion homomorphism to…
openFrom papersconstraint-satisfaction-problems infinite-structures universal-algebra
0 responses
4
The Barto–Opršal–Pinsker tractability dichotomy conjecture for reducts of finitely bounded homogeneous structures
Barto–Opršal–Pinsker dichotomy conjecture. Exactly one of the following holds:
openFrom papersconstraint-satisfaction-problems infinite-domain-csp topological-algebra
0 responses
5

The combinatorial low-degree correlation conjecture for pairwise-connected distributions