Twin-star hypothesis and cycle-free $d$-partitions of $K_{2d}$ ]{Twin-star hypothesis and cycle-free $d$-partitions of $K_{2d}$
Matthew J. Fyfe, Steven R. Lippold, Mihai D. Staic, Alin Stancu

TL;DR
This paper explores a conjecture linking cycle-free $d$-partitions of complete graphs to the twin-star hypothesis, providing evidence for the conjecture in specific cases and discussing related algebraic maps.
Contribution
It establishes the equivalence between a conjecture on cycle-free partitions and the twin-star hypothesis, and verifies the conjecture for the case $d=4$.
Findings
Conjecture holds for $d=4$ case.
Equivalence between the conjecture and twin-star hypothesis.
Discussion of the determinant-like map $det^{S^2}$.
Abstract
In this paper we study an equivalence relation defined on the set of cycle-free -partitions of the complete graph . We discuss a conjecture which states that this equivalence relation has only one equivalence class, and show that the conjecture is equivalent with the so called twin-star hypothesis. We check the conjecture in the case and disuses how this relates to the determinant-like map .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Image Processing Techniques · Coding theory and cryptography · graph theory and CDMA systems
