On the Pólya Enumeration Theorem

Simple item page
dc.creatorFel, Leonid G.
dc.creatorZimmels, Yoram
dc.date2005-08-25
dc.date.accessioned2026-07-07T05:22:42Z
dc.date.available2026-07-07T05:22:42Z
dc.descriptionSimple formulas for the number of different cyclic and dihedral necklaces containing $n_j$ beads of the $j$-th color, $j\leq m$ and $\sum_{j=1}^mn_j=N$, are derived.
dc.description3 pages
dc.identifierhttps://arxiv.org/abs/math/0508512
dc.identifierhttp://arxiv.org/abs/math/0508512
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/76162
dc.subjectCombinatorics
dc.titleOn the Pólya Enumeration Theorem
dc.typetext

Files

Collections

arXiv