2 problems

Oscillation conjecture. There exists a constant $C>0$ such that, for every positive integer $k$, there is a pair of binary words $(v,w)$ with lengths at most $\exp(Ck)$ for which

Monotonicity conjecture. The number of pairs $(v,w)$ satisfying