Strongly restricted permutations and tiling with fences (Q2348057): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2015.02.004 / rank
Normal rank
 
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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.02.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047550544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of certain types of strongly restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3581820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4424874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and pattern avoidance in words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3620072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4677901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank Modulation for Flash Memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating functions for the number of permutations with limited displacement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5631120 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2015.02.004 / rank
 
Normal rank

Latest revision as of 03:13, 18 December 2024

scientific article
Language Label Description Also known as
English
Strongly restricted permutations and tiling with fences
scientific article

    Statements

    Strongly restricted permutations and tiling with fences (English)
    0 references
    0 references
    0 references
    10 June 2015
    0 references
    \(n\)-tiling
    0 references
    strongly restricted permutations
    0 references
    combinatorial identities
    0 references
    directed pseudographs
    0 references
    excedance
    0 references

    Identifiers