Abstract
Let be a group acting on a set . The distinguishing number for this action of on , denoted by , is the smallest natural number such that the elements of can be labeled with labels so that any label-preserving element of fixes all . 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 which is the smallest number of labels admitting a labeling of such that the only elements of that induce label-preserving permutations lie in . Finally, we state two algorithms for obtaining an upper and a lower bound for .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.