Author： Jones A.R.
Publisher： Academic Press
ISSN： 0195-6698
Source： European Journal of Combinatorics, Vol.17, Iss.7, 1996-10, pp. : 647-655
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Combinatorial methods are employed to study the double cosets of the symmetric group S n with respect to Young subgroups H and K. The current paper develops a correspondence between these double cosets and certain lists of integers. This approach leads naturally to an algorithm for computing the number of (H, K)- double cosets of S n .
Related content
A Combinatorial Approach to the Fusion Process for the Symmetric Group
European Journal of Combinatorics, Vol. 19, Iss. 7, 1998-10 ,pp. :
Access to resources
Recommend
Closed subgroups of the infinite symmetric group
By Bergman George Shelah Saharon
algebra universalis, Vol. 55, Iss. 2-3, 2006-08 ,pp. :
Characterizing Translations on Groups by Cosets of Their Subgroups
Communications in Algebra, Vol. 40, Iss. 9, 2012-09 ,pp. :