AbstractWe give a compact expression for the number of factorizations of any permutation into a minimal number of transpositions of the form (1i). This generalizes earlier work of Pak in which substantial restrictions were placed on the permutation being factored. Our result exhibits an unexpected and simple symmetry of star factorizations that has yet to be explained in a satisfactory manner
International audienceIt is known that the number of minimal factorizations of the long cycle in the...
We give a combinatorial proof of Goulden and Jackson's formula for the number of minimal transitive ...
We want to draw the combintorialists attention to an important, but apparently little known paper by...
We give a compact expression for the number of factorizations of any permutation into a minimal numb...
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 give a compact expression for the number of factorizations of any permutation into a minimal numb...
AbstractThe number of minimal transitive star factorizations of a permutation was shown by Irving an...
We give a compact expression for the number of factorizations of any permutation into a minimal numb...
Abstract. We give a compact expression for the number of factorizations of any permutation into a mi...
AbstractThe number of minimal transitive star factorizations of a permutation was shown by Irving an...
AbstractWe show that the number of factorizationsσ=χ1…χrof a cycle of lengthninto a product of cycle...
AbstractWe consider the determination of the number ck(α) of ordered factorizations of an arbitrary ...
Abstract. The question of counting minimal factorizations of permutations into transpositions that a...
International audienceWe give a combinatorial proof of Goulden and Jackson's formula for the number ...
International audienceIt is known that the number of minimal factorizations of the long cycle in the...
We give a combinatorial proof of Goulden and Jackson's formula for the number of minimal transitive ...
We want to draw the combintorialists attention to an important, but apparently little known paper by...
We give a compact expression for the number of factorizations of any permutation into a minimal numb...
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 give a compact expression for the number of factorizations of any permutation into a minimal numb...
AbstractThe number of minimal transitive star factorizations of a permutation was shown by Irving an...
We give a compact expression for the number of factorizations of any permutation into a minimal numb...
Abstract. We give a compact expression for the number of factorizations of any permutation into a mi...
AbstractThe number of minimal transitive star factorizations of a permutation was shown by Irving an...
AbstractWe show that the number of factorizationsσ=χ1…χrof a cycle of lengthninto a product of cycle...
AbstractWe consider the determination of the number ck(α) of ordered factorizations of an arbitrary ...
Abstract. The question of counting minimal factorizations of permutations into transpositions that a...
International audienceWe give a combinatorial proof of Goulden and Jackson's formula for the number ...
International audienceIt is known that the number of minimal factorizations of the long cycle in the...
We give a combinatorial proof of Goulden and Jackson's formula for the number of minimal transitive ...
We want to draw the combintorialists attention to an important, but apparently little known paper by...
DOI
Add to ORKG