Key points are not available for this paper at this time.
Evidences have suggested that counting representations are sometimes tractable even when the corresponding classification problem is almost impossible, or "wild" in a precise sense. Such counting problems are directly related to matrix counting problems, many of which are under active research. Using a general framework we formulate for such counting problems, we reduce some counting problems about commuting matries to problems about endomorphisms on all finite abelian p-groups. As an application, we count finite modules on some first examples of nonreduced curves over Fq. We also relate some classical and hard problems regarding commuting triples of matrices to a conjecture of Onn on counting conjugacy classes of the automorphism group of an arbitrary finite abelian p-group.
Yifeng Huang (Tue,) studied this question.