"supersolvability" meaning in All languages combined

See supersolvability on Wiktionary

Noun [English]

Etymology: super- + solvability Etymology templates: {{prefix|en|super|solvability}} super- + solvability Head templates: {{en-noun|-}} supersolvability (uncountable)
  1. The state or condition of being supersolvable. Tags: uncountable
    Sense id: en-supersolvability-en-noun-wZ4VxmUf Categories (other): English entries with incorrect language header, English terms prefixed with super-

Download JSON data for supersolvability meaning in All languages combined (1.2kB)

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "super",
        "3": "solvability"
      },
      "expansion": "super- + solvability",
      "name": "prefix"
    }
  ],
  "etymology_text": "super- + solvability",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "supersolvability (uncountable)",
      "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 terms prefixed with super-",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2015, Daisuke Suyama, Shuhei Tsujie, “Freeness of ψ-graphical arrangements and chordality of vertex-weighted graphs”, in arXiv",
          "text": "Lili Mu and Stanley characterized the supersolvability of the #x5C;psi-graphical arrangements and conjectured that the freeness and the supersolvability of #x5C;psi-graphical arrangements are equivalent.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "The state or condition of being supersolvable."
      ],
      "id": "en-supersolvability-en-noun-wZ4VxmUf",
      "links": [
        [
          "supersolvable",
          "supersolvable#English"
        ]
      ],
      "tags": [
        "uncountable"
      ]
    }
  ],
  "word": "supersolvability"
}
{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "super",
        "3": "solvability"
      },
      "expansion": "super- + solvability",
      "name": "prefix"
    }
  ],
  "etymology_text": "super- + solvability",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "supersolvability (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms prefixed with super-",
        "English terms with quotations",
        "English uncountable nouns"
      ],
      "examples": [
        {
          "ref": "2015, Daisuke Suyama, Shuhei Tsujie, “Freeness of ψ-graphical arrangements and chordality of vertex-weighted graphs”, in arXiv",
          "text": "Lili Mu and Stanley characterized the supersolvability of the #x5C;psi-graphical arrangements and conjectured that the freeness and the supersolvability of #x5C;psi-graphical arrangements are equivalent.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "The state or condition of being supersolvable."
      ],
      "links": [
        [
          "supersolvable",
          "supersolvable#English"
        ]
      ],
      "tags": [
        "uncountable"
      ]
    }
  ],
  "word": "supersolvability"
}

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-09 from the enwiktionary dump dated 2024-05-02 using wiktextract (4d5d0bb and edd475d). 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.