ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Conjecture. The permuton limit of Av(\alpha ⊖ 1) is the diagonal permuton, for any non-empty permutation \alpha. In trying to prove this conjecture, we have revisited work by Atapour and Madras [1] and Madras and Yıldırım [2] on exponentially rare regions of permuta- tion classes. For a pattern \tau \in Sk , they define a point (x, y) \in [0, 1]2 to be \tau -rare if, for every sequence (in , jn ) \in [n]2 such that (in /n, jn /n) \to (x, y), there exists r \in (0, 1) such that P\taun [\pi(in ) = jn ] = o(rn ) as n \to \infty, where \pi is chosen from the uniform distribution on Avn (\tau ) and where P\taun denotes the probability measure of this distribution. In words, (x, y) is \tau - rare if every sequence of points converging to (x, y) has exponentially decaying probabilities of being a point in a \tau -avoiding permutation. Then the \tau -rare region R is defined to be the set of \tau -rare points. There are some interesting results about \tau -rare points, some of which we would potentially like to adapt for proving Bevan’s conjecture: Theorem [1, Thm. 8.1], [2, Thm. 1]. If \tau = \alpha ⊖ 1 for some non-empty \alpha, then the corner point (1, 0) has an open neighborhood contained in R. Theorem [2, Thm. 17]. Suppose \tau = \alpha ⊖ 1 for some non-empty \alpha. If (x, y) \in [0, 1] \ R, then the convex hull of {(x, y), (0, 0), (0, 1)} is contained in [0, 1] \ R. Permuton Limits of Permutation Classes and Rare Regions Justin M. Troyka (joint work with David Bevan)

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.