2000 character limit reached
The number of matrices over $\mathbb{F}_q$ with irreducible characteristic polynomial
Published 12 Feb 2014 in math.AC and math.RA | (1402.2794v1)
Abstract: Let $\mathbb{F}_q$ be a finite field with $q$ elements. M. Gerstenhaber and Irving Reiner has given two different methods to show the number of matrices with a given characteristic polynomial. In this talk, we will give another proof for the particular case where the characteristic polynomial is irreducible. The number of such matrices is important to know the efficiency of an algorithm to factor polynomials using Drinfeld modules.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.