English

A Generalization of Redfield's Master Theorem

Representation Theory 2007-05-23 v1 Combinatorics

Abstract

Generalizations of Redfield's master theorem and superposition theorem are proved by using decomposition of the tensor product of several induced monomial representations of the symmetric group SdS_d into transitive constituents. As direct consequences, one obtains several graphical corollaries. Given graphs Γ1,\hdots,Γk\Gamma_1,\hdots ,\Gamma_k, with dd vertices, together with their automorphism groups W1Sd,\hdots,WkSdW_1\leq S_d,\hdots, W_k\leq S_d, one can find the number of superpositions of Γ1,\hdots,Γk\Gamma_1,\hdots ,\Gamma_k, whose automorphism groups satisfy one of the following conditions: (1) the groups consist of even permutations; (2) the groups are trivial, in case at least one of WmW_m's is cyclic; (3) the groups are of odd order, in case at least one of WmW_m's is dihedral and its order is not divisible by 4; (4) the groups are of order dividing a natural number rr, in case at least one of WmW_m's has a normal solvable subgroup of order rr, such that the corresponding factor-group is cyclic of order relatively prime to rr; (5) the groups are qq-groups (qq is a prime), in case at least one of WmW_m's has a normal qq-subgroup such that the corresponding factor-group is cyclic of order relatively prime to qq.

Keywords

Cite

@article{arxiv.math/9902089,
  title  = {A Generalization of Redfield's Master Theorem},
  author = {Valentin Vankov Iliev},
  journal= {arXiv preprint arXiv:math/9902089},
  year   = {2007}
}

Comments

9 pages, uses plain TeX

R2 v1 2026-07-22T18:02:00.172Z