The maximum distinguishing number of a group

Abstract

Let G be a group acting faithfully on a set X. The distinguishing number of the action of G on X, denoted DG(X), is the smallest number of colors such that there exists a, coloring of X where no nontrivial group element induces a colorpreserving permutation of X. In this paper, we show that if G is nilpotent of class c or supersolvable of length c then G always acts with distinguishing number at most c + 1. We obtain that all met acyclic groups act with distinguishing number at most 3; these include all groups of squarefree order. We also prove that the distinguishing number of the action of the general linear group GLn(K] over a field K on the vector space Kn is 2 if K has at least n + 1 elements.