Pairings and related symmetry notions (Q1989479)

A pairing is a triple \(\mathfrak{P} = (U, F,\Lambda)\), where \(U\) and \(\Lambda\) are non-empty sets and \(F : U \times \Omega \to \Lambda\) is a map. The authors show several examples of pairings for graphs, metric spaces, group actions and vector spaces with a given bilinear form. They reinterpret the notion of indiscernibility with respect to a given attribute set of information table on terms of local symmetry on \(U\). Then, they study so-called global version of symmetry which they call indistinguishability. They describe the symmetry transmission between subsets of \(\Omega\) and apply this concept for digraphs families.