A theorem by M. Cohn and A. Lempel, relating the product of certain permutations to the rank of an associated matrix, is restated and reproved. Its relationship to old and recent results in topological graph theory is pointed out
AbstractA recursion is developed for the number ƒ;(P) of ways a permutation P on n symbols can be wr...
AbstractAn elementary combinatorial proof of the Cayley-Hamilton theorem is given. At the conclusion...
This paper studies the cycle indices of products of permutation groups. The main focus is on the pro...
A theorem by M. Cohn and A. Lempel, relating the product of certain permutations to the rank of an a...
AbstractA formula is derived for the number of orbits of a product of permutation in terms of the nu...
AbstractWe relate the number of cycles in a product of transpositions with a full cycle with the nul...
AbstractA common framework for the two concepts of the title is developed to yield an alternative pr...
AbstractWe consider the following problem: given three partitions A,B,C of a finite set Ω, do there ...
AbstractLet P be an n×n permutation matrix, and let p be the corresponding permutation. Let A be a m...
AbstractAnother combinatorial proof of a theorem of Ree's on permutations is offered. This proof mak...
AbstractIt has been shown that a connection can be made between labeled trees and representations of...
AbstractThe central result of this paper is a generalization of the theorem that, for n ≥ 5, every e...
We study pairs of permutations A and B of a finite or infinite set Ω such that one or more of A, B, ...
AbstractA new and useful operation on permutation groups is defined and studied. A formula for the c...
In [2] Ree proved a theorem about permutation groups by making use of a formula for the genus of Rie...
AbstractA recursion is developed for the number ƒ;(P) of ways a permutation P on n symbols can be wr...
AbstractAn elementary combinatorial proof of the Cayley-Hamilton theorem is given. At the conclusion...
This paper studies the cycle indices of products of permutation groups. The main focus is on the pro...
A theorem by M. Cohn and A. Lempel, relating the product of certain permutations to the rank of an a...
AbstractA formula is derived for the number of orbits of a product of permutation in terms of the nu...
AbstractWe relate the number of cycles in a product of transpositions with a full cycle with the nul...
AbstractA common framework for the two concepts of the title is developed to yield an alternative pr...
AbstractWe consider the following problem: given three partitions A,B,C of a finite set Ω, do there ...
AbstractLet P be an n×n permutation matrix, and let p be the corresponding permutation. Let A be a m...
AbstractAnother combinatorial proof of a theorem of Ree's on permutations is offered. This proof mak...
AbstractIt has been shown that a connection can be made between labeled trees and representations of...
AbstractThe central result of this paper is a generalization of the theorem that, for n ≥ 5, every e...
We study pairs of permutations A and B of a finite or infinite set Ω such that one or more of A, B, ...
AbstractA new and useful operation on permutation groups is defined and studied. A formula for the c...
In [2] Ree proved a theorem about permutation groups by making use of a formula for the genus of Rie...
AbstractA recursion is developed for the number ƒ;(P) of ways a permutation P on n symbols can be wr...
AbstractAn elementary combinatorial proof of the Cayley-Hamilton theorem is given. At the conclusion...
This paper studies the cycle indices of products of permutation groups. The main focus is on the pro...
DOI
Add to ORKG