A Generalization of Polya's Enumeration Theorem or the Secret Life of Certain Index Sets

Details A Generalization of Polya's Enumeration Theorem or the Secret Life of Certain Index Sets A Generalization of Polya's Enumeration Theorem or the Secret Life of Certain Index Sets

1999-02-12

arxiv.org/abs/math/9902075v1

Mathematics

Representation Theory

10 pages, uses vanilla.sty

Scientific paper

Polya's fundamental enumeration theorem is generalized in terms of Schur-Macdonald's theory (S-MT) of invariant matrices. Given a permutation group $W\leq S_d$ and a one-dimensional character $\chi$ of $W$, the polynomial functor $F_\chi$ corresponding via S-MT to the induced monomial representation $U_\chi = ind_W^{S_d}(\chi)$ of $S_d$, is studied. It turns out that the characteristic $ch(F_\chi)$ is the weighted inventory of some set $J(\chi)$ of $W$-orbits in the integer-valued hypercube $[0,\infty)^d$. The elements of $J(\chi) can be distinguished among all $W$-orbits by a maximum property. The identity $ch(F_\chi) = ch(U_\chi)$ of both characteristics is a consequence of S-MT. Polya's theorem can be obtained from the above identity by specialization $\chi=1_W$, where $1_W$ is the unit character of $W$.

Affiliated with

Also associated with

No associations

Rating

A Generalization of Polya's Enumeration Theorem or the Secret Life of Certain Index Sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Generalization of Polya's Enumeration Theorem or the Secret Life of Certain Index Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Generalization of Polya's Enumeration Theorem or the Secret Life of Certain Index Sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-228269