COUNTING PERMUTATIONS WITH GIVEN CYCLE STRUCTURE AND DESCENT SET

被引：162

作者：

GESSEL, IM ^{[1
]}

REUTENAUER, C ^{[1
]}

机构：

[1] UNIV QUEBEC, MONTREAL H3C 3P8, PQ, CANADA

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES A | 1993年 / 64卷 / 02期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1016/0097-3165(93)90095-P

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The number of permutations with given cycle structure and descent set is shown to be equal to the scalar product of two special characters of the symmetric group. Enumerative applications are given to cycles, involutions and derangements. © 1993 Academic Press, Inc.

引用

页码：189 / 215

页数：27

共 55 条

[1]

ANDREWS GE, 1976, ENCY MATH ITS APPLIC, V2

[2] THE ORLIK-SOLOMON ALGEBRA ON THE PARTITION LATTICE AND THE FREE LIE-ALGEBRA [J].