Groups, Combinatorics and Geometry 2003
DOI: 10.1142/9789812564481_0004
|View full text |Cite
|
Sign up to set email alerts
|

Coherent configurations, association schemes and permutation groups

Abstract: Coherent configurations are combinatorial objects invented for the purpose of studying finite permutation groups; every permutation group which is not doubly transitive preserves a non-trivial coherent configuration. However, symmetric coherent configurations have a much longer history, having been used in statistics under the name of association schemes.The relationship between permutation groups and association schemes is quite subtle; there are groups which preserve no non-trivial association scheme, and ot… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
13
0

Year Published

2006
2006
2021
2021

Publication Types

Select...
8
1
1

Relationship

1
9

Authors

Journals

citations
Cited by 22 publications
(14 citation statements)
references
References 26 publications
1
13
0
Order By: Relevance
“…We use the same definition as the books of Bailey [7] and Brouwer, Cohen and Neumaier [22]; however, the books by Bannai and Ito [12] and Zieschang [96] each give different definitions, which are both weaker than ours. We refer the reader to [34] for a discussion of the various objects that have been called 'association schemes'.…”
Section: Coherent Configurations and Association Schemesmentioning
confidence: 99%
“…We use the same definition as the books of Bailey [7] and Brouwer, Cohen and Neumaier [22]; however, the books by Bannai and Ito [12] and Zieschang [96] each give different definitions, which are both weaker than ours. We refer the reader to [34] for a discussion of the various objects that have been called 'association schemes'.…”
Section: Coherent Configurations and Association Schemesmentioning
confidence: 99%
“…Association schemes and coherent configurations ( [1,6,19,20]), and the related Bose-Mesner algebras and coherent algebras ( [7]) are well-known in combinatorics with many applications in coding theory, graph theory and statistics (e.g., [2][3][4][5]8,9,11,12,16,17,24,28,33,34]).…”
Section: Association Schemes On Triplesmentioning
confidence: 99%
“…We introduce the Bose-Mesner algebra and relevant projections and applications here. For a more thorough discussion on Bose-Mesner algebras and their application in statistical and quantum physics, combinatorics, coding, graph theory, and statistical covariance analysis (more particularly in experimental designs) we refer to the seminal article of Bose-Mesner [20], the ones of Nelder [67,68], the more recent articles [32,24,40], as well as the books [21,10].…”
Section: Bose-mesner Projectionsmentioning
confidence: 99%