activity
20122021
most citedDistinguishing simple groups

3 citations · 4 across the 11 of their papers we have counts for

collaborators
Showing 2019Show all

5 papers · 1 filter

math.CO2019

Abelian permutation groups with graphical representations

Mariusz Grech, Andrzej Kisielewicz

In this paper we characterize permutation groups that are automorphism groups of coloured graphs and digraphs and are abelian as abstract groups. This is done in terms of basic per…

math.CO2019

Wreath product in automorphism groups of graphs

Mariusz Grech, Andrzej Kisielewicz

The automorphism group of the composition of graphs contains the wreath product of the automorphism groups of the corresponding graphs. The classica…

math.CO2019

Symmetry groups of boolean functions: simple groups

Mariusz Grech, Andrzej Kisielewicz

We consider the problem of characterizing the class of those permutation groups that are the symmetry groups of Boolean functions. These are exactly the automorphism groups of hype…

math.GR2019★ 1 cited

Subgroups of simple primitive permutation groups defined by unordered relations (Automorphism groups of hypergraphs)

Mariusz Grech, Andrzej Kisielewicz

The problem of describing the invariance groups of unordered relations, called briefly \emph{relation groups}, goes back to classical work by H. Wielandt. In general, the problem t…

math.CO2019

Decompositions of the authomorphism groups of edge-colored graphs into the direct product of permutation groups

Mariusz Grech

In the paper Graphical complexity of products of permutation groups, M. Grech, A. Jez, A. Kisielewicz have proved that the direct product of automorphism groups of edge-colored gra…