A note on Pólya’s theorem

1984 ◽  
Vol 35 (1) ◽  
pp. 104-111
Author(s):  
Dinis Pestana
2007 ◽  
Vol 81 (1-2) ◽  
pp. 247-259 ◽  
Author(s):  
I. P. Rochev

1967 ◽  
Vol 19 ◽  
pp. 792-799 ◽  
Author(s):  
J. Sheehan

In 1927 J. H. Redfield (9) stressed the intimate interrelationship between the theory of finite groups and combinatorial analysis. With this in mind we consider Pólya's theorem (7) and the Redfield-Read superposition theorem (8, 9) in the context of the theory of permutation representations of finite groups. We show in particular how the Redfield-Read superposition theorem can be deduced as a special case from a simple extension of Pólya's theorem. We give also a generalization of the superposition theorem expressed as the multiple scalar product of certain group characters. In a later paper we shall give some applications of this generalization.


2010 ◽  
Vol 117 (3) ◽  
pp. 220
Author(s):  
David A. Levin ◽  
Yuval Peres

2014 ◽  
Vol 169 ◽  
pp. 162-167 ◽  
Author(s):  
Lakshmy K.V. ◽  
M. Sethumadhavan ◽  
Thomas W. Cusick

1987 ◽  
Vol 60 (5) ◽  
pp. 275-282 ◽  
Author(s):  
R. C. Read

Sign in / Sign up

Export Citation Format

Share Document