6 problems

Let $\mathbf{1in3}$ and $\mathbf{\check{C}^+}$ be the finite relational templates used in the paper, with a homomorphism $\mathbf{1in3}\to\mathbf{\check{C}^+}$. The associated prom…

For integers $2\leq k<l$, let $\mathbf{LO}_k$ and $\mathbf{LO}_l$ denote the corresponding symmetric relational templates, and let $\mathrm{PCSP}(\mathbf{LO}_k,\mathbf{LO}_l)$ be t…

A $\mathbf{1in3}$-colorable 3-uniform hypergraph is a 3-uniform hypergraph admitting a coloring in which every hyperedge has exactly one vertex of one color and two of another. The…

Let $(\mathbf{A},\mathbf{B})$ be finite graph templates with a homomorphism $\mathbf{A}\to\mathbf{B}$. The promise constraint satisfaction problem…

Let $\Gamma$ be a promise CSP. Say that $\Gamma$ sandwiches a CSP $\Lambda$ if there are maps between their domains that give a homomorphic sandwich from $\Gamma$ to $\Lambda$. A C…

Let a finite Boolean Promise CSP be a promise constraint satisfaction problem whose input domain is {0,1\} and whose output domain is finite. A polymorphism is a function preserv…