Groupes d'isométries permutant doublement transitivement un ensemble de droites vectorielles

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Let X be a non-empty finite set, E be a finite dimensional euclidean vector space and G a finite subgroup of O(E), the orthognal group of E. Suppose GG={U_i | i in X} is a finite set of linear lines in E and an orbit of G on which its operation is twice transitive. Then GG is an equiangular set of lines, which means that we can find a real number "c", and generators u_i of the lines U_i (i in X) such that forall i,j in X, ||u_i||=1, and if i is different from j then (u_i|u_j)=\gve_{i,j}.c, with \gve_{i,j} in {-1,+1\} Let Gamma be the simple graph whose set of vertices is X, two of them, say i and j, being linked when \gve_{i,j} = -1. In this article we first explore the relationship between double transitivity of G and geometric properties of Gamma. Then we construct several graphs associated with a twice transitive group G, in particular any of Paley's graphs is associated with a representation of G=PSL_2(q) on a set of q+1 equiangular lines in a vector space whose dimension is (q+1)/2.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Groupes d'isométries permutant doublement transitivement un ensemble de droites vectorielles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Groupes d'isométries permutant doublement transitivement un ensemble de droites vectorielles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Groupes d'isométries permutant doublement transitivement un ensemble de droites vectorielles will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-114882

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.