Abstract
This paper describes a practical procedure for computing the ordinary irreducible characters of finite groups (of orders up to 1000 or so). The novelty of the method consists of transposing the problem from the field of complex numbers into the field of integers modulop for a suitable primep. It is much easier to compute the modular characters in the latter field, and from these characters we can calculate the ordinary irreducible characters in algebraic form.
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.
