International audienceWe give simple combinatorial proofs of some formulas for the number of factorizations of permutations in S n as a product of two n-cycles, or of an n-cycle and an (n−1)-cycle. ... The parameter number of cycles plays a central role in the algebraic theory of the symmetric group, however there are very few results giving a relationship between the number of cycles of two permutations and that of their product. ... The first results on the subject go back to Ore, Bertram, Stanley (see [13], [1] and [15]), who proved some existence theorems. These results allowed to obtain ..
Abstract. We give a new expression for the number of factorizations of a full cycle into an ordered ...
We present various results on multiplying cycles in the symmetric group. One result is a generalisat...
AbstractThe central result of this paper is a generalization of the theorem that, for n ≥ 5, every e...
International audienceWe give simple combinatorial proofs of some formulas for the number of factori...
AbstractWe give simple combinatorial proofs of some formulas for the number of factorizations of per...
We give simple combinatorial proofs of some formulas for the number of factorizations of permutation...
AbstractWe give simple combinatorial proofs of some formulas for the number of factorizations of per...
AbstractWe prove by elementary combinatorial methods that the number of factorizations of an n-cycle...
AbstractA recursion is developed for the number ƒ;(P) of ways a permutation P on n symbols can be wr...
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 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...
AbstractWe give a combinatorial proof of the formula giving the number of representations of an even...
AbstractWe give a combinatorial proof of the formula giving the number of representations of an even...
Abstract. We give a new expression for the number of factorizations of a full cycle into an ordered ...
We present various results on multiplying cycles in the symmetric group. One result is a generalisat...
AbstractThe central result of this paper is a generalization of the theorem that, for n ≥ 5, every e...
International audienceWe give simple combinatorial proofs of some formulas for the number of factori...
AbstractWe give simple combinatorial proofs of some formulas for the number of factorizations of per...
We give simple combinatorial proofs of some formulas for the number of factorizations of permutation...
AbstractWe give simple combinatorial proofs of some formulas for the number of factorizations of per...
AbstractWe prove by elementary combinatorial methods that the number of factorizations of an n-cycle...
AbstractA recursion is developed for the number ƒ;(P) of ways a permutation P on n symbols can be wr...
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 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...
AbstractWe give a combinatorial proof of the formula giving the number of representations of an even...
AbstractWe give a combinatorial proof of the formula giving the number of representations of an even...
Abstract. We give a new expression for the number of factorizations of a full cycle into an ordered ...
We present various results on multiplying cycles in the symmetric group. One result is a generalisat...
AbstractThe central result of this paper is a generalization of the theorem that, for n ≥ 5, every e...