Coherent configurations over copies of association schemes of prime order
Abstract
Let G be a group acting faithfully and transitively on i for i=1,2. A famous theorem by Burnside implies the following fact: If |1|=|2| is a prime and the rank of one of the actions is greater than two, then the actions are equivalent, or equivalently |(α,β)G|=|1|=|2| for some (α,β)∈ 1× 2. In this paper we consider a combinatorial analogue to this fact through the theory of coherent configurations, and give some arithmetic sufficient conditions for a coherent configuration with two homogeneous components of prime order to be uniquely determined by one of the homogeneous components.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.