Cyclic Incidence Orderings of Complete Graphs and 3-Uniform Hypergraphs

Abstract

We study cyclic orderings of all edges of a complete $k$-uniform hypergraph on $n$ vertices in which the binary incidence sequences of the vertices are cyclic shifts of a common word. The shifts are chosen independently, with no prescribed action on the vertices. For $2\leq k<n$, coprimality $\gcd(n,k)=1$ is known to suffice even when consecutive edges must differ by a single vertex exchange. We recall a short orbit construction and prove the converse for the first two nontrivial uniformities without any adjacency requirement. For $k=2$, an ordering exists exactly when $n=2$ or $n$ is odd; for $k=3$, exactly when $n=3$ or $3\nmid n$. The necessity proofs use reflected convolution identities and pair-intersection counts to constrain the vertex shifts to a torsion coset. For triples, multiplicity-preserving dilation and conditional prime-power capacity bounds complete the argument.