An acyclic d-partition of the r-uniform complete hypergraph Krd(r)
Abstract
In this paper we introduce a d-partition Ed(r)=(1(r,d), 2(r,d),…, d(r,d)) of the r-uniform complete hypergraph Krd(r). We prove that Ed(r) is homogeneous and that each hypergraph i(r,d) is acyclic (i.e. has zero Betti numbers). As an application, we show that the map detSr is nontrivial for every r, which gives a partial answer to a conjecture from [14].
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.