On the asymptotic enumeration and limit shapes of monotone grid classes of permutations

We exhibit 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 class. Our strategy consists of enumerating the gridded permutations, finding the asymptotic distribution of points between the cells in a typical large gridded permutation, and analysing in detail the ways in which a typical permutation can be gridded. We also determine the limit shape of any connected monotone grid class.
Comment: 40 pages