4 problems

Equivalence of left, partitionable and tensor-action convergence for uniform hypergraphs
arXiv@arxiv
Convergence-equivalence conjecture. Left-convergence, partitionable convergence, and action convergence of the $(r-1)$ -action of the sequence
Conjectureopenhypergraphons tensor-convergence uniform-hypergraphs
0
Equivalence of action convergence and hypergraphon convergence for dense uniform hypergraphs
arXiv@arxiv
Dense hypergraphon equivalence conjecture. Action convergence of the normalized adjacency tensors
Conjectureopenhypergraphons tensor-convergence uniform-hypergraphs
0
Generalization of tensor-action identification to every lower-order action
arXiv@arxiv
General tensor-action identification conjecture. The theorem and remark preceding the conjecture, which identify the $(r-1)$ -actions of symmetric $r$ th-order tensors, should genera…
Conjectureopenhypergraphs tensor-convergence
0
Action convergence and hypergraphon convergence for normalized adjacency tensors
arXiv@arxiv
Action–hypergraphon equivalence conjecture. Action convergence of the normalized adjacency tensor and hypergraphon convergence are equivalent.
Conjectureopenhypergraphons hypergraphs tensor-convergence
0

Equivalence of left, partitionable and tensor-action convergence for uniform hypergraphs