A counterexample to Feit's Problem VIII on decomposition numbers
Gabriel Navarro, Benjamin Sambale
TL;DR
This paper presents a counterexample to Feit's Problem VIII concerning bounds on decomposition numbers, thereby resolving an open question posed by Holm and Willems.
Contribution
It provides the first known counterexample to Feit's Problem VIII, challenging previous assumptions about bounds on decomposition numbers.
Findings
Counterexample disproves Feit's Problem VIII.
Answers an open question by Holm and Willems.
Impacts the understanding of bounds in modular representation theory.
Abstract
We find a counterexample to Feit's Problem VIII on the bound of decomposition numbers. This also answers a question raised by T. Holm and W. Willems.
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
TopicsComputability, Logic, AI Algorithms · Analytic Number Theory Research · Limits and Structures in Graph Theory