Almost square permutations are typically square
Jacopo Borga, Enrica Duchi, Erik Slivken

TL;DR
This paper studies almost square permutations with a fixed number of internal points, providing asymptotic enumeration and limit shape results, and extends techniques to 321-avoiding permutations with internal points, linking to Brownian excursions.
Contribution
It introduces a probabilistic approach to asymptotically enumerate almost square permutations and analyzes their limit permutons, also applying methods to 321-avoiding permutations with internal points.
Findings
Asymptotic enumeration of almost square permutations with fixed internal points.
Description of permuton limits for almost square permutations.
Asymptotic enumeration of 321-avoiding permutations with internal points linked to Brownian excursion area.
Abstract
A record in a permutation is a maximum or a minimum, from the left or from the right. The entries of a permutation can be partitioned into two types: the ones that are records are called external points, the others are called internal points. Permutations without internal points have been studied under the name of square permutations. Here, we explore permutations with a fixed number of internals points, called almost square permutations. Unlike with square permutations, a precise enumeration for the total number of almost square permutations of size with exactly internal points is not known. However, using a probabilistic approach, we are able to determine the asymptotic enumeration. This allows us to describe the permuton limit of almost square permutations with internal points, both when is fixed and when tends to infinity along a negligible sequence with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
