Computations on Character Tables of Association Schemes

Edgar Martínez-Moro ()
Additional contact information
Edgar Martínez-Moro: Universidad de Valladolid, Dept. Matemática Aplicada Fundamental

A chapter in Computer Algebra in Scientific Computing CASC’99, 1999, pp 293-307 from Springer

Abstract: Abstract Association schemes are combinatorial objects that allow us solving 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. The author get in touch with this topic through Delsarte’s thesis on association schemes and coding theory [6]. All the information of an association scheme can be derived from its table of characters. In this paper we show some techniques for computing the character table and also derive other properties from it, such as the condition for the scheme to be P-polynomial etc. We also work out some characteristics of metrics which are constant over the relations of the scheme such as Lloyd polynomials. The computations are based on the relation between an association scheme and its Bose-Mesner algebra.

Keywords: Association schemes; Bose-Mesner algebra; eigenvalue problems; Gröbner basis; metric and weakly metric schemes; Lloyd polynomial. (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-60218-4_23

Ordering information: This item can be ordered from
http://www.springer.com/9783642602184

DOI: 10.1007/978-3-642-60218-4_23

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().