Abstract
If X is a finite set and G a finite group acting on X, then an action of G on $P(X)$, the set of all subsets of X, is induced in a natural way. An efficient generating algorithm is described which, when incorporated into a backtrack procedure, produces a system of distinct representatives for the action of G on $P(X)$.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
