DOIAbstract
AbstractWe relate the number of cycles in a product of transpositions with a full cycle with the nullity of a binary matrix. Our theorem generalizes a theorem of Cohn and Lempel
AbstractWe relate the number of cycles in a product of transpositions with a full cycle with the nullity of a binary matrix. Our theorem generalizes a theorem of Cohn and Lempel
AbstractMoszkowski has previously given a direct bijection between labelled trees on n vertices and ...
A theorem by M. Cohn and A. Lempel, relating the product of certain permutations to the rank of an a...
Abstract. The question of counting minimal factorizations of permutations into transpositions that a...
AbstractWe relate the number of cycles in a product of transpositions with a full cycle with the nul...
AbstractWe investigate in this paper the cycle structures induced on cyclic permutations by disjoint...
AbstractA common framework for the two concepts of the title is developed to yield an alternative pr...
Finding a sequence of transpositions that transforms a given permutation into the identity permutati...
We want to draw the combintorialists attention to an important, but apparently little known paper by...
Finding a sequence of transpositions that transforms a given permutation into the identity permutati...
Finding a sequence of transpositions that transforms a given permutation into the identity permutati...
AbstractIn analogy with the cycle decomposition of a permutation, we study the enumerative propertie...
It was conjectured that a permutation matrix with bandwidth b can be written as a product of no more...
AbstractWe give a new expression for the number of factorizations of a full cycle into an ordered pr...
AbstractA formula is derived for the number of orbits of a product of permutation in terms of the nu...
We give a combinatorial proof of Goulden and Jackson's formula for the number of minimal transitive ...
AbstractMoszkowski has previously given a direct bijection between labelled trees on n vertices and ...
A theorem by M. Cohn and A. Lempel, relating the product of certain permutations to the rank of an a...
Abstract. The question of counting minimal factorizations of permutations into transpositions that a...
AbstractWe relate the number of cycles in a product of transpositions with a full cycle with the nul...
AbstractWe investigate in this paper the cycle structures induced on cyclic permutations by disjoint...
AbstractA common framework for the two concepts of the title is developed to yield an alternative pr...
Finding a sequence of transpositions that transforms a given permutation into the identity permutati...
We want to draw the combintorialists attention to an important, but apparently little known paper by...
Finding a sequence of transpositions that transforms a given permutation into the identity permutati...
Finding a sequence of transpositions that transforms a given permutation into the identity permutati...
AbstractIn analogy with the cycle decomposition of a permutation, we study the enumerative propertie...
It was conjectured that a permutation matrix with bandwidth b can be written as a product of no more...
AbstractWe give a new expression for the number of factorizations of a full cycle into an ordered pr...
AbstractA formula is derived for the number of orbits of a product of permutation in terms of the nu...
We give a combinatorial proof of Goulden and Jackson's formula for the number of minimal transitive ...
AbstractMoszkowski has previously given a direct bijection between labelled trees on n vertices and ...
A theorem by M. Cohn and A. Lempel, relating the product of certain permutations to the rank of an a...
Abstract. The question of counting minimal factorizations of permutations into transpositions that a...
Add to ORKG