8 problems

Let $M$ be a finite matrix defining a grid class $\operatorname{Grid}(M)$, and let $G(M)$ be the bipartite graph whose vertices represent the rows and columns of $M$, with an edge…

Let $M$ be a finite matrix whose entries specify the monotone permutation classes placed in the cells of a grid, and let $\operatorname{Grid}(M)$ denote the resulting grid class. A…

A pseudoforest grid class is a permutation grid class whose gridding matrix has an underlying graph in which every connected component contains at most one cycle. The generating fu…

A monotone grid class is a permutation class defined by a finite grid whose nonempty cells contain monotone permutations. Huczynska–Vatter's conjecture. Every monotone grid class i…

Finite-basis conjecture. All monotone grid classes are finitely based.

Fine-set conjecture. For every one-column grid class ${\mathcal G}^{\mathbf{v}}$, the set

Finite-basis conjecture for monotone grid classes. Every monotone grid class has a finite basis. The source notes that only limited cases are known, including skew-merged permutati…

Let $M$ be a finite matrix whose cell graph is a forest, and let $\operatorname{Grid}(M)$ denote the corresponding grid class of permutations. A class has a rational generating fun…