Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cartan coherent configurations

Published 23 Feb 2016 in math.CO and math.GR | (1602.07132v1)

Abstract: The Cartan scheme $\cal X$ of a finite group $G$ with a $(B,N)$-pair is defined to be the coherent configuration associated with the action of $G$ on the right cosets of the Cartan subgroup $B\cap N$ by the right multiplications. It is proved that if $G$ is a simple group of Lie type, then asymptotically, the coherent configuration $\cal X$ is 2-separable, i.e., the array of 2-dimensional intersection numbers determines $\cal X$ up to isomorphism. It is also proved that in this case, the base number of $\cal X$ equals 2. This enables us to construct a polynomial-time algorithm for recognizing the Cartan schemes when the rank of $G$ and order of the underlying field are sufficiently large. One of the key points in the proof of the main results is a new sufficient condition for an arbitrary homogeneous coherent configuration to be 2-separable.

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.