A combinatorial approach to the double cosets of the symmetric group with respect to Young subgroups

被引：7

作者：

Jones, AR ^{[1
]}

机构：

[1] UNIV WALES,DEPT MATH,ABERYSTWYTH SY23 3BZ,DYFED,WALES

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 1996年 / 17卷 / 07期

基金：

英国工程与自然科学研究理事会;

关键词：

D O I：

10.1006/eujc.1996.0056

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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. (C) 1996 Academic Press Limited

引用

页码：647 / 655

页数：9