"Ramanujan graph" meaning in All languages combined

See Ramanujan graph on Wiktionary

Noun [English]

Forms: Ramanujan graphs [plural]
Etymology: Named after mathematician Srinivasa Ramanujan. Head templates: {{en-noun}} Ramanujan graph (plural Ramanujan graphs)
  1. (graph theory) A regular graph whose spectral gap is almost as large as possible, making it an excellent spectral expander. Such graphs are relevant to diverse branches of pure mathematics. Wikipedia link: Srinivasa Ramanujan Categories (topical): Graph theory

Inflected forms

{
  "etymology_text": "Named after mathematician Srinivasa Ramanujan.",
  "forms": [
    {
      "form": "Ramanujan graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Ramanujan graph (plural Ramanujan graphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A regular graph whose spectral gap is almost as large as possible, making it an excellent spectral expander. Such graphs are relevant to diverse branches of pure mathematics."
      ],
      "id": "en-Ramanujan_graph-en-noun-L2yVKGZB",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "regular graph",
          "regular graph"
        ],
        [
          "spectral gap",
          "spectral gap"
        ],
        [
          "expander",
          "expander"
        ],
        [
          "pure mathematics",
          "pure mathematics"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A regular graph whose spectral gap is almost as large as possible, making it an excellent spectral expander. Such graphs are relevant to diverse branches of pure mathematics."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Srinivasa Ramanujan"
      ]
    }
  ],
  "word": "Ramanujan graph"
}
{
  "etymology_text": "Named after mathematician Srinivasa Ramanujan.",
  "forms": [
    {
      "form": "Ramanujan graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Ramanujan graph (plural Ramanujan graphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "Pages with 1 entry",
        "en:Graph theory"
      ],
      "glosses": [
        "A regular graph whose spectral gap is almost as large as possible, making it an excellent spectral expander. Such graphs are relevant to diverse branches of pure mathematics."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "regular graph",
          "regular graph"
        ],
        [
          "spectral gap",
          "spectral gap"
        ],
        [
          "expander",
          "expander"
        ],
        [
          "pure mathematics",
          "pure mathematics"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A regular graph whose spectral gap is almost as large as possible, making it an excellent spectral expander. Such graphs are relevant to diverse branches of pure mathematics."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Srinivasa Ramanujan"
      ]
    }
  ],
  "word": "Ramanujan graph"
}

Download raw JSONL data for Ramanujan graph meaning in All languages combined (1.3kB)


This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-10-01 from the enwiktionary dump dated 2024-09-20 using wiktextract (3fd8a50 and 59b8406). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.