Algorithmic coincidence classification of mesh patterns

10/17/2019
by   Christian Bean, et al.
0

We review and extend previous results on coincidence of mesh patterns. We introduce the notion of a force on a permutation pattern and apply it to the coincidence classification of mesh patterns, completing the classification up to size three. We also show that this concept can be used to enumerate classical permutation classes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2023

Combinatorial generation via permutation languages. VI. Binary trees

In this paper we propose a notion of pattern avoidance in binary trees t...
research
03/20/2019

Permutation patterns in genome rearrangement problems: the reversal model

In the context of the genome rearrangement problem, we analyze two well ...
research
04/11/2018

Edge-based LBP description of surfaces with colorimetric patterns

In this paper we target the problem of the retrieval of colour patterns ...
research
06/22/2023

Counting occurrences of patterns in permutations

We develop a new, powerful method for counting elements in a multiset. A...
research
06/01/2021

Harvesting the Public MeSH Note field

In this document, we report an analysis of the Public MeSH Note field of...
research
08/08/2018

Permutation patterns in genome rearrangement problems

In the context of the genome rearrangement problem, we analyze two well ...
research
03/08/2023

Six Permutation Patterns Force Quasirandomness

A sequence π_1,π_2,… of permutations is said to be "quasirandom" if the ...

Please sign up or login with your details

Forgot password? Click here to reset