Papers
Topics
Authors
Recent
Search
2000 character limit reached

Coherent configurations over copies of association schemes of prime order

Published 15 Sep 2013 in math.CO | (1309.3725v3)

Abstract: Let $G$ be a group acting faithfully and transitively on $\Omega_i$ for $i=1,2$. A famous theorem by Burnside implies the following fact: If $|\Omega_1|=|\Omega_2|$ is a prime and the rank of one of the actions is greater than two, then the actions are equivalent, or equivalently $|(\alpha,\beta)G|=|\Omega_1|=|\Omega_2|$ for some $(\alpha,\beta)\in \Omega_1\times \Omega_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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.