"irredundant" meaning in All languages combined

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "ir",
        "3": "redundant",
        "gloss1": "not"
      },
      "expansion": "ir- (“not”) + redundant",
      "name": "prefix"
    }
  ],
  "etymology_text": "ir- (“not”) + redundant.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "irredundant (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "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 ir-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "1999, Peter J. Cameron, Permutation Groups, Cambridge University Press, page 124",
          "text": "Theorem 4.23 The following conditions on a finite permutation group are equivalent:\n(a) all irredundant bases have the same size;\n(b) the irredundant bases are invariant under re-ordering;\n(c) the irredundant bases are the bases of a matroid.",
          "type": "quotation"
        },
        {
          "ref": "2010, Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk, “Irredundant Set Faster than O(2n)”, in Josep Diaz, Tiziana Calamoneri, editors, Algorithms and Complexity: 7th International Conference, CIAC 2010, Proceedings, Springer,, page 289",
          "text": "We say a set S#x5C;subsetV is irredundant if for any v#x5C;inS there exists a vertex u#x5C;inV such that v dominates u and S#x5C;setminus#x5C;left#x5C;#x7B;v#x5C;right#x5C;#x7D; does not dominate u. We call any such vertex u a private vertex for v. An irredundant set is called inclusion–maximal if it is not a proper subset of any other irredundant set. Note that an inclusion–maximal irredundant set does not necessarily have to dominate the whole vertex set of G as in Figure 1.",
          "type": "quotation"
        },
        {
          "ref": "2013, Donald D. Givone, Digital Principles and Design, McGraw-Hill, page 178",
          "text": "If each of the 10 irredundant expressions is now evaluated by the cost criterion proposed in Sec. 4. 1 involving the total number of gate inputs. then the minimal sums are obtained since a minimal expression is irredundant.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Containing no redundant constraint."
      ],
      "id": "en-irredundant-en-adj-r8AVlzxk",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "redundant",
          "redundant"
        ],
        [
          "constraint",
          "constraint"
        ]
      ],
      "raw_glosses": [
        "(mathematics) Containing no redundant constraint."
      ],
      "related": [
        {
          "word": "irredundance"
        },
        {
          "word": "irredundancy"
        }
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "/ˌɪɹ.ɪˈdʌn.dənt/"
    }
  ],
  "word": "irredundant"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "ir",
        "3": "redundant",
        "gloss1": "not"
      },
      "expansion": "ir- (“not”) + redundant",
      "name": "prefix"
    }
  ],
  "etymology_text": "ir- (“not”) + redundant.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "irredundant (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "related": [
    {
      "word": "irredundance"
    },
    {
      "word": "irredundancy"
    }
  ],
  "senses": [
    {
      "categories": [
        "English 4-syllable words",
        "English adjectives",
        "English entries with incorrect language header",
        "English lemmas",
        "English terms prefixed with ir-",
        "English terms with IPA pronunciation",
        "English terms with quotations",
        "English uncomparable adjectives",
        "en:Mathematics"
      ],
      "examples": [
        {
          "ref": "1999, Peter J. Cameron, Permutation Groups, Cambridge University Press, page 124",
          "text": "Theorem 4.23 The following conditions on a finite permutation group are equivalent:\n(a) all irredundant bases have the same size;\n(b) the irredundant bases are invariant under re-ordering;\n(c) the irredundant bases are the bases of a matroid.",
          "type": "quotation"
        },
        {
          "ref": "2010, Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk, “Irredundant Set Faster than O(2n)”, in Josep Diaz, Tiziana Calamoneri, editors, Algorithms and Complexity: 7th International Conference, CIAC 2010, Proceedings, Springer,, page 289",
          "text": "We say a set S#x5C;subsetV is irredundant if for any v#x5C;inS there exists a vertex u#x5C;inV such that v dominates u and S#x5C;setminus#x5C;left#x5C;#x7B;v#x5C;right#x5C;#x7D; does not dominate u. We call any such vertex u a private vertex for v. An irredundant set is called inclusion–maximal if it is not a proper subset of any other irredundant set. Note that an inclusion–maximal irredundant set does not necessarily have to dominate the whole vertex set of G as in Figure 1.",
          "type": "quotation"
        },
        {
          "ref": "2013, Donald D. Givone, Digital Principles and Design, McGraw-Hill, page 178",
          "text": "If each of the 10 irredundant expressions is now evaluated by the cost criterion proposed in Sec. 4. 1 involving the total number of gate inputs. then the minimal sums are obtained since a minimal expression is irredundant.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Containing no redundant constraint."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "redundant",
          "redundant"
        ],
        [
          "constraint",
          "constraint"
        ]
      ],
      "raw_glosses": [
        "(mathematics) Containing no redundant constraint."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "/ˌɪɹ.ɪˈdʌn.dənt/"
    }
  ],
  "word": "irredundant"
}