Let G be a finite group. The set of all supercharacter theories of G forms a lattice, where the join operation coincides with the join operation on the lattice of partitions of G, with partial order given by refinement. The meet operation is more complicated however, and seems difficult to describe. In this paper, we outline algorithms for determining the coarsest supercharacter theory whose associated partition is finer than a given partition. One of the primary applications is to compute the supercharacters and superclasses for the meet of two supercharacter theories.

中文翻译：

---

一种用于计算从给定分区生成的超字符理论的算法

让G是一个有限群。所有超字符理论的集合G形成一个格，其中连接操作与对的分区格上的连接操作重合G，通过细化给出部分顺序。然而，满足操作更复杂，并且似乎难以描述。在本文中，我们概述了确定关联分区比给定分区更精细的最粗略超字符理论的算法。主要应用之一是计算满足两个超字符理论的超字符和超类。