Constructions of Grassmannian Simplices

Details Constructions of Grassmannian Simplices Constructions of Grassmannian Simplices

2007-03-08

arxiv.org/abs/cs/0703036v4

Computer Science

Information Theory

22 pages, 3 figures

Scientific paper

In this article an explicit method (relying on representation theory) to construct packings in Grassmannian space is presented. Infinite families of configurations having only one non-trivial set of principal angles are found using 2-transitive groups. These packings are proved to reach the simplex bound and are therefore optimal w.r.t. the chordal distance. The construction is illustrated by an example on the symmetric group. Then some natural extends and consequences of this situation are given.

Affiliated with

Also associated with

No associations

Rating

Constructions of Grassmannian Simplices 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 Constructions of Grassmannian Simplices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constructions of Grassmannian Simplices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-642468