A proof of the Gordon conjecture (Q1034089): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.aim.2009.07.004 / rank | |||
Property / cites work | |||
Property / cites work: Connected sums of unstabilized Heegaard splittings are unstabilized / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Separating incompressible surfaces and stabilizations of Heegaard splittings / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.AIM.2009.07.004 / rank | |||
Normal rank |
Latest revision as of 14:04, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A proof of the Gordon conjecture |
scientific article |
Statements
A proof of the Gordon conjecture (English)
0 references
10 November 2009
0 references
The paper under review presents a combinatorial proof of the Gordon Conjecture which claims that the sum of two Heegaard splittings is stabilized if and only if one of the two summands is stabilized. If one summand is stabilized, then the sum is clearly stabilized. \textit{C. McA. Gordon}, in Kirby's problem list [\textit{R. Kirby} (ed.), Geometric topology. 1993 Georgia international topology conference, August 2--13, 1993, Athens, GA, USA. Providence, RI: American Mathematical Society. AMS/IP Stud. Adv. Math. 2(pt.2), 35-473 (1997; Zbl 0888.57014)] conjectured that the opposite direction also holds. There should be a historical remark. In 2004, the first author of the present paper announced the proof of the conjecture. It was long and heavily combinatorial. The present paper arose from the second author's efforts to simplify and clarify the original ideas. On the other hand, \textit{D. Bachman} [Geom. Topol. 12, No. 4, 2327--2378 (2008; Zbl 1152.57020)] announced a proof of the conjecture. The first version needed an extra assumption, but a later version gives a full proof, which is also long and hard.
0 references
Gordon conjecture
0 references
Heegaard splitting
0 references
stabilized
0 references