Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
type: Item
instance of: scholarly article
title: Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
zbMATH Open document ID: 0685.05030
DOI: 10.1007/BF01788104
author: Eiichi Bannai
author: Tatsuro Ito
published in: Graphs and Combinatorics
publication date: 1986-01-01T00:00:00Z
review text: This paper is a good survey of recent progress on properties and classification of association schemes. It updates the discussion in the author's book Algebraic combinatorics I, Association schemes (1984; Zbl 0555.05019) of these problems. Moreover, a number of interesting new problems in this area are posed. The pace of development in the field is still fast; a more recent, geometric perspective of the topics of this survey can be found in the book Distance-regular graphs (Springer 1989) by \textit{A. E. Brouwer}, \textit{A. M. Cohen} and the reviewer.
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05B30
Mathematics Subject Classification ID: 05B25
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05-02
zbMATH DE Number: 4122027
zbMATH Keywords: distance-transitive
zbMATH Keywords: survey
zbMATH Keywords: association schemes
zbMATH Keywords: Distance-regular graphs
MaRDI profile type: Publication
cites work: Q3218140
cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
cites work: Q3331169
cites work: On tight t-designs in compact symmetric spaces of rank one
cites work: On distance-regular graphs with fixed valency
cites work: On distance-regular graphs with fixed valency. II
cites work: On distance-regular graphs with fixed valency. III
cites work: Cubic Distance-Regular Graphs
cites work: On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
cites work: Association schemes and quadratic transformations for orthogonal polynomials
cites work: A characterization of some geometries of Lie type
cites work: Q3922829
cites work: The Radon transform on \({\mathbb{Z}}^ k_ 2\)
cites work: Q4074938
cites work: Algebraic decompositions of commutative association schemes
cites work: Distance-transitive graphs of valency five
cites work: Q3731623
cites work: Distance-regularised graphs are distance-regular or distance-biregular
cites work: The origin of the theory of group characters
cites work: New light on Frobenius' creation of the theory of group characters
cites work: Distance-regular graphs and halved graphs
cites work: The large cliques in the graph of quadratic forms
cites work: A characterization of the association schemes of bilinear forms
cites work: On the Askey-Wilson and Rogers Polynomials
cites work: Q3344016
cites work: Distance-transitive representations of the symmetric groups
cites work: Q3691765
cites work: Characters of finite quasigroups
cites work: Characters of finite quasigroups. II: Induced characters
cites work: The Affine Permutation Groups of Rank Three
cites work: The Finite Primitive Permutation Groups of Rank Three
cites work: Tactical configurations and their generic ring
cites work: The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
cites work: An analogue of t-designs in the association schemes of alternating bilinear forms
cites work: Distance matrices and \(n\)-dimensional designs
cites work: Characerization of a class of distance regular graphs.
cites work: On t-homogeneous permutation sets
cites work: On finite geometries of type \(B_ 3\)
cites work: Q3344217
cites work: Distance Transitive Graphs and Finite Simple Groups
cites work: Q3964619
cites work: Q3963021
cites work: t-designs in classical association schemes
cites work: Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
cites work: Root systems and the Johnson and Hamming graphs
cites work: The classification of distance-regular graphs of type IIB
cites work: A new feasibility condition for distance-regular graphs
cites work: Distance-transitive graphs and generalized polygons
cites work: On Distance-Transitive Graphs
full work available at URL: https://doi.org/10.1007/bf01788104
OpenAlex ID: W2916288529
description: scientific article; zbMATH DE number 4122027