We find a procedure to asymptotically enumerate monotone grid classes of permutations.
This is then applied to compute the asymptotic number of permutations in any connected one-corner L-shaped, T-shaped, and X-shaped class. We start by looking at the simplest case of the skinny classes with a single row or column.
Finding the exact enumeration of grid classes is hard, so our goal is to find the asymptotic enumeration. Our strategy consists of enumerating the gridded permutations, finding the asymptotic distribution of points between the cells in a typical large gridded permutation, and determining in detail the ways in which a typical
large M-gridded permutation must be structured so that its underlying permutation σ has exactly ℓ distinct M-griddings. We then combine the previous steps to calculate for each ℓ ≥ 1, the asymptotic probability that σ has exactly ℓ distinct M-griddings.
Then we deduce the asymptotic enumeration of the number of permutations in the class.
| Date of Award | 4 Jun 2025 |
|---|
| Original language | English |
|---|
| Awarding Institution | - University Of Strathclyde
|
|---|
| Supervisor | David Bevan (Supervisor) & Einar Steingrimsson (Supervisor) |
|---|