Complex sentence: When using Boolean weights, any document lies in a vertex in a n-dimensional hypercube, therefore the possible document representations are 2 ^ n and the maximum Euclidean distance between pairs is\\ sqrt.
Split into simpler sentences: When using Boolean weights, any document lies in a vertex in a n-dimensional hypercube. Therefore, the possible document representations are 2 ^ n and the maximum Euclidean distance between pairs is\\ sqrt.