5 problems

Polynomial-complexity conjecture. A sufficient condition to compute $W^{*(r,d)}(\mathcal{F},u)$ in polynomial time is that $W^{*(r,d)}(\mathcal{F},u)$ has only one global/local min…

Convergence-equivalence conjecture. Left-convergence, partitionable convergence, and action convergence of the $(r-1)$-action of the sequence

Dense hypergraphon equivalence conjecture. Action convergence of the normalized adjacency tensors

Action–hypergraphon equivalence conjecture. Action convergence of the normalized adjacency tensor and hypergraphon convergence are equivalent.

A $k$-uniform hypergraphon is expected to be a symmetric measurable function … and one should define $t_{\operatorname{inj}}$, $t_{\operatorname{ind}}$ and $p$ in analogy with the…