Counting orbits of a product of permutations (Q1813986): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Cycle decomposition by disjoint transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of topological graph theory to group theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the automorphism group of a planar hypermap / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Planar Eulerian Graphs and Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the product of certain permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial analog of the Jordan Curve Theorem / rank
 
Normal rank

Revision as of 08:31, 15 May 2024

scientific article
Language Label Description Also known as
English
Counting orbits of a product of permutations
scientific article

    Statements

    Counting orbits of a product of permutations (English)
    0 references
    0 references
    0 references
    25 June 1992
    0 references
    Let \(\sigma\) and \(\tau\) be permutations on \(n\) letters. It is shown that the numbers of orbits of \(\sigma\), \(\tau\) and \(\sigma\tau\) are related to the Euler characteristic of an orientable surface \(S_{\sigma,\tau}\) that can be naturally assigned to \(\sigma\) and \(\tau\). The Euler formula is then used to express the number of orbits of \(\sigma\tau\) by means of the rank of the matrix corresponding to the cup product bilinear form on the first cohomology group of \(S_{\sigma,\tau}\).
    0 references
    orbits
    0 references
    product of permutations
    0 references
    Euler characteristic
    0 references

    Identifiers