Compatible split systems on a multiset
Vincent Moulton, Guillaume E. Scholz

TL;DR
This paper introduces a new characterization of compatible split systems on multisets, providing insights into their tree representations and confirming a 2008 conjecture for specific classes.
Contribution
It offers a novel characterization of compatible split systems and proves a longstanding conjecture for certain classes of these systems.
Findings
New characterization of compatible split systems
Unique tree representation criteria established
Verification of a 2008 conjecture for specific classes
Abstract
A split system on a multiset is a set of bipartitions of . Such a split system is compatible if it can be represented by a tree in such a way that the vertices of the tree are labelled by the elements in , the removal of each edge in the tree yields a bipartition in by taking the labels of the two resulting components, and every bipartition in can be obtained from the tree in this way. In this contribution, we present a novel characterization for compatible split systems, and for split systems admitting a unique tree representation. In addition, we show that a conjecture on compatibility stated in 2008 holds for some large classes of split systems.
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
Topicsgraph theory and CDMA systems · Graph theory and applications · semigroups and automata theory
