Add to ORKGWe give simple combinatorial proofs of some formulas for the number of factorizations of permutations in Sn as a product of two n-cycles, or of an n-cycle and an (n − 1)-cycle. Dedicated to Antonio Mach̀ı, on his 70th birthday 1
AbstractWe give a combinatorial proof of the formula giving the number of representations of an even...
AbstractThe central result of this paper is a generalization of the theorem that, for n ≥ 5, every e...
In this note we present a combinatorial proof of an identity involving the two kinds of Stirling num...
AbstractWe give simple combinatorial proofs of some formulas for the number of factorizations of per...
International audienceWe give simple combinatorial proofs of some formulas for the number of factori...
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...
AbstractWe prove by elementary combinatorial methods that the number of factorizations of an n-cycle...
AbstractWe give a combinatorial proof of the formula giving the number of representations of an even...
AbstractWe give a new expression for the number of factorizations of a full cycle into an ordered pr...
AbstractWe prove bijectively that the total number of cycles of all even permutations of [n]={1,2,…,...
AbstractUsing the character theory of the symmetric group n, an explicit formula is derived for the ...
AbstractA recursion is developed for the number ƒ;(P) of ways a permutation P on n symbols can be wr...
Abstract. We give a new expression for the number of factorizations of a full cycle into an ordered ...
Let Xn be an n-element set. We give an alternative proof of Cauchy’s theorem for the number of...
AbstractWe give a combinatorial proof of the formula giving the number of representations of an even...
AbstractThe central result of this paper is a generalization of the theorem that, for n ≥ 5, every e...
In this note we present a combinatorial proof of an identity involving the two kinds of Stirling num...
AbstractWe give simple combinatorial proofs of some formulas for the number of factorizations of per...
International audienceWe give simple combinatorial proofs of some formulas for the number of factori...
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...
AbstractWe prove by elementary combinatorial methods that the number of factorizations of an n-cycle...
AbstractWe give a combinatorial proof of the formula giving the number of representations of an even...
AbstractWe give a new expression for the number of factorizations of a full cycle into an ordered pr...
AbstractWe prove bijectively that the total number of cycles of all even permutations of [n]={1,2,…,...
AbstractUsing the character theory of the symmetric group n, an explicit formula is derived for the ...
AbstractA recursion is developed for the number ƒ;(P) of ways a permutation P on n symbols can be wr...
Abstract. We give a new expression for the number of factorizations of a full cycle into an ordered ...
Let Xn be an n-element set. We give an alternative proof of Cauchy’s theorem for the number of...
AbstractWe give a combinatorial proof of the formula giving the number of representations of an even...
AbstractThe central result of this paper is a generalization of the theorem that, for n ≥ 5, every e...
In this note we present a combinatorial proof of an identity involving the two kinds of Stirling num...