AbstractWith any permutation g of a set Ω is associated a partition of Ω into the cycles of g. What information do we get about a group G of permutations if we know either the set or the multiset of partitions of Ω, or of partitions of n=|Ω|, which arise as the cycle partitions of its elements? Some partial answers to these questions are given
As an analogue of linear group representations, where groups act on vector spaces by linear transfor...
AbstractLet [n] be the set {1,2, … , n} and σ a given permutation in Sn, the symmetric group on [n]....
AbstractThe cycle index polynomial of combinatorial analysis is discussed in various contexts
With any permutation g of a set Ω is associated a partition of Ω into the cycles of g. What informat...
With any permutation g of a set Ω is associated a partition of Ω into the cycles of g. What informat...
We present various results on multiplying cycles in the symmetric group. One result is a generalisat...
AbstractWe describe some properties of a new statistic on permutations. This statistic is closely re...
In this paper we introduced what is meant by a permutation on a given set and showed how they form a...
AbstractA technique for computing in permutation groups of high degree is developed. The technique u...
AbstractWe consider the following problem: given three partitions A,B,C of a finite set Ω, do there ...
The cycle polynomial of a finite permutation group G is the generating function for the number of el...
AbstractWe give a group theoretical interpretation of the lattice of non-crossing partitions of a cy...
Let H be a permutation group on a set Λ, which is permutationally isomorphic to a finite alternating...
AbstractA permutation of n objects is of cycle type (j1,…,jn) if it has jk, k=1,…,n, cycles of lengt...
AbstractThere are many analogies between subsets and permutations of a set, and in particular betwee...
As an analogue of linear group representations, where groups act on vector spaces by linear transfor...
AbstractLet [n] be the set {1,2, … , n} and σ a given permutation in Sn, the symmetric group on [n]....
AbstractThe cycle index polynomial of combinatorial analysis is discussed in various contexts
With any permutation g of a set Ω is associated a partition of Ω into the cycles of g. What informat...
With any permutation g of a set Ω is associated a partition of Ω into the cycles of g. What informat...
We present various results on multiplying cycles in the symmetric group. One result is a generalisat...
AbstractWe describe some properties of a new statistic on permutations. This statistic is closely re...
In this paper we introduced what is meant by a permutation on a given set and showed how they form a...
AbstractA technique for computing in permutation groups of high degree is developed. The technique u...
AbstractWe consider the following problem: given three partitions A,B,C of a finite set Ω, do there ...
The cycle polynomial of a finite permutation group G is the generating function for the number of el...
AbstractWe give a group theoretical interpretation of the lattice of non-crossing partitions of a cy...
Let H be a permutation group on a set Λ, which is permutationally isomorphic to a finite alternating...
AbstractA permutation of n objects is of cycle type (j1,…,jn) if it has jk, k=1,…,n, cycles of lengt...
AbstractThere are many analogies between subsets and permutations of a set, and in particular betwee...
As an analogue of linear group representations, where groups act on vector spaces by linear transfor...
AbstractLet [n] be the set {1,2, … , n} and σ a given permutation in Sn, the symmetric group on [n]....
AbstractThe cycle index polynomial of combinatorial analysis is discussed in various contexts
DOI
Add to ORKG