Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Counting Patterns with a Given Automorphism Group

Dennis E. White
Proceedings of the American Mathematical Society
Vol. 47, No. 1 (Jan., 1975), pp. 41-44
DOI: 10.2307/2040204
Stable URL: http://www.jstor.org/stable/2040204
Page Count: 4
  • Read Online (Free)
  • Download ($30.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Counting Patterns with a Given Automorphism Group
Preview not available

Abstract

A formula, analogous to the classical Burnside lemma, is developed which counts orbit representatives from a set under a group action with a given stabilizer subgroup conjugate class. This formula is applied in a manner analogous to a proof of Pólya's theorem to obtain an enumeration of patterns with a given automorphism group.

Page Thumbnails

  • Thumbnail: Page 
41
    41
  • Thumbnail: Page 
42
    42
  • Thumbnail: Page 
43
    43
  • Thumbnail: Page 
44
    44