Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Picky Conjecture for groups of Lie type

Published 21 Oct 2025 in math.RT | (2510.18397v1)

Abstract: Recently, Moret\'o and Rizo proposed a conjecture, known as the Picky Conjecture, proposing new character correspondences extending the McKay Conjecture. We prove the Picky Conjecture for all quasi-simple groups of Lie type for non-defining primes. In favourable situations, we also obtain the stronger version postulating preservation of character values up to sign, and we show this stronger version holds in general when assuming certain natural properties of Lusztig's Jordan decomposition. Along the way, we complete the determination of semisimple picky elements in these groups by classifying picky 2- and 3-elements.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 2 likes about this paper.