2014/12/01 by Anders Claesson, Claesson, Anders, Bridget Eileen Tenner +3
Computer Science · Mathematics · #05A05 #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Mathematical Dynamics and Fractals
paper · pdf · doi:10.48550/arxiv.1412.0703
openalex publication_date 2014/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Two mesh patterns are coincident if they are avoided by the same set of permutations. In this paper, we provide necessary conditions for this coincidence, which include having the same set of enclosed diagonals. This condition is sufficient to prove coincidence of vincular patterns, although it is not enough to guarantee coincidence of bivincular patterns. In addition, we provide a generalization of the Shading Lemma (Hilmarsson et al.), a result that examined when a square could be added to the mesh of a pattern.