14
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

An algorithm for orbits of g-sets

Pages 163-167 | Published online: 19 Mar 2007

References

  • Chao , C. Y. and Zhang , H. 1990 . On partitions of functions on finite sets . Intern. J. Computer Math , 32 : 39 – 74 .
  • Coxeter , H. S. M. and Moser , W. O. J. 1957 . Generators and relations for discrete groups , Berlin : Springer-Verlag .
  • De Bruijn , N. G. 1964 . “ Polya's theorem of counting ” . In Applied Combinatorial Mathematics , Edited by: Beckenbach , E. F. New York : Wiley .
  • Gorenstein , D. 1982 . Finite simple groups , New York : Plenum .
  • Polya , G. 1937 . Kombinatorische Anzahlbestimmungen fur Gruppen Graphen und chemische Verbin dungen . Acta Math , 68 : 145 – 254 .
  • Polya , G. and Read , R. C. 1987 . Combinatorial enumeration of groups, graphs and chemical compounds , New York : Spring-Verlag .
  • Warshall , S. 1962 . A theorem on Boolean matrices . Journal of the ACM , 9 : 11 – 12 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.