Abstract
The present paper deals with counting the number and orders of regular semisimple elements, together with the number of primary classes of GL ( n , q ) . The approach used in this paper depends essentially on partitions of positive integers ⩽ n. We give the numbers of regular semisimple elements and primary classes of GL ( n , q ) for n ∈ { 1 , 2 , … , 6 } and see that the number of regular semisimple elements is an integral polynomial in q, while the number of primary classes is a rational polynomial in q.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
