Slow entropy of some combinatorial constructions

The paper proves that for any subexponential scale there exists a rank‑two system that is weakly mixing but not mixing and has infinite lower slow entropy (Theorem 1.1), via a two‑tower cutting‑and‑stacking scheme with spacers, an independence/combinatorial uniformity lemma ensuring large Hamming separation, and explicit estimates on covering numbers; it also establishes weak mixing and failure of mixing (Proposition 3.3) and lower bounds on S(P,n,ε) along suitable subsequences (Proposition 3.4) . The candidate solution outlines essentially the same two‑tower architecture (independence blocks + Chacon‑type doping), differing mainly by positing an additional explicit “rigidity stage,” which the paper does not require. Hence both are correct, with substantially the same proof strategy.