An acyclic $d$-partition of the $r$-uniform complete hypergraph $K_{rd}^{(r)}$
Combinatorics
2025-07-01 v1
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].
Cite
@article{arxiv.2506.23238,
title = {An acyclic $d$-partition of the $r$-uniform complete hypergraph $K_{rd}^{(r)}$},
author = {Ayako Carter and Eric Montoya and Mihai D. Staic},
journal= {arXiv preprint arXiv:2506.23238},
year = {2025}
}
Comments
17 pages, 3 figures, all comments are welcome