Edge partitions of the complete graph and a determinant like function
Steven R. Lippold, Mihai D. Staic, Alin Stancu

TL;DR
This paper proves a specific case of a conjecture related to exterior operads by analyzing edge partitions of complete graphs, introducing involutions, and describing a determinant-like map.
Contribution
It introduces involutions on cycle-free partitions of complete graphs and uses them to explicitly describe a determinant-like function, settling a conjecture for the case d=3.
Findings
Established the case d=3 of the conjecture.
Defined involutions corresponding to relations in the operad.
Provided an explicit description of a determinant-like map.
Abstract
In this paper we prove the case of a conjecture about the exterior operad . For this we introduce a collection of natural involutions on the set of homogeneous cycle-free -partitions of the complete graph , and show that these involutions correspond to the relations in . When this correspondence allows us to give an explicit description of a determinant-like map and to settle the above mentioned conjecture.
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
TopicsAdvanced Topics in Algebra · Algebraic structures and combinatorial models · Advanced Operator Algebra Research
