Flips in symmetric separated set-systems
Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy

TL;DR
This paper extends known connectivity results of maximal separated collections to symmetric set-systems, introducing symmetric flips and exploring related geometric structures, with implications for symmetric higher Bruhat orders.
Contribution
It establishes that all maximal symmetric separated collections are connected via symmetric flips and explores their geometric representations, extending prior non-symmetric results.
Findings
Maximal symmetric strongly separated collections are connected via symmetric flips.
Maximal symmetric r-separated collections are connected when n and r are even.
The results relate to symmetric higher Bruhat orders and geometric tilings.
Abstract
For a positive integer , a collection of subsets of is called symmetric if implies , where (the involution was introduced by Karpman). Leclerc and Zelevinsky showed that the set of maximal strongly (resp. weakly) separated collections in is connected via flips, or mutations, ``in the presence of six (resp. four) witnesses''. We give a symmetric analog of those results, by showing that each maximal symmetric strongly (weakly) separated collection in can be obtained from any other one by a series of special symmetric local transformations, so-called symmetric flips. Also we establish the connectedness via symmetric flips for the class of maximal symmetric -separated collections in when are even (where sets are called -separated if…
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 Combinatorial Mathematics · semigroups and automata theory · Limits and Structures in Graph Theory
