Eliminating components in Quillen's Conjecture
Abstract
We generalize an earlier result of Segev, which shows that {\em some\/} component in a minimal counterexample to Quillen's conjecture must admit an outer automorphism. We show in fact that {\em every\/} component must admit an outer automorphism. Thus we transform his restriction-result on components to an elimination-result: namely one which excludes any component which does not admit an outer automorphism. Indeed we show that the outer automorphisms admitted must include -outers: that is, outer automorphisms of order divisible by . This gives stronger, concrete eliminations: for example if is odd, it eliminates sporadic and alternating components -- thus reducing to Lie-type components (and typically forcing -outers of field type). For , we obtain similar but less restrictive results. We also provide some tools to help eliminate suitable components that do admit -outers in a minimal counterexample.
Keywords
Cite
@article{arxiv.2011.04861,
title = {Eliminating components in Quillen's Conjecture},
author = {Kevin I. Piterman and Stephen D. Smith},
journal= {arXiv preprint arXiv:2011.04861},
year = {2021}
}
Comments
37 pages, comments are welcome