2020/06/24 by Florian Eisele, Eisele, Florian, Michael Livesey +1
Computer Science · Mathematics · #20C20 (Primary) #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications #Representation Theory (math.RT)
paper · pdf · doi:10.48550/arxiv.2006.13837
openalex publication_date 2020/06/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 O-Morita Frobenius numbers are constructed.