Flips in symmetric separated set-systems

Authors Vladimir I. Danilov, Alexander V. Karzanov, G. A. Koshevoy

Publication date 17 February 2021

Combinatorial aspects of representation theory (05E10) Combinatorial aspects of tessellation and tiling problems (05B45)

Abstract: For a positive integer

n

, a collection

S

of subsets of

[n] = 1, l d o t s, n

is called symmetric if

X i n S

implies

X^{a} s t i n S

, where

X^{a} s t := i i n [n] c o l o n n - i + 1 o t i n X

(the involution

a s t

was introduced by Karpman). Leclerc and Zelevinsky showed that the set of maximal strongly (resp. weakly) separated collections in

2^{[n]}

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 $2^{[n]}$ 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 $r$ -separated collections in $2^{[n]}$ when $n, r$ are even (where sets $A, B s u b s e t e q [n]$ are called $r$ -separated if there are no elements $i_{0} < i_{1} < c d o t s < i_{r + 1}$ in $[n]$ which alternate in $A s e t m i n u s B$ and $B s e t m i n u s A$ ). This is related to a symmetric version of higher Bruhat orders. These results are obtained as consequences of our study of related geometric objects: symmetric rhombus and combined tilings and symmetric cubillages.

This page was built for publication: Flips in symmetric separated set-systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6360891)