AbstractA method is described by which the enumeration of permutations of 1, 2, … n with a prescribed sequence A of rises and falls, or a prescribed sequence B of inversions of order, or with both A and B, is effected in terms of numbers derived from the representation theory of the symmetric group. A connexion with Schensted pairs of standard Young tableaux is also discussed
AbstractThe problem of the number p(n , r), (1 ⩽r⩽n), of permutations on the set {1,…,n} with longes...
AbstractLetn = (a1.a2 … aN) denote a sequence of integers ai={1.2.…n}. A rise is a part ai.ai+1 with...
AbstractA permutation is called parity alternating if its entries assume even and odd integers alter...
Abstract. Enumeration schemes were developed by Zeilberger, Vatter, and Pudwell as automatable metho...
AbstractGeneralizing the notion of up-down permutations, the author considers sequences σ = (a1, a2,...
Permutations that avoid given patterns have been studied in great depth for their connections to oth...
AbstractThe definitions of descent, excedance, major index, inversion index and Denert's statistics ...
AbstractA general method is provided for enumerating sequences σ1σ2 … σn with respect to length, num...
Abstract. In this paper we present a systematic approach to enumeration of differ-ent classes of tre...
AbstractWe study permutation enumeration of the hyperoctahedral group Bn through a combinatorial use...
AbstractIn a recent paper, Brenti shows that enumerating a conjugacy class of Sn with respect to exc...
AbstractLet π=(π1, π2,…,πn) denote a permutation of Zn = {1, 2,…, n}. The pair (πi, πi+1) is a rise ...
AbstractThe excedance set of a permutation π=π1π2···πn is the set of indices i for which πi>i. We gi...
The definitions of descent, excedance, major index, inversion index and Denert's statistic for ...
A tableau inversion is a pair of entries in row-standard tableau T that lie in the same column of T ...
AbstractThe problem of the number p(n , r), (1 ⩽r⩽n), of permutations on the set {1,…,n} with longes...
AbstractLetn = (a1.a2 … aN) denote a sequence of integers ai={1.2.…n}. A rise is a part ai.ai+1 with...
AbstractA permutation is called parity alternating if its entries assume even and odd integers alter...
Abstract. Enumeration schemes were developed by Zeilberger, Vatter, and Pudwell as automatable metho...
AbstractGeneralizing the notion of up-down permutations, the author considers sequences σ = (a1, a2,...
Permutations that avoid given patterns have been studied in great depth for their connections to oth...
AbstractThe definitions of descent, excedance, major index, inversion index and Denert's statistics ...
AbstractA general method is provided for enumerating sequences σ1σ2 … σn with respect to length, num...
Abstract. In this paper we present a systematic approach to enumeration of differ-ent classes of tre...
AbstractWe study permutation enumeration of the hyperoctahedral group Bn through a combinatorial use...
AbstractIn a recent paper, Brenti shows that enumerating a conjugacy class of Sn with respect to exc...
AbstractLet π=(π1, π2,…,πn) denote a permutation of Zn = {1, 2,…, n}. The pair (πi, πi+1) is a rise ...
AbstractThe excedance set of a permutation π=π1π2···πn is the set of indices i for which πi>i. We gi...
The definitions of descent, excedance, major index, inversion index and Denert's statistic for ...
A tableau inversion is a pair of entries in row-standard tableau T that lie in the same column of T ...
AbstractThe problem of the number p(n , r), (1 ⩽r⩽n), of permutations on the set {1,…,n} with longes...
AbstractLetn = (a1.a2 … aN) denote a sequence of integers ai={1.2.…n}. A rise is a part ai.ai+1 with...
AbstractA permutation is called parity alternating if its entries assume even and odd integers alter...
DOI
Add to ORKG