Substring Complexity in BWT-Runs Bounded Space

Given a string $T[1..n]$, its substring complexity is defined as δ=maxₖ dₖ/k, where dₖ is the number of its distinct substrings of length k in T. We show how to compute it in O(n+rlog r) time, using only $O(r)$ words of space, where r denotes the number of runs in the Burrows-Wheeler transform.