Harmse–Remmel conjecture on c-Wilf and strong c-Wilf equivalence

Let P,QFn,kP,Q \in\mathcal F_{n,k}, where Fn,k \mathcal F_{n,k} denotes the relevant family of generalized Euler permutations. They are c-Wilf equivalent when AP(0,t)=AQ(0,t)A_P(0,t)=A_Q(0,t), and strongly c-Wilf equivalent when AP(x,t)=AQ(x,t)A_P(x,t)=A_Q(x,t), where

AP(x,t)=n0tn(kn)!FFn,kxP-mch(F).A_P(x,t)=\sum_{n\geq0}\frac{t^n}{(kn)!}\sum_{F\in\mathcal F_{n,k}}x^{P\text{-mch}(F)}.

Harmse–Remmel conjecture. PP and QQ are c-Wilf equivalent if and only if they are strongly c-Wilf equivalent. The conjecture extends Nakamura's k=1k=1 formulation to k2k\geq2; the source does not state whether it has been resolved.

Sources & referencesView supporting material

Primary source

Ran Pan and Jeffrey B. Remmel, “Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays”, arXiv:1510.08190 (2016).

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.