Finiteness of the exponential generating limit for pattern-occurrence polynomials
For a pattern , let denote the pattern-occurrence generating polynomial over , so that its coefficients enumerate permutations according to the number of occurrences of . Finiteness conjecture. For every pattern and every , the limit
is finite. The source establishes existence of this limit by subadditivity, but does not establish the asserted finiteness in the stated generality.
References
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.