Papers
Topics
Authors
Recent
Search
2000 character limit reached

Characterization of Balanced Coherent Configurations

Published 3 Feb 2010 in math.CO and math.GR | (1002.0628v1)

Abstract: Let $G$ be a group acting on a finite set $\Omega$. Then $G$ acts on $\Omega\times \Omega$ by its entry-wise action and its orbits form the basis relations of a coherent configuration (or shortly scheme). Our concern is to consider what follows from the assumption that the number of orbits of $G$ on $\Omega_i\times \Omega_j$ is constant whenever $\Omega_i$ and $\Omega_j$ are orbits of $G$ on $\Omega$. One can conclude from the assumption that the actions of $G$ on ${\Omega_i}$'s have the same permutation character and are not necessarily equivalent. From this viewpoint one may ask how many inequivalent actions of a given group with the same permutation character there exist. In this article we will approach to this question by a purely combinatorial method in terms of schemes and investigate the following topics: (i) balanced schemes and their central primitive idempotents, (ii) characterization of reduced balanced schemes.

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.