English

Counting Quasi-Idempotent Irreducible Integral Matrices

Combinatorics 2018-05-11 v3 Representation Theory

Abstract

Given any polynomial pp in C[X]C[X], we show that the set of irreducible matrices satisfying p(A)=0p(A)=0 is finite. In the specific case p(X)=X2nXp(X)=X^2-nX, we count the number of irreducible matrices in this set and analyze the arising sequences and their asymptotics. Such matrices turn out to be related to generalized compositions and generalized partitions.

Keywords

Cite

@article{arxiv.1701.03699,
  title  = {Counting Quasi-Idempotent Irreducible Integral Matrices},
  author = {Erik Thörnblad and Jakob Zimmermann},
  journal= {arXiv preprint arXiv:1701.03699},
  year   = {2018}
}

Comments

11 pages

R2 v1 2026-06-22T17:49:39.429Z