How is 't' computed in the Rho round of the Keccak specifications?

Question

I'm building a minimal-dependancy crypto library, working on a keccak implementation based on this specification document.

I'm confused about following

aspect of the t computation described in the paper among the group of calculations on page 8.

Is there a simple, pythonic way to calculate t, or do I need to learn about matrix-logarithms?

Thanks!