Arbitrarily large Morita Frobenius numbers
Florian Eisele, Michael Livesey
TL;DR
This paper constructs blocks of finite groups with arbitrarily large Morita Frobenius numbers, addressing a question in algebra and improving previous results on related invariants.
Contribution
It provides the first explicit construction of blocks with arbitrarily large Morita Frobenius numbers, advancing understanding of their behavior.
Findings
Blocks with arbitrarily large Morita Frobenius numbers constructed
Answers a question posed by Benson and Kessar
Improves upon previous results on $\
Abstract
We construct blocks of finite groups with arbitrarily large Morita Frobenius numbers, an invariant which determines the size of the minimal field of definition of the associated basic algebra. This answers a question of Benson and Kessar. This also improves upon a result of the second author where arbitrarily large -Morita Frobenius numbers are constructed.
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
TopicsFinite Group Theory Research · Coding theory and cryptography · Graph theory and applications