Abstract
The notion of designs in an association scheme is defined algebraically by Delsarte [4]. It is known that his definition of designs has a geometric interpretation for known (P andQ)-polynomial association schemes except three examples. In this paper we give a geometric interpretation of designs in an association scheme of alternating bilinear forms, which is one of the three.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Artin, E.: Geometric Algebra. New York: Interscience 1957
Bannai, E., Ito, T.: Algebraic Combinatorics I: Association Schemes. Menlo Park, California: Benjamin/Cummings 1984
Cohen, A.M.: A synopsis of known distance-regular graphs with large diameters. In: Mathematisch Centrum Report ZW 165/81. Amsterdam: Mathematisch Centrum 1981
Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl.10 (1973)
Delsarte, P.: Association schemes andt-designs in regular semilattices. J. Comb. Theory (A)20, 230–243 (1976)
Delsarte, P.: Pairs of vectors in the space of an association scheme. Philips Res. Rep.32, 373–411 (1977)
Delsarte, P., Goethals, J.M.: Alternating bilinear forms over GF(q). J. Comb. Theory (A)19, 26–50 (1975)
Ito, T.: Codes and designs in association schemes (in Japanese). In: Report of Conference on Algebraic Combinatorics. Okayama: Okayama Univ. 1983
Roos, C.: On antidesigns and designs in an association scheme. Delft Prog. Rep.7, 98–109 (1982)
Stanton, D.:t-Designs in classical association schemes. Graphs and Combinatorics2, 283–286 (1986)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Munemasa, A. An analogue oft-Designs in the association schemes of alternating bilinear forms. Graphs and Combinatorics 2, 259–267 (1986). https://doi.org/10.1007/BF01788100
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01788100