Character bounds for regular semisimple elements and asymptotic results on Thompson's conjecture
Michael Larsen, Jay Taylor, and Pham Tiep

TL;DR
This paper establishes bounds on elements in finite classical groups that guarantee they can be expressed as products of conjugates of certain regular semisimple elements, advancing understanding of element factorizations and asymptotic behavior related to Thompson's conjecture.
Contribution
It provides new bounds for expressing elements as products of conjugates of regular semisimple elements in finite classical groups, extending results to orthogonal and symplectic groups and analyzing asymptotic cases.
Findings
Bound B(k) for expressing elements as products of conjugates of g
Results for classical groups over finite fields, including orthogonal and symplectic cases
Asymptotic results for prime n=p with specific element orders
Abstract
For every integer there exists a bound such that if the characteristic polynomial of is the product of pairwise distinct monic irreducible polynomials over , then every element of of support at least is the product of two conjugates of . We prove this and analogous results for the other classical groups over finite fields; in the orthogonal and symplectic cases, the result is slightly weaker. With finitely many exceptions , in the special case that is prime, if has order , then every non-scalar element is the product of two conjugates of . The proofs use the Frobenius formula together with upper bounds for values of unipotent and quadratic unipotent characters in finite classical groups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · Graph theory and applications
