New parameters of subsets in polynomial association schemes

DOI10.1016/J.JCTA.2011.07.009zbMATH Open1232.05245arXiv1008.0189OpenAlexW1969509514MaRDI QIDQ645966FDOQ645966

Authors: Sho Suda 

Publication date: 11 November 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: We define new parameters, a zero interval and a dual zero interval, of subsets in $P$- or $Q$-polynomial schemes. A zero interval of a subset in a $P$-polynomial scheme is a successive interval index for which the inner distribution vanishes, and a dual zero interval of a subset in a $Q$-polynomial scheme is a successive interval index for which the dual inner distribution vanishes. We derive the bounds of the lengths of a zero interval and a dual zero interval using the degree and dual degree respectively, and show that a subset in a $P$-polynomial scheme (resp. a $Q$-polynomial scheme) having a large length of a zero interval (resp. a dual zero interval) induces a completely regular code (resp. a $Q$-polynomial scheme). Moreover, we consider the spherical analogue of a dual zero interval.

Full work available at URL: https://arxiv.org/abs/1008.0189

Recommendations

• Width and dual width of subsets in polynomial association schemes
• scientific article; zbMATH DE number 3861180
• A characterization of \(P\)- and \(Q\)-polynomial association schemes
• On a new family of (P and Q)-polynomial schemes
• Parameters of association schemes that are both P- and Q-polynomial

zbMATH Keywords

association schememinimum distancewidthdesignsdual width

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Cites Work

• Theorems of Erdős-Ko-Rado type in polar spaces
• Title not available (Why is that?)
• The subconstituent algebra of an association scheme. I
• The subconstituent algebra of an association scheme. III
• The subconstituent algebra of an association scheme. II
• Title not available (Why is that?)
• Association schemes and t-designs in regular semilattices
• Averaging sets: A generalization of mean values and spherical designs
• Spherical codes and designs
• Width and dual width of subsets in polynomial association schemes
• Beyond the orthogonal array concept.
• Extending the t-Design Concept
• Bounds on mixed binary/ternary codes

Cited In (1)

• Width and dual width of subsets in polynomial association schemes

This page was built for publication: New parameters of subsets in polynomial association schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645966)