We present some enumerative results concerning the permutations of the multiset {x_1^{m_1},...,x_r^{m_r}} having inversion number congruent to k modulo n, k<n. We show that, for some m, the enumeration of this family of permutations is strictly connected to gcd(m_1,...,m_r). Using a cycle lemma, a combinatorial proof of the results is given
AbstractA method is described by which the enumeration of permutations of 1, 2, … n with a prescribe...
Inversion sequences of length n, In, are integer sequences (e , . . ., e ) with 0 ≤ e \u3c i for ea...
We will study the inversion statistic of 321-avoiding permutations, and obtain that the number of 32...
We present some enumerative results concerning the permutations of the multiset {x_1^{m_1},...,x_r^{...
In this paper we study some properties of the inversion statistic. Some enumerative results concerni...
AbstractIn this paper we study some properties of the inversion statistic. Some enumerative results ...
AbstractThe purpose of this paper is to present some enumerative results concerning the class Ik of ...
The purpose of this paper is to present some enumerative results concerning the class View the MathM...
AbstractIn this paper we study permutations of the multiset {1r, 2r, …, nr}, which generalizes Gesse...
Permutations consisting of a single cycle are considered. EDELMAN (1987) proved that such permutatio...
AbstractWe define a new combinatorial statistic, maximal-inversion, on a permutation. We remark that...
Let [n] = {1, 2, 3,..., n} be the set of the first n positive integers. A permutation π is a biject...
Abstract. Let h, k be integers such that 0 < h < k and (h, k) = 1. If 1 ≤ i ≤ k − 1, let ri b...
Permutations that avoid given patterns have been studied in great depth for their connections to oth...
We solve two related extremal problems in the theory of permutations. A set of permutations of the ...
AbstractA method is described by which the enumeration of permutations of 1, 2, … n with a prescribe...
Inversion sequences of length n, In, are integer sequences (e , . . ., e ) with 0 ≤ e \u3c i for ea...
We will study the inversion statistic of 321-avoiding permutations, and obtain that the number of 32...
We present some enumerative results concerning the permutations of the multiset {x_1^{m_1},...,x_r^{...
In this paper we study some properties of the inversion statistic. Some enumerative results concerni...
AbstractIn this paper we study some properties of the inversion statistic. Some enumerative results ...
AbstractThe purpose of this paper is to present some enumerative results concerning the class Ik of ...
The purpose of this paper is to present some enumerative results concerning the class View the MathM...
AbstractIn this paper we study permutations of the multiset {1r, 2r, …, nr}, which generalizes Gesse...
Permutations consisting of a single cycle are considered. EDELMAN (1987) proved that such permutatio...
AbstractWe define a new combinatorial statistic, maximal-inversion, on a permutation. We remark that...
Let [n] = {1, 2, 3,..., n} be the set of the first n positive integers. A permutation π is a biject...
Abstract. Let h, k be integers such that 0 < h < k and (h, k) = 1. If 1 ≤ i ≤ k − 1, let ri b...
Permutations that avoid given patterns have been studied in great depth for their connections to oth...
We solve two related extremal problems in the theory of permutations. A set of permutations of the ...
AbstractA method is described by which the enumeration of permutations of 1, 2, … n with a prescribe...
Inversion sequences of length n, In, are integer sequences (e , . . ., e ) with 0 ≤ e \u3c i for ea...
We will study the inversion statistic of 321-avoiding permutations, and obtain that the number of 32...
DOI
Add to ORKG