2008
DOI: 10.2140/agt.2008.8.1223
|View full text |Cite
|
Sign up to set email alerts
|

All 2–dimensional links in 4–space live inside a universal 3–dimensional polyhedron

Abstract: All 2-dimensional links in 4-space live inside a universal 3-dimensional polyhedron CHERRY KEARTON VITALIY KURLINThe hexabasic book is the cone of the 1-dimensional skeleton of the union of two tetrahedra glued along a common face. The universal 3-dimensional polyhedron UP is the product of a segment and the hexabasic book. We show that any closed 2-dimensional surface in 4-space is isotopic to a surface in UP. The proof is based on a representation of surfaces in 4-space by marked graphs, links with double in… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
40
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 33 publications
(40 citation statements)
references
References 8 publications
0
40
0
Order By: Relevance
“…Extend our algorithm for drawing graphs in 3 pages to drawing 2-dimensional surfaces in a universal 3D polyhedron from (Kearton and Kurlin, 2008).…”
Section: Discussion and Problemsmentioning
confidence: 99%
See 1 more Smart Citation
“…Extend our algorithm for drawing graphs in 3 pages to drawing 2-dimensional surfaces in a universal 3D polyhedron from (Kearton and Kurlin, 2008).…”
Section: Discussion and Problemsmentioning
confidence: 99%
“…A stronger result in (Kearton and Kurlin, 2008) says that all isotopies between 3-page embeddings are realizable in a 3-dimensional polyhedron (a hexabasic book).…”
Section: Appendix: 3-page Semigroupsmentioning
confidence: 99%
“…[2]). It is known [4,7,8,14] that any surface-link L can be deformed into a surface-link L ′ , called a hyperbolic splitting of L, by an ambient isotopy of R 4 in such a way that the projection p : L ′ → R to the fourth coordinate satisfies the following:…”
Section: Marked Graph Diagramsmentioning
confidence: 99%
“…6. It is known that two admissible marked graph diagrams present equivalent surface-links if and only if they are related by a finite sequence of Yoshikawa moves [8,9,16].…”
Section: Marked Graph Diagramsmentioning
confidence: 99%
See 1 more Smart Citation