{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "4Y4MR8W9AF"
    }
  ],
  "body": "\n## Summary\n\nAn association scheme is a partition of the ordered pairs of a finite set into relations with a strong regularity property.\nThe number of paths of two given types between two points depends only on the relation between the points.\nThe adjacency matrices of the relations span a matrix algebra, the Bose–Mesner algebra, which makes linear algebra available for combinatorial questions.\nAssociation schemes came from the design of statistical experiments and are now basic in coding theory, design theory and the study of [[strongly regular graphs|C22WGRP3T8]].\n\n## Explanations\n\n### L1 human\n\nThink of a finite set of points where every pair of points stands in exactly one of a few possible relations, such as \"equal\", \"near\" or \"far\".\nThe scheme is very regular.\nTake two points in a given relation; the number of third points near the first and far from the second depends only on that relation.\nThe words of length $n$ over an alphabet, with \"differ in exactly $i$ places\" as the $i$-th relation, form such a scheme, called the Hamming scheme.\n",
  "commit": "547b6eddb8f2feb8d579f2d633d22a27b7e132fc",
  "front": {
    "kind": "concept",
    "msc": [
      "05E30"
    ],
    "name": "Association scheme",
    "same_as": {
      "wikidata": "Q4810150",
      "wikipedia": "Association scheme"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Association_scheme"
      }
    ],
    "tag": "C338GKB4VJ"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/C338GKB4VJ/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/C338GKB4VJ.md",
  "msc": [
    "05E30"
  ],
  "name": "Association scheme",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/C33/C338GKB4VJ.md",
  "status": null,
  "tag": "C338GKB4VJ",
  "uri": "m2://C338GKB4VJ",
  "url": "https://math2.tamnd.com/wiki/association-scheme/",
  "writing": {
    "tag": "C338GKB4VJ",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}