Completely regular designs of strength one (Q1321590): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 12:13, 31 January 2024

scientific article
Language Label Description Also known as
English
Completely regular designs of strength one
scientific article

    Statements

    Completely regular designs of strength one (English)
    0 references
    0 references
    28 April 1994
    0 references
    We study a class of highly regular \(t\)-designs. These are the subsets of vertices of the Johnson graph which are completely regular in the sense of Delsarte. Meyerowitz has classified the completely regular designs having strength zero. In this paper, we determine the completely regular designs having strength one and minimum distance at least two. The approach taken here utilizes the incidence matrix of \((t+ 1)\)-sets versus \(k\)-sets and is related to the representation theory of distance-regular graphs.
    0 references
    equitable partition
    0 references
    \(t\)-designs
    0 references
    Johnson graph
    0 references
    completely regular designs
    0 references

    Identifiers