The equidistribution conjecture for separated consecutive-pattern occurrences

Fix k3k\geq 3, let πSk\pi\in S_k, and let aZ+a\in\mathbb{Z}^+. For nZ+n\in\mathbb{Z}^+ and I={i1,i2,,ia}[n]I=\{i_1,i_2,\ldots,i_a\}\subseteq[n], suppose that

i1n,ij+1ijn(1ja1),nian.i_1\geq\sqrt n,\qquad i_{j+1}-i_j\geq\sqrt n\quad(1\leq j\leq a-1),\qquad n-i_a\geq\sqrt n.

Here pπ(I,n)p_{\pi}(I,n) counts permutations in SnS_n with consecutive-pattern occurrence set II, and pπ(n)=pπ(,n)p_{\pi}(n)=p_{\pi}(\emptyset,n). The equidistribution conjecture for separated consecutive-pattern occurrences. There is a real constant Cπ,a>0C_{\pi,a}>0 such that

pπ(I,n)=Ck,apπ(n)(1+Oπ,a(nα)).p_{\pi}(I,n)=C_{k,a}p_{\pi}(n)\left(1+O_{\pi,a}\left(n^{-\alpha}\right)\right).

The claim is stated as an analogue of the source's equidistribution theorem for decreasing consecutive patterns. It asserts uniform asymptotic independence for occurrences separated from one another and from the endpoints by at least n\sqrt n; the source gives no resolution status.

Sources & referencesView supporting material

Primary source

Kaarel Hänni, “Asymptotics of descent functions”, arXiv:2011.14360 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.