The distinguishing number of groups based on the distinguishing number of subgroups

preprint2016arXivOpen access

Abstract

Let ΓΓ be a group acting on a set XX. The distinguishing number for this action of ΓΓ on XX, denoted by DΓ(X)D_Γ(X), is the smallest natural number kk such that the elements of XX can be labeled with kk labels so that any label-preserving element of ΓΓ fixes all x∈Xx \in X. In particular, if the action is faithful, then the only element of ΓΓ preserving labels is the identity. In this paper, we obtain an upper bound on the distinguishing number of a set knowing the distinguishing number of a set under the action of a subgroup. By the concept of motion, we obtain an upper bound for the distinguishing number of a group. Motivated by a problem (Chan 2006), we characterize DΓ,H(X)D_{Γ,H}(X) which is the smallest number of labels admitting a labeling of XX such that the only elements of ΓΓ that induce label-preserving permutations lie in HH. Finally, we state two algorithms for obtaining an upper and a lower bound for DΓ,H(X)D_{Γ, H}(X).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.