This should be a fairly standard question but I can't really seem to find a reference.
Consider an $n \times n$ square lattice torus $\mathbb T$. Given a length $l \geq n$, what is the number of homologically non-trivial cycles of length $l$ on $\mathbb T$, and what is the number of homologically trivial cycles of length $l$? Can we tell something about their ratio? (By "length", I mean the number of edges the cycle contains.)
N.B. I'm asking this as a very special case of my previous question. It's surprising to me that I couldn't find any results on this from an hour-long Googling. Whereas, Bollobas et al. apparently have considered much harder-looking questions.