How many ways can a permutation be factored into two n-cycles? (Q1137579): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even permutations as a product of two conjugate cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncanonical Factorization of a Permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramified coverings of Riemann surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflection classes whose cubes cover the alternating group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Remarks on Commutators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3243274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in random regular bipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: For How Many Edges is a Digraph Almost Certainly Hamiltonian? / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:32, 13 June 2024

scientific article
Language Label Description Also known as
English
How many ways can a permutation be factored into two n-cycles?
scientific article

    Statements

    How many ways can a permutation be factored into two n-cycles? (English)
    0 references
    0 references
    1979
    0 references
    permutation
    0 references
    product of two n-cycles
    0 references

    Identifiers