See combinatorial geometry in All languages combined, or Wiktionary
{
"etymology_text": "From circa 1955.",
"forms": [
{
"form": "combinatorial geometries",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~"
},
"expansion": "combinatorial geometry (countable and uncountable, plural combinatorial geometries)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"_dis1": "52 48",
"word": "combinatorial topology"
}
],
"senses": [
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Geometry",
"orig": "en:Geometry",
"parents": [
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"examples": [
{
"ref": "2003, Lukas Finschi, Komei Fukuda, “Combinatorial Generation of Small Point Configurations and Hyperplane Arrangements”, in Boris Aronov, Saugata Basu, Janos Pach, Micha Sharir, editors, Discrete and Computational Geometry, Springer,, page 425:",
"text": "The generation of combinatorial types of point configurations and hyperplane arrangements point configurations and hyperplane arrangements has long been an outstanding problem of combinatorial geometry.",
"type": "quote"
},
{
"ref": "2006, Peter Brass, William O. J. Moser, János Pach, Research Problems in Discrete Geometry, Springer, page 183:",
"text": "The following problem of Erdős [Er46] is possibly the best known (and simplest to explain) problem in combinatorial geometry. How often can the same distance occur among n points in the plane?",
"type": "quote"
},
{
"text": "2012, Mohammed Mostefa Mesmmoudi, et al., Discrete Curvature Estimation Methods for Triangulated Surfaces, Ullrich Köthe, Annick Montanvert, Pierre Soille (editors), Applications of Discrete Geometry and Mathematical Morphology, Springer, LNCS 7346, page 28,\nIn combinatorial geometry, the most common discrete representation for a surface is a triangle mesh."
}
],
"glosses": [
"The field of mathematics which examines extremal problems of a combinatorial nature expressed geometrically."
],
"id": "en-combinatorial_geometry-en-noun-zzf6nuG3",
"links": [
[
"geometry",
"geometry"
]
],
"raw_glosses": [
"(geometry, uncountable) The field of mathematics which examines extremal problems of a combinatorial nature expressed geometrically."
],
"tags": [
"uncountable"
],
"topics": [
"geometry",
"mathematics",
"sciences"
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Geometry",
"orig": "en:Geometry",
"parents": [
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "33 67",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "16 84",
"kind": "other",
"name": "Entries with translation boxes",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "24 76",
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "25 75",
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w+disamb"
}
],
"examples": [
{
"ref": "2003, Lukas Finschi, Komei Fukuda, “Combinatorial Generation of Small Point Configurations and Hyperplane Arrangements”, in Boris Aronov, Saugata Basu, Janos Pach, Micha Sharir, editors, Discrete and Computational Geometry, Springer, page 425:",
"text": "For the generation of these combinatorial types no direct method is known, and it appears to be necessary to use combinatorial abstractions — allowable sequences of permutations, #x5C;lambda-functions, chirotopes, combinatorial geometries, or oriented matroids; in our work we will use oriented matroids [BLVS⁺99].",
"type": "quote"
},
{
"ref": "2012, Don Row, Talmage James Reid, Geometry, Perspective Drawing, and Mechanisms, World Scientific, page 15:",
"text": "Our purpose in this chapter is to derive fundamental properties of combinatorial geometries, and to show how these properties strengthen our intuitive understandings of figures.[…]In this section, we give an axiom system for combinatorial geometries and then prove that each combinatorial figure is a combinatorial geometry.",
"type": "quote"
}
],
"glosses": [
"A simple matroid."
],
"id": "en-combinatorial_geometry-en-noun-0P3-tcsf",
"links": [
[
"geometry",
"geometry"
],
[
"matroid",
"matroid"
],
[
"simple matroid",
"simple matroid"
]
],
"qualifier": "theory of matroids",
"raw_glosses": [
"(geometry, theory of matroids, countable) A simple matroid."
],
"tags": [
"countable"
],
"topics": [
"geometry",
"mathematics",
"sciences"
]
}
],
"wikipedia": [
"Discrete geometry"
],
"word": "combinatorial geometry"
}
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"English uncountable nouns",
"Entries with translation boxes",
"Pages with 1 entry",
"Pages with entries"
],
"etymology_text": "From circa 1955.",
"forms": [
{
"form": "combinatorial geometries",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~"
},
"expansion": "combinatorial geometry (countable and uncountable, plural combinatorial geometries)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"word": "combinatorial topology"
}
],
"senses": [
{
"categories": [
"English terms with quotations",
"English uncountable nouns",
"en:Geometry"
],
"examples": [
{
"ref": "2003, Lukas Finschi, Komei Fukuda, “Combinatorial Generation of Small Point Configurations and Hyperplane Arrangements”, in Boris Aronov, Saugata Basu, Janos Pach, Micha Sharir, editors, Discrete and Computational Geometry, Springer,, page 425:",
"text": "The generation of combinatorial types of point configurations and hyperplane arrangements point configurations and hyperplane arrangements has long been an outstanding problem of combinatorial geometry.",
"type": "quote"
},
{
"ref": "2006, Peter Brass, William O. J. Moser, János Pach, Research Problems in Discrete Geometry, Springer, page 183:",
"text": "The following problem of Erdős [Er46] is possibly the best known (and simplest to explain) problem in combinatorial geometry. How often can the same distance occur among n points in the plane?",
"type": "quote"
},
{
"text": "2012, Mohammed Mostefa Mesmmoudi, et al., Discrete Curvature Estimation Methods for Triangulated Surfaces, Ullrich Köthe, Annick Montanvert, Pierre Soille (editors), Applications of Discrete Geometry and Mathematical Morphology, Springer, LNCS 7346, page 28,\nIn combinatorial geometry, the most common discrete representation for a surface is a triangle mesh."
}
],
"glosses": [
"The field of mathematics which examines extremal problems of a combinatorial nature expressed geometrically."
],
"links": [
[
"geometry",
"geometry"
]
],
"raw_glosses": [
"(geometry, uncountable) The field of mathematics which examines extremal problems of a combinatorial nature expressed geometrically."
],
"tags": [
"uncountable"
],
"topics": [
"geometry",
"mathematics",
"sciences"
]
},
{
"categories": [
"English countable nouns",
"English terms with quotations",
"en:Geometry"
],
"examples": [
{
"ref": "2003, Lukas Finschi, Komei Fukuda, “Combinatorial Generation of Small Point Configurations and Hyperplane Arrangements”, in Boris Aronov, Saugata Basu, Janos Pach, Micha Sharir, editors, Discrete and Computational Geometry, Springer, page 425:",
"text": "For the generation of these combinatorial types no direct method is known, and it appears to be necessary to use combinatorial abstractions — allowable sequences of permutations, #x5C;lambda-functions, chirotopes, combinatorial geometries, or oriented matroids; in our work we will use oriented matroids [BLVS⁺99].",
"type": "quote"
},
{
"ref": "2012, Don Row, Talmage James Reid, Geometry, Perspective Drawing, and Mechanisms, World Scientific, page 15:",
"text": "Our purpose in this chapter is to derive fundamental properties of combinatorial geometries, and to show how these properties strengthen our intuitive understandings of figures.[…]In this section, we give an axiom system for combinatorial geometries and then prove that each combinatorial figure is a combinatorial geometry.",
"type": "quote"
}
],
"glosses": [
"A simple matroid."
],
"links": [
[
"geometry",
"geometry"
],
[
"matroid",
"matroid"
],
[
"simple matroid",
"simple matroid"
]
],
"qualifier": "theory of matroids",
"raw_glosses": [
"(geometry, theory of matroids, countable) A simple matroid."
],
"tags": [
"countable"
],
"topics": [
"geometry",
"mathematics",
"sciences"
]
}
],
"wikipedia": [
"Discrete geometry"
],
"word": "combinatorial geometry"
}
Download raw JSONL data for combinatorial geometry meaning in English (3.8kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). 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.