Properties of Commutative Association Schemes derived by FGLM Techniques

Details Properties of Commutative Association Schemes derived by FGLM Techniques Properties of Commutative Association Schemes derived by FGLM Techniques

2001-01-10

arxiv.org/abs/math/0101093v1

Mathematics

Combinatorics

12 pages, to appear in the International Journal of Algebra and Computation

Scientific paper

Association schemes are combinatorial objects that allow us solve problems in several branches of mathematics. They have been used in the study of permutation groups and graphs and also in the design of experiments, coding theory, partition designs etc. In this paper we show some techniques for computing properties of association schemes. The main framework arises from the fact that we can characterize completely the Bose-Mesner algebra in terms of a zero-dimensional ideal. A Gr\"obner basis of this ideal can be easily derived without the use of Buchberger algorithm in an efficient way. From this statement, some nice relations arise between the treatment of zero-dimensional ideals by reordering techniques (FGLM techniques) and some properties of the schemes such as P-polynomiality, and minimal generators of the algebra.

Affiliated with

Also associated with

No associations

Rating

Properties of Commutative Association Schemes derived by FGLM Techniques 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 Properties of Commutative Association Schemes derived by FGLM Techniques, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Properties of Commutative Association Schemes derived by FGLM Techniques will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-66200