Bijective enumeration of some colored permutations given by the product of two long cycles (Q658051): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2011.09.010 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q114190767 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1006.3474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analog of the Harer-Zagier formula for unicellular bicolored maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analogue of the Harer-Zagier formula for unicellular maps on general surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nombre de représentations d'une permutation comme produit de deux cycles de longueurs données / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stanley's formula for characters of the symmetric group. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct bijection for the Harer-Zagier formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: Annular embeddings of permutations for arbitrary genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring \(n\)-cycles and counting maps of given genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5578800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3176606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bijective proof of Jackson's formula for the number of factorizations of a cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducible symmetric group characters of rectangular shape. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two enumerative results on cycles of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4890772 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2011.09.010 / rank
 
Normal rank

Latest revision as of 00:07, 10 December 2024

scientific article
Language Label Description Also known as
English
Bijective enumeration of some colored permutations given by the product of two long cycles
scientific article

    Statements

    Bijective enumeration of some colored permutations given by the product of two long cycles (English)
    0 references
    0 references
    11 January 2012
    0 references
    Where the disjoint cycle representation of a permutation consists of just one cycle, that cycle is \textit{long}. Let \(p,n\) \((p\leq n)\) be given integers. A \textit{coloured permutation} is a couple \((\beta,\phi)\) where \(\beta\) is a permutation of \(1,2,\dots,n\), and \(\phi:\{1,2,\dots,n\} \to C\) is a surjection mapping all elements of the same cycle of \(\beta\) to the same element of a set \(C\) of ``colours''; \({\mathcal{C}}(p,n)\) denotes the set of coloured permutations of \(n\) with \(p\) colours, up to bijections on \(C\). \({\mathcal{C}}(\lambda)\) denotes the set of all coloured permutations inducing the same unordered partition \(\lambda\) of \(\{1,2,\dots n\}\). The main result is Theorem 1.4: Let \(p\leq n\) be two positive integers. Fix an integer partition \(\lambda\) of size \(n\) and length \(p\). Choose randomly (with uniform probability) a coloured permutation \((\beta,\phi)\) in \({\mathcal{C}}(\lambda)\). Then the probability for \((\begin{matrix}1&2&\dots&n\end{matrix})\,\,\beta^{-1}\) to be a long cycle is exactly \(\frac{1}{n-p+1}\). From the authors' abstract: ``Our proof is bijective, and uses combinatorial objects, such as partitioned hypermaps and thorn trees. This formula is actually equivalent to the proportionality of the number of long cycles \(\alpha\) such that \(\gamma_n\alpha\) has \(m\) cycles and Stirling numbers of size \(n+1\), an unexpected connection previously found by several authors by means of algebraic methods. Moreover, our bijection allows us to refine the latter result with the cycle type of the permutations.''
    0 references
    colored permutations
    0 references
    bipartite maps
    0 references
    long cycle factorization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references