Cocycles of determinantal hypertrees with small support
arXiv:2608.22255
Abstract
Let be a random -dimensional determinantal hypertree on vertices. Given any prime , we answer the following question: If a cocycle in has small support, what does the support typically look like? More precisely, we characterize all the finite connected graphs for which there is a constant with the following property: For all large enough , with probability at least , we have a cocycle such that after removing all the isolated vertices, the support of is isomorphic to . We prove that for , we do not have any such graph. For , a connected graph has the property above if and only if it has a unique cycle such that this unique cycle has odd length, moreover, if the unique cycle is a triangle, then we also need to require that all the vertices of the triangle have degree at least .