Dehn complex
E265417
The Dehn complex is a topological construction introduced by Max Dehn in the study of group presentations and decision problems, encoding relations of a group as a 2-dimensional cell complex.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Dehn complex canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T2416885 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Dehn complex Context triple: [Max Dehn, notableConcept, Dehn complex]
-
A.
Poincaré duality
Poincaré duality is a fundamental theorem in algebraic topology that relates the homology and cohomology groups of an oriented closed manifold in complementary dimensions.
-
B.
Alexandrov–Čech cohomology
Alexandrov–Čech cohomology is a topological cohomology theory that computes invariants of spaces using inverse limits over open covers, closely related to and often coinciding with sheaf cohomology.
-
C.
geometrization conjecture
The geometrization conjecture is a fundamental statement in 3-dimensional topology that classifies all closed 3-manifolds into pieces each admitting one of eight canonical geometric structures, a result proven by Grigori Perelman.
-
D.
Poincaré conjecture
The Poincaré conjecture is a landmark problem in topology that characterizes the three-dimensional sphere among three-dimensional manifolds and was famously solved by Grigori Perelman in the early 2000s.
-
E.
Euler’s polyhedron formula
Euler’s polyhedron formula is a fundamental result in topology and geometry that relates the numbers of vertices, edges, and faces of a convex polyhedron through the equation V − E + F = 2.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Dehn complex Target entity description: The Dehn complex is a topological construction introduced by Max Dehn in the study of group presentations and decision problems, encoding relations of a group as a 2-dimensional cell complex.
-
A.
Poincaré duality
Poincaré duality is a fundamental theorem in algebraic topology that relates the homology and cohomology groups of an oriented closed manifold in complementary dimensions.
-
B.
Alexandrov–Čech cohomology
Alexandrov–Čech cohomology is a topological cohomology theory that computes invariants of spaces using inverse limits over open covers, closely related to and often coinciding with sheaf cohomology.
-
C.
geometrization conjecture
The geometrization conjecture is a fundamental statement in 3-dimensional topology that classifies all closed 3-manifolds into pieces each admitting one of eight canonical geometric structures, a result proven by Grigori Perelman.
-
D.
Poincaré conjecture
The Poincaré conjecture is a landmark problem in topology that characterizes the three-dimensional sphere among three-dimensional manifolds and was famously solved by Grigori Perelman in the early 2000s.
-
E.
Euler’s polyhedron formula
Euler’s polyhedron formula is a fundamental result in topology and geometry that relates the numbers of vertices, edges, and faces of a convex polyhedron through the equation V − E + F = 2.
- F. None of above. chosen
Statements (31)
| Predicate | Object |
|---|---|
| instanceOf |
2-dimensional cell complex
ⓘ
mathematical object ⓘ topological construction ⓘ |
| constructedFrom |
generators of a group
ⓘ
group presentation ⓘ relators of a group ⓘ |
| context | combinatorial description of groups ⓘ |
| encodes | relations of a group ⓘ |
| field |
combinatorial group theory
ⓘ
geometric group theory ⓘ topology ⓘ |
| hasAspect | topological encoding of algebraic data ⓘ |
| hasCellType |
0-cell
ⓘ
1-cell ⓘ 2-cell ⓘ |
| hasDimension | 2 ⓘ |
| hasProperty | 2-dimensional CW-complex ⓘ |
| historicalPeriod | early 20th century ⓘ |
| introducedBy | Max Dehn ⓘ |
| language | mathematics ⓘ |
| namedAfter | Max Dehn ⓘ |
| purpose | encode the relations of a group as a cell complex ⓘ |
| relatedTo |
Cayley complex
ⓘ
Cayley graph ⓘ Dehn algorithm ⓘ
surface form:
Dehn’s algorithm
van Kampen diagram ⓘ word problem for groups ⓘ |
| usedFor |
analyzing the word problem
ⓘ
studying isoperimetric inequalities in groups ⓘ |
| usedIn |
study of decision problems in group theory
ⓘ
study of group presentations ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Dehn complex Description of subject: The Dehn complex is a topological construction introduced by Max Dehn in the study of group presentations and decision problems, encoding relations of a group as a 2-dimensional cell complex.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.