"graphoid" meaning in All languages combined

See graphoid on Wiktionary

Noun [English]

Forms: graphoids [plural]
Etymology: From graph + -oid. 1985, United States. Etymology templates: {{suffix|en|graph|oid}} graph + -oid Head templates: {{en-noun}} graphoid (plural graphoids)
  1. (combinatorics) A matroid that has two collections of nonempty subsets called circuits and cocircuits such that the intersection of any circuit and cocircuit is not only the identity matroid, no circuit properly contains another circuit, no cocircuit properly contains another cocircuit, and for any painting of M that colors exactly one element green and the rest either red or blue there exists either a circuit containing the green element and no red elements or a cocircuit containing the green element and no blue elements. Categories (topical): Combinatorics
    Sense id: en-graphoid-en-noun-yEOxueDN Topics: combinatorics, mathematics, sciences
  2. (logic) A set of statements of the form, "X is irrelevant to Y given that we know Z" where X, Y and Z are sets of variables, which can be manipulated by a set of axioms concerning informational irrelevance and its graphical representation. Categories (topical): Logic
    Sense id: en-graphoid-en-noun-SvP6IhPA Categories (other): English entries with incorrect language header, English terms suffixed with -oid Disambiguation of English entries with incorrect language header: 43 57 Disambiguation of English terms suffixed with -oid: 32 68 Topics: human-sciences, logic, mathematics, philosophy, sciences

Inflected forms

Download JSON data for graphoid meaning in All languages combined (3.3kB)

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "graph",
        "3": "oid"
      },
      "expansion": "graph + -oid",
      "name": "suffix"
    }
  ],
  "etymology_text": "From graph + -oid. 1985, United States.",
  "forms": [
    {
      "form": "graphoids",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "graphoid (plural graphoids)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Combinatorics",
          "orig": "en:Combinatorics",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A matroid that has two collections of nonempty subsets called circuits and cocircuits such that the intersection of any circuit and cocircuit is not only the identity matroid, no circuit properly contains another circuit, no cocircuit properly contains another cocircuit, and for any painting of M that colors exactly one element green and the rest either red or blue there exists either a circuit containing the green element and no red elements or a cocircuit containing the green element and no blue elements."
      ],
      "id": "en-graphoid-en-noun-yEOxueDN",
      "links": [
        [
          "combinatorics",
          "combinatorics"
        ],
        [
          "matroid",
          "matroid"
        ],
        [
          "nonempty",
          "nonempty"
        ],
        [
          "subsets",
          "subsets"
        ]
      ],
      "raw_glosses": [
        "(combinatorics) A matroid that has two collections of nonempty subsets called circuits and cocircuits such that the intersection of any circuit and cocircuit is not only the identity matroid, no circuit properly contains another circuit, no cocircuit properly contains another cocircuit, and for any painting of M that colors exactly one element green and the rest either red or blue there exists either a circuit containing the green element and no red elements or a cocircuit containing the green element and no blue elements."
      ],
      "topics": [
        "combinatorics",
        "mathematics",
        "sciences"
      ]
    },
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Logic",
          "orig": "en:Logic",
          "parents": [
            "Formal sciences",
            "Philosophy",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "43 57",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "32 68",
          "kind": "other",
          "name": "English terms suffixed with -oid",
          "parents": [],
          "source": "w+disamb"
        }
      ],
      "glosses": [
        "A set of statements of the form, \"X is irrelevant to Y given that we know Z\" where X, Y and Z are sets of variables, which can be manipulated by a set of axioms concerning informational irrelevance and its graphical representation."
      ],
      "id": "en-graphoid-en-noun-SvP6IhPA",
      "links": [
        [
          "logic",
          "logic"
        ],
        [
          "statement",
          "statement"
        ],
        [
          "manipulated",
          "manipulated"
        ],
        [
          "axiom",
          "axiom"
        ],
        [
          "informational",
          "informational"
        ],
        [
          "irrelevance",
          "irrelevance"
        ],
        [
          "graphical",
          "graphical"
        ],
        [
          "representation",
          "representation"
        ]
      ],
      "raw_glosses": [
        "(logic) A set of statements of the form, \"X is irrelevant to Y given that we know Z\" where X, Y and Z are sets of variables, which can be manipulated by a set of axioms concerning informational irrelevance and its graphical representation."
      ],
      "topics": [
        "human-sciences",
        "logic",
        "mathematics",
        "philosophy",
        "sciences"
      ]
    }
  ],
  "wikipedia": [
    "graphoid"
  ],
  "word": "graphoid"
}
{
  "categories": [
    "English countable nouns",
    "English entries with incorrect language header",
    "English lemmas",
    "English nouns",
    "English terms suffixed with -oid"
  ],
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "graph",
        "3": "oid"
      },
      "expansion": "graph + -oid",
      "name": "suffix"
    }
  ],
  "etymology_text": "From graph + -oid. 1985, United States.",
  "forms": [
    {
      "form": "graphoids",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "graphoid (plural graphoids)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "en:Combinatorics"
      ],
      "glosses": [
        "A matroid that has two collections of nonempty subsets called circuits and cocircuits such that the intersection of any circuit and cocircuit is not only the identity matroid, no circuit properly contains another circuit, no cocircuit properly contains another cocircuit, and for any painting of M that colors exactly one element green and the rest either red or blue there exists either a circuit containing the green element and no red elements or a cocircuit containing the green element and no blue elements."
      ],
      "links": [
        [
          "combinatorics",
          "combinatorics"
        ],
        [
          "matroid",
          "matroid"
        ],
        [
          "nonempty",
          "nonempty"
        ],
        [
          "subsets",
          "subsets"
        ]
      ],
      "raw_glosses": [
        "(combinatorics) A matroid that has two collections of nonempty subsets called circuits and cocircuits such that the intersection of any circuit and cocircuit is not only the identity matroid, no circuit properly contains another circuit, no cocircuit properly contains another cocircuit, and for any painting of M that colors exactly one element green and the rest either red or blue there exists either a circuit containing the green element and no red elements or a cocircuit containing the green element and no blue elements."
      ],
      "topics": [
        "combinatorics",
        "mathematics",
        "sciences"
      ]
    },
    {
      "categories": [
        "en:Logic"
      ],
      "glosses": [
        "A set of statements of the form, \"X is irrelevant to Y given that we know Z\" where X, Y and Z are sets of variables, which can be manipulated by a set of axioms concerning informational irrelevance and its graphical representation."
      ],
      "links": [
        [
          "logic",
          "logic"
        ],
        [
          "statement",
          "statement"
        ],
        [
          "manipulated",
          "manipulated"
        ],
        [
          "axiom",
          "axiom"
        ],
        [
          "informational",
          "informational"
        ],
        [
          "irrelevance",
          "irrelevance"
        ],
        [
          "graphical",
          "graphical"
        ],
        [
          "representation",
          "representation"
        ]
      ],
      "raw_glosses": [
        "(logic) A set of statements of the form, \"X is irrelevant to Y given that we know Z\" where X, Y and Z are sets of variables, which can be manipulated by a set of axioms concerning informational irrelevance and its graphical representation."
      ],
      "topics": [
        "human-sciences",
        "logic",
        "mathematics",
        "philosophy",
        "sciences"
      ]
    }
  ],
  "wikipedia": [
    "graphoid"
  ],
  "word": "graphoid"
}

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-06-23 from the enwiktionary dump dated 2024-06-20 using wiktextract (1b9bfc5 and 0136956). 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.