Finiteness of the exponential generating limit for pattern-occurrence polynomials

For a pattern ξSk\xi\in S_k, let cnξ(x)c_n^\xi(x) denote the pattern-occurrence generating polynomial over SnS_n, so that its coefficients enumerate permutations according to the number of occurrences of ξ\xi. Finiteness conjecture. For every pattern ξkSk\xi\in\bigcup_k S_k and every x(0,1)x\in(0,1), the limit

limn(cnξ(x))1/n\lim_{n\to\infty}\bigl(c_n^\xi(x)\bigr)^{1/n}

is finite. The source establishes existence of this limit by subadditivity, but does not establish the asserted finiteness in the stated generality.

Sources & referencesView supporting material

Primary source

Toufik Mansour, Reza Rastegar and Alexander Roitershtein, “Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations”, arXiv:1905.05646 (2019).

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.