Geometric complexity of embeddings in \(\mathbb R^d\)
From MaRDI portal
Publication:2362643
DOI10.1007/s00039-014-0272-9zbMath1366.57013arXiv1311.2667OpenAlexW2112320808MaRDI QIDQ2362643
Vyacheslav S. Krushkal, Michael Hartley Freedman
Publication date: 11 July 2017
Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.2667
Simplicial sets and complexes in algebraic topology (55U10) Embeddings and immersions in PL-topology (57Q35) Regular neighborhoods in PL-topology (57Q40)
Related Items (5)
Functional mixed effects wavelet estimation for spectra of replicated time series ⋮ Hardness of almost embedding simplicial complexes in \(\mathbb {R}^d\) ⋮ Ropelength, crossing number and finite-type invariants of links ⋮ Tree invariants and Milnor linking numbers with indeterminacy ⋮ Computing simplicial representatives of homotopy group elements
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hardness of embedding simplicial complexes in \(\mathbb R^d\)
- On the distortion of knots on embedded surfaces
- Obstructions to the imbedding of a complex in a euclidean space. I: The first obstruction
- The van Kampen obstruction and its relatives
- Filling Riemannian manifolds
- On Lipschitz embedding of finite metric spaces in Hilbert space
- Thickness of knots
- On the minimum ropelength of knots and links
- Generalizations of the Kolmogorov-Barzdin embedding estimates
- The geometry of graphs and some of its algorithmic applications
- Van Kampen's embedding obstruction is incomplete for 2-complexes in \(\mathbb{R}^ 4\)
- Homology and central series of groups
- Link groups
- Higher-dimensional linking integrals
- On the division of Euclidean n -space by topological ( n ─ 1)-spheres
- Expander graphs and their applications
- Non‐recursive functions, knots “with thick ropes,” and self‐clenching “thick” hyperspheres
This page was built for publication: Geometric complexity of embeddings in \(\mathbb R^d\)
