Combinatorial specifications for juxtapositions of permutation classes (Q2327217): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OEIS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1902.02705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple permutations and pattern restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular closed sets of permutations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The insertion encoding of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm computing combinatorial specifications of permutation classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth rates of permutation grid classes, tours on graphs, and the spectral radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intervals of permutation class growth rates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Staircases, dominoes, and the growth rate of 1324-avoiders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple permutations and algebraic generating functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Juxtaposing Catalan permutation classes with monotone ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PERMUTATION CLASSES OF EVERY GROWTH RATE ABOVE 2.48188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation classes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:35, 20 July 2024

scientific article
Language Label Description Also known as
English
Combinatorial specifications for juxtapositions of permutation classes
scientific article

    Statements

    Combinatorial specifications for juxtapositions of permutation classes (English)
    0 references
    0 references
    0 references
    14 October 2019
    0 references
    Summary: We show that, given a suitable combinatorial specification for a permutation class \(\mathcal{C}\), one can obtain a specification for the juxtaposition (on either side) of \(\mathcal{C}\) with Av(21) or Av(12), and that if the enumeration for \(\mathcal{C}\) is given by a rational or algebraic generating function, so is the enumeration for the juxtaposition. Furthermore this process can be iterated, thereby providing an effective method to enumerate any `skinny' \(k\times 1\) grid class in which at most one cell is non-monotone, with a guarantee on the nature of the enumeration given the nature of the enumeration of the non-monotone cell.
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial specifications of juxtapositions
    0 references
    0 references