Add to ORKGAbstract. Let pi be an even permutation on n letters which has a root, that is, there exists an even permutation ξ such that pi = ξ2. In this article the number of this kind of pi is found by using generating function techniques. This is the analogue of a result for the number of all permutations with roots
Babson and Steingrimsson introduced generalized permutation patterns that allow the requirement that...
AbstractA permutation of n objects is of cycle type (j1,…,jn) if it has jk, k=1,…,n, cycles of lengt...
Let m be a positive integer, and p n (m) the proportion of permutations of the symmetric group S n ...
AbstractWe study generating functions for the number of even (odd) permutations on n letters avoidin...
We study the generating function for the number of even (or odd) permutations on n letters containin...
AbstractWe study the generating function for the number of permutations on n letters containing exac...
AbstractWe study generating functions for the number of permutations on n letters avoiding 132 and a...
AbstractThis note is a continuation of a paper by the same authors that appeared in 2002 in the same...
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal...
AbstractIt is proved that the number of permuations on 1, 2, ..., n with exactly one increasing subs...
http://arxiv.org/PS_cache/math/pdf/9712/9712223v1.pdfWe give a short argument that for any fixed n, ...
AbstractWe prove that every entry in a simple permutation of length at least 4 is contained in a cop...
AbstractProving a first nontrivial instance of a conjecture of Noonan and Zeilberger we show that th...
AbstractWe give a combinatorial proof of the formula giving the number of representations of an even...
AbstractWe extend Stanley's work on alternating permutations with extremal number of fixed points in...
Babson and Steingrimsson introduced generalized permutation patterns that allow the requirement that...
AbstractA permutation of n objects is of cycle type (j1,…,jn) if it has jk, k=1,…,n, cycles of lengt...
Let m be a positive integer, and p n (m) the proportion of permutations of the symmetric group S n ...
AbstractWe study generating functions for the number of even (odd) permutations on n letters avoidin...
We study the generating function for the number of even (or odd) permutations on n letters containin...
AbstractWe study the generating function for the number of permutations on n letters containing exac...
AbstractWe study generating functions for the number of permutations on n letters avoiding 132 and a...
AbstractThis note is a continuation of a paper by the same authors that appeared in 2002 in the same...
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal...
AbstractIt is proved that the number of permuations on 1, 2, ..., n with exactly one increasing subs...
http://arxiv.org/PS_cache/math/pdf/9712/9712223v1.pdfWe give a short argument that for any fixed n, ...
AbstractWe prove that every entry in a simple permutation of length at least 4 is contained in a cop...
AbstractProving a first nontrivial instance of a conjecture of Noonan and Zeilberger we show that th...
AbstractWe give a combinatorial proof of the formula giving the number of representations of an even...
AbstractWe extend Stanley's work on alternating permutations with extremal number of fixed points in...
Babson and Steingrimsson introduced generalized permutation patterns that allow the requirement that...
AbstractA permutation of n objects is of cycle type (j1,…,jn) if it has jk, k=1,…,n, cycles of lengt...
Let m be a positive integer, and p n (m) the proportion of permutations of the symmetric group S n ...