Counting orbits of a product of permutations
From MaRDI portal
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}\).
Recommendations
- The orbits of the product of two permutations
- On the orbits of the product of two permutations
- The numbers of permutation groups orbits and of the wreath product orbits
- On the product of certain permutations
- scientific article; zbMATH DE number 5168331
- Counting permutations by numbers of excedances, fixed points and cycles
- On the numbers of orbits of permutations under an operator related to Eulerian numbers
- On the number of subpermutations with fixed orbit size
- The number of orthogonal permutations
- On the number of special permutation-invariant orbits and terms
Cites work
Cited in
(5)- Even permutations not representable in the form of a product of two permutations of given order
- scientific article; zbMATH DE number 5168331 (Why is no real title available?)
- scientific article; zbMATH DE number 919921 (Why is no real title available?)
- The orbits of the product of two permutations
- Chords in a circle and linear algebra over GF(2)
This page was built for publication: Counting orbits of a product of permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813986)