Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 31 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 73 tok/s Pro
Kimi K2 199 tok/s Pro
GPT OSS 120B 434 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

The Picky Conjecture for groups of Lie type (2510.18397v1)

Published 21 Oct 2025 in math.RT

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

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com
Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

This paper has been mentioned in 1 tweet and received 2 likes.

Upgrade to Pro to view all of the tweets about this paper: