Uniquely-Wilf classes

04/11/2019
by   Michael Albert, et al.
0

Two permutations in a class are Wilf-equivalent if, for every size, n, the number of permutations in the class of size n containing each of them is the same. Those infinite classes that have only one equivalence class in each size for this relation are characterised provided either that they avoid at least one permutation of size 3, or at least three permutations of size 4.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/08/2023

An Algorithm to Enumerate Grid Signed Permutation Classes

In this paper, we present an algorithm that enumerates a certain class o...
research
04/26/2021

Network Analysis of SFU Course Registrations

We investigate the dynamics of disease infection via shared classes at S...
research
01/31/2023

A monotone connection between model class size and description length

This paper links sizes of model classes to the minimum lengths of their ...
research
01/02/2020

On permutation quadrinomials and 4-uniform BCT

We study a class of general quadrinomials over the field of size 2^2m wi...
research
01/10/2013

Enumerating Markov Equivalence Classes of Acyclic Digraph Models

Graphical Markov models determined by acyclic digraphs (ADGs), also call...
research
11/25/2020

Learnability and Positive Equivalence Relations

Prior work of Gavryushkin, Khoussainov, Jain and Stephan investigated wh...
research
04/16/2019

Equivalence classes of small tilings of the Hamming cube

The study of tilings is a major problem in many mathematical instances, ...

Please sign up or login with your details

Forgot password? Click here to reset