AbstractWe show that the number of factorizationsσ=χ1…χrof a cycle of lengthninto a product of cycles of lengthsa1, …, ar, with ∑rj=1(aj−1)=n−1, is equal tonr−1. This generalizes a well known result of J. Denes, concerning factorizations into a product of transpositions. We investigate some consequences of this result, for central multiplicative functions on the infinite symmetric group, and use them to give a new proof of a recent result of A. Nica and R. Speicher on non-crossing partitions
AbstractWe give a compact expression for the number of factorizations of any permutation into a mini...
We consider the problem of counting transitive factorizations of permutations; that is, we study tu...
We give a compact expression for the number of factorizations of any permutation into a minimal numb...
International audienceIt is known that the number of minimal factorizations of the long cycle in the...
International audienceWe give a bijective proof of the fact that the number of k-prefixes of minimal...
Abstract. We give a new expression for the number of factorizations of a full cycle into an ordered ...
AbstractThe factorizations of an n-cycle of the symmetric group Sn into m permutations with prescrib...
AbstractWe consider the determination of the number ck(α) of ordered factorizations of an arbitrary ...
We present various results on multiplying cycles in the symmetric group. One result is a generalisat...
We present various results on multiplying cycles in the symmetric group. One result is a generalisat...
International audienceIt is known that the number of minimal factorizations of the long cycle in the...
International audienceIt is known that the number of minimal factorizations of the long cycle in the...
We present various results on multiplying cycles in the symmetric group. One result is a generalisat...
We present various results on multiplying cycles in the symmetric group. One result is a generalisat...
We give a compact expression for the number of factorizations of any permutation into a minimal numb...
AbstractWe give a compact expression for the number of factorizations of any permutation into a mini...
We consider the problem of counting transitive factorizations of permutations; that is, we study tu...
We give a compact expression for the number of factorizations of any permutation into a minimal numb...
International audienceIt is known that the number of minimal factorizations of the long cycle in the...
International audienceWe give a bijective proof of the fact that the number of k-prefixes of minimal...
Abstract. We give a new expression for the number of factorizations of a full cycle into an ordered ...
AbstractThe factorizations of an n-cycle of the symmetric group Sn into m permutations with prescrib...
AbstractWe consider the determination of the number ck(α) of ordered factorizations of an arbitrary ...
We present various results on multiplying cycles in the symmetric group. One result is a generalisat...
We present various results on multiplying cycles in the symmetric group. One result is a generalisat...
International audienceIt is known that the number of minimal factorizations of the long cycle in the...
International audienceIt is known that the number of minimal factorizations of the long cycle in the...
We present various results on multiplying cycles in the symmetric group. One result is a generalisat...
We present various results on multiplying cycles in the symmetric group. One result is a generalisat...
We give a compact expression for the number of factorizations of any permutation into a minimal numb...
AbstractWe give a compact expression for the number of factorizations of any permutation into a mini...
We consider the problem of counting transitive factorizations of permutations; that is, we study tu...
We give a compact expression for the number of factorizations of any permutation into a minimal numb...