Wilf classification of three and four letter signed patterns (Q932580): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038755542 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0604025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decreasing subsequences in permutations and Wilf equivalence for involutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed involutions avoiding 2-letter signed patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prefix exchanging and pattern avoidance by involutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of forbidden subsequences of length 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of Wilf-equivalent permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating trees and the Catalan and Schröder numbers / rank
 
Normal rank

Latest revision as of 13:21, 28 June 2024

scientific article
Language Label Description Also known as
English
Wilf classification of three and four letter signed patterns
scientific article

    Statements

    Wilf classification of three and four letter signed patterns (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2008
    0 references
    0 references
    forbidden subsequences
    0 references
    pattern-avoiding permutations
    0 references
    signed permutations
    0 references
    signed involutions
    0 references
    Wilf equivalence
    0 references
    0 references
    0 references