How to prove a string T of length n on alphabet A {1, 2, … σ} can do rank and select in constant time? (Succinct Data Structure)
There is a string T of length n on alphabet A={1,2,…,σ}.
From T, we create σ bit-vectors Bc for c∈A so that Bc[i] = 1 if and only if T[i] = c.
How to prove that using these bit-vectors and auxiliary data structures, rank and select on T are done in constant time?