Kite-free \(P\)- and \(Q\)-polynomial schemes
type: Item
instance of: scholarly article
title: Kite-free \(P\)- and \(Q\)-polynomial schemes
zbMATH Open document ID: 0832.05102
DOI: 10.1007/BF01929487
published in: Graphs and Combinatorics
publication date: 1996-02-20T00:00:00Z
review text: Let \(Y= (X, \{R_i\}_{0\leq i\leq d})\) denote a \(P\)-polynomial association scheme. A kite of length \(i\) \((2\leq i\leq d)\) in \(Y\) is a 4- tuple \(xyzu\) \((x,y,z, u\in X)\) such that \((x, y)\in R_1\), \((x, z)\in R_1\), \((y, z)\in R_1\), \((u, y)\in R_{i- 1}\), \((u, z)\in R_{i- 1}\), \((u, x)\in R_i\). The main result of the reviewed paper is the following theorem: Let \(Y\) be a \(P\)- and \(Q\)-polynomial association scheme. Suppose \(Y\) has diameter \(d\geq 3\), and suppose \(Y\) has intersection number \(a_1\neq 0\). Then the statements (1) through (3) below are equivalent: (1) \(Y\) has classical parameters \((d, b, \alpha, \beta)\), and either \(b< -1\), or \(Y\) is a dual polar scheme or a Hamming scheme. (2) \(Y\) has no kites of length 2 and no kites of length 3. (3) \(Y\) has no kites of any length \(i\) \((2\leq i\leq d)\).
Mathematics Subject Classification ID: 05E30
zbMATH DE Number: 784147
zbMATH Keywords: configuration
zbMATH Keywords: association scheme
zbMATH Keywords: kite
zbMATH Keywords: intersection number
zbMATH Keywords: parameters
zbMATH Keywords: dual polar scheme
zbMATH Keywords: Hamming scheme
author: Chih-Wen Weng
reviewed by: Nikolai I. Osetinski
MaRDI profile type: Publication
cites work: Q3218140
cites work: Q3992965
cites work: The subconstituent algebra of an association scheme. I
cites work: A new inequality for distance-regular graphs
cites work: Kite-free distance-regular graphs
full work available at URL: https://doi.org/10.1007/bf01929487
OpenAlex ID: W39023213
description: scientific article; zbMATH DE number 784147