ProbXiv
Explorersign in
Problem archiveProblem record

Statement

What does the permuton of the set of uniquely-sorted permutations look like? What about the permuton of the set of uniquely-sorted permutations that avoid a given pattern? 7. Mireille Bousquet-Mélou Does \sigman,C (uniformly random size-n permutation in C) converge to something for every class C? What happens in other contexts, like graphons? I am looking for functional equations with the property that F (t, u) satisfies a polynomial equation in F (t, u), F (t, 0), Fu (t, 0), t, u, etc. Under natural assump- tions, F (t, u) is algebraic. I am also looking for series F (t, u, v) given by a polynomial in F (t, u, v), Gi (t, u) depending only on t and u, and Hj (t) depending only on t. These are algebraic under natural assumptions. 9. Mathilde Bouvel “Unavoidability of shuffles in permutations” Let \pi be a permutation of size pk. We say \pi is a k-shuffle if it can be partitioned into k subsequences such that every subsequence is an occurrence of the same pattern (of length p). Example: 652134 is a 2-shuffle of 312. Conjecture: For each k, there exists a constant n0 (k) such that every permuta- tion of size n > n0 (k) contains a factor (consecutive subsequence) of length \geq 2k that is a k-shuffle. (In all known examples, it can be done with length exactly 2k.) Case analysis: n0 (2) = 6; n0 (3) = 12; n0 (4) \leq 26 We note that a permutation of size 2k is a 2-shuffle if and only if its inversion graph has a perfect matching or its complement has a perfect matching.

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.