Computation of the Scharlau Invariant, I
R. Keith Dennis, Paul K. Young

TL;DR
This paper advances the understanding of the Scharlau invariant by eliminating the possibility of it being p^2 for certain groups, providing a computer-free proof for specific cases.
Contribution
It proves that the Scharlau invariant cannot be p^2 for finite groups, simplifying the classification of fixed point free representations, and offers a new proof avoiding computational methods.
Findings
Eliminates p^2 as a possible Scharlau invariant value for certain groups.
Provides a computer-free proof for the case p=17.
Clarifies the conditions under which the invariant takes specific values.
Abstract
The Scharlau invariant determines whether or not a finite group has a fixed point free representation over a field:\ \ if , yes, otherwise, no. Until now it was known to be one of , , , for a prime dividing the order of the group. We eliminate as a possibility. Work of Scharlau [Sch] reduces the question to the above list with being possible for the groups for a Fermat prime larger than . A computation using GAP in the Senior Thesis [Y] of the second author solves the problem for . With this motivation, we found a short proof of the result not requiring a computer.
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
TopicsAlgebraic Geometry and Number Theory · Psychoanalysis and Psychopathology Research · History and Theory of Mathematics
