See exact cover on Wiktionary
{
"forms": [
{
"form": "exact covers",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "exact cover (plural exact covers)",
"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": "Entries with translation boxes",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with German translations",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Combinatorics",
"orig": "en:Combinatorics",
"parents": [
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Topology",
"orig": "en:Topology",
"parents": [
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"examples": [
{
"ref": "2000, R. Tijdeman, “Exact covers of balanced sequences and Fraenkel's conjecture”, in F. Halter-Koch, Robert F. Tichy, editors, Algebraic Number Theory and Diophantine Analysis: Proceedings of the International Conference, Walter de Gruyter, page 468:",
"text": "A finite set #92;#123;S(#92;alpha#95;i,#92;beta#95;i)#92;vert 1#92;lei#92;lem#92;#125; is called an (eventual) exact cover if every (sufficiently large) positive integer occurs in exactly one S(#92;alpha#95;i,#92;beta#95;i). If #92;#123;S(#92;alpha#95;i,#92;beta#95;i)#92;#125;#95;#123;i#61;1#125;ᵐ is an eventual exact cover, then #92;textstyle#92;sum#95;#123;i#61;1#125;ᵐ#123;#92;alpha#95;i#123;-1",
"type": "quote"
},
{
"text": "2011, R. Lu, S. Liu, J. Zhang, Searching for Doubly Self-orthogonal Latin Squares, Jimmy Lee (editor), Principles and Practice of Constraint Programming: 17th International Conference CP 2011, Proceedings, Springer, LNCS 6876, page 542,\nIt is straightforward to use clique algorithms to construct a (partial) solution of a given combinatorial problem which is represented as a set system. If the solution of the combinatorial problem corresponds to the exact cover of the set system, a substantially more efficient algorithm can be utilized because of this property."
}
],
"glosses": [
"Given a collection S of subsets of a set X, a subcollection S^* of S such that each element of X is contained in exactly one subset in S^*."
],
"id": "en-exact_cover-en-noun-yGCC098u",
"links": [
[
"topology",
"topology"
],
[
"combinatorics",
"combinatorics"
],
[
"collection",
"collection"
],
[
"subset",
"subset"
],
[
"set",
"set"
],
[
"subcollection",
"subcollection"
],
[
"element",
"element"
]
],
"raw_glosses": [
"(topology, combinatorics) Given a collection S of subsets of a set X, a subcollection S^* of S such that each element of X is contained in exactly one subset in S^*."
],
"related": [
{
"topics": [
"geometry",
"mathematics",
"sciences"
],
"word": "tiling"
}
],
"topics": [
"combinatorics",
"mathematics",
"sciences",
"topology"
],
"translations": [
{
"code": "de",
"lang": "German",
"sense": "Collection of subsets such that each element of the original set is contained in exactly one subset",
"tags": [
"feminine"
],
"word": "exakte Überdeckung"
}
],
"wikipedia": [
"exact cover"
]
}
],
"word": "exact cover"
}
{
"forms": [
{
"form": "exact covers",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "exact cover (plural exact covers)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"topics": [
"geometry",
"mathematics",
"sciences"
],
"word": "tiling"
}
],
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"English terms with quotations",
"Entries with translation boxes",
"Pages with 1 entry",
"Pages with entries",
"Terms with German translations",
"en:Combinatorics",
"en:Topology"
],
"examples": [
{
"ref": "2000, R. Tijdeman, “Exact covers of balanced sequences and Fraenkel's conjecture”, in F. Halter-Koch, Robert F. Tichy, editors, Algebraic Number Theory and Diophantine Analysis: Proceedings of the International Conference, Walter de Gruyter, page 468:",
"text": "A finite set #92;#123;S(#92;alpha#95;i,#92;beta#95;i)#92;vert 1#92;lei#92;lem#92;#125; is called an (eventual) exact cover if every (sufficiently large) positive integer occurs in exactly one S(#92;alpha#95;i,#92;beta#95;i). If #92;#123;S(#92;alpha#95;i,#92;beta#95;i)#92;#125;#95;#123;i#61;1#125;ᵐ is an eventual exact cover, then #92;textstyle#92;sum#95;#123;i#61;1#125;ᵐ#123;#92;alpha#95;i#123;-1",
"type": "quote"
},
{
"text": "2011, R. Lu, S. Liu, J. Zhang, Searching for Doubly Self-orthogonal Latin Squares, Jimmy Lee (editor), Principles and Practice of Constraint Programming: 17th International Conference CP 2011, Proceedings, Springer, LNCS 6876, page 542,\nIt is straightforward to use clique algorithms to construct a (partial) solution of a given combinatorial problem which is represented as a set system. If the solution of the combinatorial problem corresponds to the exact cover of the set system, a substantially more efficient algorithm can be utilized because of this property."
}
],
"glosses": [
"Given a collection S of subsets of a set X, a subcollection S^* of S such that each element of X is contained in exactly one subset in S^*."
],
"links": [
[
"topology",
"topology"
],
[
"combinatorics",
"combinatorics"
],
[
"collection",
"collection"
],
[
"subset",
"subset"
],
[
"set",
"set"
],
[
"subcollection",
"subcollection"
],
[
"element",
"element"
]
],
"raw_glosses": [
"(topology, combinatorics) Given a collection S of subsets of a set X, a subcollection S^* of S such that each element of X is contained in exactly one subset in S^*."
],
"topics": [
"combinatorics",
"mathematics",
"sciences",
"topology"
],
"wikipedia": [
"exact cover"
]
}
],
"translations": [
{
"code": "de",
"lang": "German",
"sense": "Collection of subsets such that each element of the original set is contained in exactly one subset",
"tags": [
"feminine"
],
"word": "exakte Überdeckung"
}
],
"word": "exact cover"
}
Download raw JSONL data for exact cover meaning in All languages combined (2.8kB)
{
"called_from": "parser/304",
"msg": "HTML tag <math> not properly closed",
"path": [
"exact cover"
],
"section": "English",
"subsection": "noun",
"title": "exact cover",
"trace": "started on line 1, detected on line 1"
}
{
"called_from": "page/1412",
"msg": "gloss may contain unhandled list items: Given a collection S of subsets of a set X, a subcollection S^* of S such that each element of X is contained in exactly one subset in S^*.",
"path": [
"exact cover"
],
"section": "English",
"subsection": "noun",
"title": "exact cover",
"trace": ""
}
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-01-10 from the enwiktionary dump dated 2025-01-01 using wiktextract (df33d17 and 4ed51a5). 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.