We obtain the generating functions for the combinatorial enumeration of colorings of all hyperplanes of hypercubes for all irreducible representations of the hyperoctahedral groups. The computational group theoretical techniques involve the construction of generalized character cycle indices of all irreducible representations for all hyperplanes of the hypercube using the M\"{o}bius function, polynomial generators for all cycle types and for all hyperplanes. This is followed by the construction of the generating functions for colorings of all (n-q)-hyperplanes of the hypercube, for example, vertices (q=5), edges (q=4), faces (q=3), cells (q=2) and tesseracts (q=4) for a 5D-hypercube. Tables are constructed for the combinatorial numbers for coloring all hyperplanes of 5D-hypercubes for 36 irreducible representations. Applications to chirality, chemistry and biology are also pointed out.
Combinatorial Enumerations Colorings of hypercubes Character Tables of hypercubes Pólya Theory for all charters Character cycle indices for all hyperplanes
Primary Language | English |
---|---|
Subjects | Mathematical Sciences |
Journal Section | Articles |
Authors | |
Publication Date | December 30, 2018 |
Submission Date | October 18, 2018 |
Acceptance Date | November 29, 2018 |
Published in Issue | Year 2018 |
Journal of Mathematical Sciences and Modelling
The published articles in JMSM are licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.