How to Store a Triangular Matrix
We consider the problem of storing a triangular matrix so that each row and column is stored as a vector, i.e. the locations form an arithmetic progression. Storing rows and columns as vectors can speed up access significantly. We show that there is no such storage method that does not waste approximately one half of the computer memory.