"digraphoid" meaning in All languages combined

See digraphoid on Wiktionary

Noun [English]

Forms: digraphoids [plural]
Etymology: Blend of directed + graphoid, after digraph (“directed graph”). Coined by American mathematician George J. Minty in a 1966 article. Etymology templates: {{blend|en|directed|graphoid}} Blend of directed + graphoid, {{m|en|digraph|t=directed graph}} digraph (“directed graph”), {{coinage|en|Q1507912|nobycat=1}} Coined by American mathematician George J. Minty Head templates: {{en-noun}} digraphoid (plural digraphoids)
  1. (combinatorics) A dual pair of regular matroids. Categories (topical): Combinatorics
    Sense id: en-digraphoid-en-noun-AO-fhcwH Categories (other): English blends, English entries with incorrect language header Topics: combinatorics, mathematics, sciences

Download JSON data for digraphoid meaning in All languages combined (2.3kB)

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "directed",
        "3": "graphoid"
      },
      "expansion": "Blend of directed + graphoid",
      "name": "blend"
    },
    {
      "args": {
        "1": "en",
        "2": "digraph",
        "t": "directed graph"
      },
      "expansion": "digraph (“directed graph”)",
      "name": "m"
    },
    {
      "args": {
        "1": "en",
        "2": "Q1507912",
        "nobycat": "1"
      },
      "expansion": "Coined by American mathematician George J. Minty",
      "name": "coinage"
    }
  ],
  "etymology_text": "Blend of directed + graphoid, after digraph (“directed graph”). Coined by American mathematician George J. Minty in a 1966 article.",
  "forms": [
    {
      "form": "digraphoids",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "digraphoid (plural digraphoids)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English blends",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Combinatorics",
          "orig": "en:Combinatorics",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "[1966, George J. Minty, “On the Axiomatic Foundations of the Theories of Directed Linear Graphs, Electrical Networks and Network-Programming”, in Journal of Mathematics and Mechanics, volume 15, number 3, →JSTOR, pages 506–507",
          "text": "We now wish to consider what part of the theory of directed graphs can be built up in the wider context of graphoids/matroids. To this end, we shall introduce the concepts of digraphoid (short for “directed graphoid”) and orientable graphoid. […] A digraphoid is a structure consisting of: (1º) a graphoid, and (2º) a partitioning of each circuit and cocircuit of the graphoid, each being partitioned into two sets; this partitioning is to satisfy the axiom: […]]",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A dual pair of regular matroids."
      ],
      "id": "en-digraphoid-en-noun-AO-fhcwH",
      "links": [
        [
          "combinatorics",
          "combinatorics"
        ],
        [
          "dual",
          "dual"
        ],
        [
          "matroid",
          "matroid"
        ]
      ],
      "raw_glosses": [
        "(combinatorics) A dual pair of regular matroids."
      ],
      "topics": [
        "combinatorics",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "digraphoid"
}
{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "directed",
        "3": "graphoid"
      },
      "expansion": "Blend of directed + graphoid",
      "name": "blend"
    },
    {
      "args": {
        "1": "en",
        "2": "digraph",
        "t": "directed graph"
      },
      "expansion": "digraph (“directed graph”)",
      "name": "m"
    },
    {
      "args": {
        "1": "en",
        "2": "Q1507912",
        "nobycat": "1"
      },
      "expansion": "Coined by American mathematician George J. Minty",
      "name": "coinage"
    }
  ],
  "etymology_text": "Blend of directed + graphoid, after digraph (“directed graph”). Coined by American mathematician George J. Minty in a 1966 article.",
  "forms": [
    {
      "form": "digraphoids",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "digraphoid (plural digraphoids)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English blends",
        "English coinages",
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms with quotations",
        "en:Combinatorics"
      ],
      "examples": [
        {
          "ref": "[1966, George J. Minty, “On the Axiomatic Foundations of the Theories of Directed Linear Graphs, Electrical Networks and Network-Programming”, in Journal of Mathematics and Mechanics, volume 15, number 3, →JSTOR, pages 506–507",
          "text": "We now wish to consider what part of the theory of directed graphs can be built up in the wider context of graphoids/matroids. To this end, we shall introduce the concepts of digraphoid (short for “directed graphoid”) and orientable graphoid. […] A digraphoid is a structure consisting of: (1º) a graphoid, and (2º) a partitioning of each circuit and cocircuit of the graphoid, each being partitioned into two sets; this partitioning is to satisfy the axiom: […]]",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A dual pair of regular matroids."
      ],
      "links": [
        [
          "combinatorics",
          "combinatorics"
        ],
        [
          "dual",
          "dual"
        ],
        [
          "matroid",
          "matroid"
        ]
      ],
      "raw_glosses": [
        "(combinatorics) A dual pair of regular matroids."
      ],
      "topics": [
        "combinatorics",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "digraphoid"
}

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-05-20 from the enwiktionary dump dated 2024-05-02 using wiktextract (1d5a7d1 and 304864d). 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.