Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I

DOI10.1007/BF01788104zbMath0685.05030OpenAlexW2916288529MaRDI QIDQ1825881

Eiichi Bannai, Tatsuro Ito

Publication date: 1986

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788104

zbMATH Keywords

surveyassociation schemesdistance-transitiveDistance-regular graphs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other designs, configurations (05B30) Combinatorial aspects of finite geometries (05B25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (19)

On strongly closed subgraphs of highly regular graphs ⋮ On the spectrum and linear programming bound for hypergraphs ⋮ Intersection diagrams of distance-biregular graphs ⋮ On distance-regular graphs with height two ⋮ On distance-regular graphs with \(k_ i= k_ j\). II ⋮ The association schemes of dual polar spaces of type \(^ 2A_{2d- 1}(p^ f)\) are characterized by their parameters if \(d\geq 3\) ⋮ Duality in the theory of finite commutative multivalued groups. ⋮ Characters of finite quasigroups. VI: Critical examples and doubletons ⋮ On a new family of (P and Q)-polynomial schemes ⋮ Galois correspondence between permutation groups and cellular rings (association schemes) ⋮ The subconstituent algebra of an association scheme. I ⋮ On distance transitive graphs whose automorphism groups are affine ⋮ On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes ⋮ Harmonic index \(t\)-designs in the Hamming scheme for arbitrary \(q\) ⋮ Harmonic index \(t\)-designs in the Hamming scheme for arbitrary \(q\) ⋮ Induced class functions are conditional expectations ⋮ A new family of distance-regular graphs with unbounded diameter ⋮ Bicoset groups and symmetric graphs. ⋮ An application of intersection diagrams of high rank

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• On distance-regular graphs with fixed valency
• The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
• Characters of finite quasigroups
• A characterization of some geometries of Lie type
• On t-homogeneous permutation sets
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• The classification of distance-regular graphs of type IIB
• On distance-regular graphs with fixed valency. II
• Distance-transitive graphs and generalized polygons
• On tight t-designs in compact symmetric spaces of rank one
• Algebraic decompositions of commutative association schemes
• On finite geometries of type \(B_ 3\)
• The Radon transform on \({\mathbb{Z}}^ k_ 2\)
• Characters of finite quasigroups. II: Induced characters
• Distance-transitive representations of the symmetric groups
• Distance-regular graphs and halved graphs
• A new feasibility condition for distance-regular graphs
• t-designs in classical association schemes
• Association schemes and quadratic transformations for orthogonal polynomials
• An analogue of t-designs in the association schemes of alternating bilinear forms
• Tactical configurations and their generic ring
• The large cliques in the graph of quadratic forms
• A characterization of the association schemes of bilinear forms
• On distance-regular graphs with fixed valency. III
• Distance matrices and \(n\)-dimensional designs
• New light on Frobenius' creation of the theory of group characters
• Root systems and the Johnson and Hamming graphs
• Distance-regularised graphs are distance-regular or distance-biregular
• The origin of the theory of group characters
• Characerization of a class of distance regular graphs.
• On Distance-Transitive Graphs
• Cubic Distance-Regular Graphs
• The Finite Primitive Permutation Groups of Rank Three
• Distance-transitive graphs of valency five
• On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
• Distance Transitive Graphs and Finite Simple Groups
• The Affine Permutation Groups of Rank Three
• On the Askey-Wilson and Rogers Polynomials

This page was built for publication: Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I