Factorizations of large cycles in the symmetric group (Q1613557): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(01)00361-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999395516 / rank
 
Normal rank

Latest revision as of 10:30, 30 July 2024

scientific article
Language Label Description Also known as
English
Factorizations of large cycles in the symmetric group
scientific article

    Statements

    Factorizations of large cycles in the symmetric group (English)
    0 references
    0 references
    0 references
    29 August 2002
    0 references
    Let \(C^{(n)}_{\alpha_1,\dots,\alpha_m}\) denote the number of factorizations of an \(n\)-cycle into \(m\) permutations of \(S_n\) of types \(\alpha_1,\dots,\alpha_m\). Although this number can be computed using the character table of \(S_n\), but the authors find a new formula to calculate this number.
    0 references
    0 references
    symmetric groups
    0 references
    conjugacy classes
    0 references
    connection coefficients
    0 references
    numbers of factorizations
    0 references
    0 references
    0 references