English

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 dd-partition Ed(r)=(Ω1(r,d),Ω2(r,d),,Ωd(r,d))\mathcal{E}_d^{(r)}=(\Omega_1^{(r,d)}, \Omega_2^{(r,d)},\dots, \Omega_d^{(r,d)}) of the rr-uniform complete hypergraph Krd(r)K_{rd}^{(r)}. We prove that Ed(r)\mathcal{E}_d^{(r)} is homogeneous and that each hypergraph Ωi(r,d)\Omega_i^{(r,d)} is acyclic (i.e. has zero Betti numbers). As an application, we show that the map detSrdet^{S^r} is nontrivial for every rr, which gives a partial answer to a conjecture from [14].

Keywords

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