Counting subwords in flattened partitions of sets (Q2352065): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Mathematica / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OEIS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HERB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: WILF / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2015.04.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1020257647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set partition asymptotics and a conjecture of Gould and Quaintance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4483919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern avoidance in ``flattened'' partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: q-Catalan numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of Compositions and Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel method and linear recurrence system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Patterns in permutations and words. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of Set Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2915615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting subwords in flattened permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting subwords in a partition of a set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence relations in counting the pattern 13-2 in flattened permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Riordan group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5695714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration schemes and, more importantly, their automatic generation / rank
 
Normal rank

Latest revision as of 10:14, 10 July 2024

scientific article
Language Label Description Also known as
English
Counting subwords in flattened partitions of sets
scientific article

    Statements

    Counting subwords in flattened partitions of sets (English)
    0 references
    0 references
    0 references
    0 references
    29 June 2015
    0 references
    flattened set partitions
    0 references
    pattern avoidance
    0 references
    subword patterns
    0 references
    kernel method
    0 references
    asymptotic enumeration
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers