An acyclic -partition of the -uniform complete hypergraph
arXiv:2506.23238
Abstract
In this paper we introduce a -partition of the -uniform complete hypergraph . We prove that is homogeneous and that each hypergraph is acyclic (i.e. has zero Betti numbers). As an application, we show that the map is nontrivial for every , which gives a partial answer to a conjecture from [14].
17 pages, 3 figures, all comments are welcome