On the adjacent cycle derangements (Q1935976): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Adjacent \(q\)-cycles in permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2885006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une théorie combinatoire des séries formelles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial interpretation of punctured partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank

Latest revision as of 05:41, 6 July 2024

scientific article
Language Label Description Also known as
English
On the adjacent cycle derangements
scientific article

    Statements

    On the adjacent cycle derangements (English)
    0 references
    0 references
    0 references
    21 February 2013
    0 references
    Summary: A derangement, that is, a permutation without fixed points, of a finite set is said to be an adjacent cycle when all its cycles are formed by a consecutive set of integers. In this paper we determine enumerative properties of these permutations using analytical and bijective proofs. Moreover a combinatorial interpretation in terms of linear species is provided. Finally we define and investigate the case of the adjacent cycle derangements of a multiset.
    0 references
    0 references
    derangement
    0 references
    permutation without fixed points
    0 references
    cycles
    0 references
    enumerative properties
    0 references
    analytical proofs
    0 references
    bijective proofs
    0 references
    linear species
    0 references
    adjacent cycle derangements
    0 references
    multiset
    0 references
    0 references
    0 references