The average number of block interchanges needed to sort a permutation and a recent result of Stanley (Q989529): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022299043 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0811.0740 / 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: Q3084190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting permutations by block-interchanges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive and injective proofs of log concavity results / 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: Q4236280 / rank
 
Normal rank

Latest revision as of 02:21, 3 July 2024

scientific article
Language Label Description Also known as
English
The average number of block interchanges needed to sort a permutation and a recent result of Stanley
scientific article

    Statements

    The average number of block interchanges needed to sort a permutation and a recent result of Stanley (English)
    0 references
    0 references
    0 references
    20 August 2010
    0 references
    analysis of algorithms
    0 references
    block interchanges
    0 references
    permutations
    0 references
    sorting
    0 references
    cycles
    0 references
    probability
    0 references

    Identifiers