Permutation classes and polyomino classes with excluded submatrices
From MaRDI portal
Publication:2971061
DOI10.1017/S0960129515000250zbMath1364.05021arXiv1402.2260OpenAlexW1919302619MaRDI QIDQ2971061
Daniela Battaglino, Mathilde Bouvel, Simone Rinaldi, Andrea Frosini
Publication date: 4 April 2017
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.2260
Related Items
Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses, Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset, A new mathematical model for tiling finite regions of the plane with polyominoes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-contiguous pattern avoidance in binary trees
- Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Avoidance of partitions of a three-element set
- Pattern avoidance in binary trees
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- The Möbius function of the permutation pattern poset
- Algebraic languages and polyominoes enumeration
- On \(abab\)-free and \(abba\)-free set partitions
- A method for the enumeration of various classes of column-convex polygons
- Pattern avoidance in the rook monoid
- Combinatorial aspects of \(L\)-convex polyominoes
- Enumeration of L-convex polyominoes by rows and columns
- A unification of permutation patterns related to Schubert varieties
- Reconstruction of L-convex Polyominoes
- Discrete Geometry for Computer Imagery
- On Fixed Points of the Composite of Commuting Functions
- Machines, Computations, and Universality
- Checker Boards and Polyominoes
- Restricted permutations
