Skip to main content

Counting Problems That Involve Symmetry

  • Chapter
Counting with Symmetric Functions

Part of the book series: Developments in Mathematics ((DEVM,volume 43))

  • 1552 Accesses

Abstract

Symmetric functions are used to prove Pólya’s enumeration theorem, allowing us to count objects modulo symmetries.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Chen, Y.M.: Combinatorial Algorithms for Plethysm. ProQuest LLC, Ann Arbor (1982). Thesis (Ph.D.), University of California, San Diego

    Google Scholar 

  2. Hall, J.I., Palmer, E.M., Robinson, R.W.: Redfield’s lost paper in a modern context. J. Graph Theory 8(2), 225–240 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  3. Harary, F., Palmer, E.: The enumeration methods of Redfield. Am. J. Math. 89, 373–384 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  4. Harary, F., Robinson, R.W.: The rediscovery of Redfield’s papers. J. Graph Theory 8(2), 191–193 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  5. James, G., Liebeck, M.: Representations and Characters of Groups, 2nd edn. Cambridge University Press, New York (2001)

    Book  MATH  Google Scholar 

  6. Liese, J., Remmel, J.: Q-analogues of the number of permutations with k-excedances. Pure Math. Appl. 21(2), 285–320 (2010)

    MathSciNet  MATH  Google Scholar 

  7. Mendes, A., Remmel, J.B., Riehl, A.: Permutations with k-regular descent patterns. In: Permutation Patterns. London Mathematical Society Lecture Note Series, vol. 376, pp. 259–285. Cambridge University Press, Cambridge (2010)

    Google Scholar 

  8. Murnaghan, F.D.: The characters of the symmetric group. Am. J. Math. 59(4), 739–753 (1937)

    Article  MathSciNet  Google Scholar 

  9. Nakayama, T.: On some modular properties of irreducible representations of a symmetric group, I. Jpn. J. Math. 18, 89–108 (1941)

    Google Scholar 

  10. Niedermaier, A., Remmel, J.: Analogues of up-down permutations for colored permutations. J. Integer Seq. 13(5), Article 10.5.6, 32 (2010)

    Google Scholar 

  11. Ram, A., Remmel, J.B., Whitehead, T.: Combinatorics of the q-basis of symmetric functions. J. Comb. Theory Ser. A 76(2), 231–271 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  12. Robinson, G.d.B.: On the representations of the symmetric group. Am. J. Math. 60(3), 745–760 (1938). doi:10.2307/2371609. http://www.dx.doi.org/10.2307/2371609

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Mendes, A., Remmel, J. (2015). Counting Problems That Involve Symmetry. In: Counting with Symmetric Functions. Developments in Mathematics, vol 43. Springer, Cham. https://doi.org/10.1007/978-3-319-23618-6_6

Download citation

Publish with us

Policies and ethics