Abstract
It is known that the diameter of commuting graph of n-by-n matrices is bounded above by six if the graph is connected. In the commuting graph of p2-by-p2 matrices over a sufficiently large field which admits a cyclic Galois extension of degree p2 we construct two matrices at distance at least five. This shows that five is the lower bound for its diameter. Our results are applicable for all sufficiently large finite fields as well as for the field of rational numbers.
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.
