On the least exponential growth admitting uncountably many closed permutation classes (Q1885903): 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: W2021415664 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0307399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2722006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting with a forklift / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Stack Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially well-ordered closed sets of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting with two ordered stacks in series. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular closed sets of permutations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern matching for permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On growth rates of closed permutation classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-quasi-orderings and sets of finite sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ascending sequences in permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite antichain of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting Using Networks of Queues and Stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating trees and forbidden subsequences / rank
 
Normal rank

Latest revision as of 15:13, 7 June 2024

scientific article
Language Label Description Also known as
English
On the least exponential growth admitting uncountably many closed permutation classes
scientific article

    Statements

    On the least exponential growth admitting uncountably many closed permutation classes (English)
    0 references
    0 references
    12 November 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Permutation avoidance
    0 references
    Wqo
    0 references
    Exponential growth
    0 references
    0 references
    0 references