English
Related papers

Related papers: Hardness of embedding simplicial complexes in $\R^…

200 papers

Given a simplicial complex $K$, we consider several notions of geometric complexity of embeddings of $K$ in a Euclidean space ${\mathbb R}^d$: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL…

Metric Geometry · Mathematics 2014-09-30 Michael Freedman , Vyacheslav Krushkal

A map $f\colon K\to \mathbb R^d$ of a simplicial complex is an almost embedding if $f(\sigma)\cap f(\tau)=\emptyset$ whenever $\sigma,\tau$ are disjoint simplices of $K$. Theorem. Fix integers $d,k\ge2$ such that $d=\frac{3k}2+1$. (a)…

Geometric Topology · Mathematics 2020-10-27 Arkadiy Skopenkov , Martin Tancer

A map $f: K \to \mathbb{R}^d$ of a simplicial complex is an almost embedding if $f(\sigma) \cap f(\tau) = \varnothing$ whenever $\sigma, \tau$ are disjoint simplices of $K$. Fix integers $d,k \geqslant 2$ such that $k+2 \leqslant d…

Geometric Topology · Mathematics 2022-06-28 Emil Alkin

Motivated by Tverberg-type problems in topological combinatorics and by classical results about embeddings (maps without double points), we study the question whether a finite simplicial complex K can be mapped into R^d without…

Geometric Topology · Mathematics 2016-10-19 Isaac Mabillard , Uli Wagner

We show that the decision problem of determining whether a given (abstract simplicial) $k$-complex has a geometric embedding in $\mathbb R^d$ is complete for the Existential Theory of the Reals for all $d\geq 3$ and $k\in\{d-1,d\}$. This…

Computational Complexity · Computer Science 2021-11-08 Mikkel Abrahamsen , Linda Kleist , Tillmann Miltzow

We relate the embeddability of the simplicial complex $[3]*K$ into $\mathbb{R}^{n+2}$ to that of $K$ into $\mathbb{R}^n$. In brief, the embeddability of $K$ into $\mathbb{R}^n$, in the metastable range $2n\geq 3(d+1)$, is equivalent to the…

Geometric Topology · Mathematics 2020-07-08 Salman Parsa

We consider the problem of computing the smallest possible distortion for embedding of a given n-point metric space into R^d, where d is fixed (and small). For d=1, it was known that approximating the minimum distortion with a factor better…

Computational Geometry · Computer Science 2009-09-29 Jiri Matousek , Anastasios Sidiropoulos

A general position map $f:K\to M$ of a $k$-dimensional simplicial complex to a $2k$-dimensional manifold (for $k=1$, of a graph to a surface) is a $\mathbb Z_2$-embedding if $|f\sigma \cap f\tau|$ is even for any non-adjacent $k$-faces…

Geometric Topology · Mathematics 2026-02-27 A. Skopenkov , O. Styrt

This thesis addresses the question of the maximal number of $d$-simplices for a simplicial complex which is embeddable into $\mathbb{R}^r$ for some $d \leq r \leq 2d$. A lower bound of $f_d(C_{r + 1}(n)) =…

Combinatorics · Mathematics 2018-12-21 Anna Gundert

We present a short and clear proof of the following particular case of a 2006 result of Melikhov-Schepin: Let $K$ be a $k$-dimensional simplicial complex and $K*[3]$ the union of three cones over $K$ along their common bases. If $2d\ge3k+3$…

Geometric Topology · Mathematics 2026-01-08 S. Parsa , A. Skopenkov

A graph $G$ is embeddable in $\mathbb{R}^d$ if vertices of $G$ can be assigned with points of $\mathbb{R}^d$ in such a way that all pairs of adjacent vertices are at the distance 1. We show that verifying embeddability of a given graph in…

Computational Complexity · Computer Science 2014-10-22 Mikhail Tikhomirov

We consider several ways to measure the `geometric complexity' of an embedding from a simplicial complex into Euclidean space. One of these is a version of `thickness', based on a paper of Kolmogorov and Barzdin. We prove inequalities…

Geometric Topology · Mathematics 2019-12-19 Misha Gromov , Larry Guth

We prove that the problem of deciding whether a 2- or 3-dimensional simplicial complex embeds into $\mathbb{R}^3$ is NP-hard. Our construction also shows that deciding whether a 3-manifold with boundary tori admits an $\mathbb{S}^{3}$…

Geometric Topology · Mathematics 2018-08-23 Arnaud de Mesmay , Yo'av Rieck , Eric Sedgwick , Martin Tancer

A fundamental question for simplicial complexes is to find the lowest dimensional Euclidean space in which they can be embedded. We investigate this question for order complexes of posets. We show that order complexes of thick geometric…

Combinatorics · Mathematics 2012-11-13 Martin Tancer , Kathrin Vorwerk

By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…

Combinatorics · Mathematics 2021-10-26 Evangelos Bartzos , Ioannis Z. Emiris , Raimundas Vidunas

We study conditions under which a finite simplicial complex $K$ can be mapped to $\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding is a map $f: K\to \mathbb R^d$ such that the images of any $r$ pairwise…

Geometric Topology · Mathematics 2022-04-12 S. Avvakumov , I. Mabillard , A. Skopenkov , U. Wagner

A clear understanding of topology of higher-dimensional objects is important in many branches of both pure and applied mathematics. In this survey we attempt to present some results of higher-dimensional topology in a way which makes clear…

Geometric Topology · Mathematics 2008-12-06 A. Skopenkov

We consider $d$-dimensional simplicial complexes which can be PL embedded in the $2d$-dimensional euclidean space. In short, we show that in any such complex, for any three vertices, the intersection of the link-complexes of the vertices is…

Computational Geometry · Computer Science 2020-01-28 Salman Parsa

We introduce the notion of coupled embeddability, defined for maps on products of topological spaces. We use known results for nonsingular biskew and bilinear maps to generate simple examples and nonexamples of coupled embeddings. We study…

Geometric Topology · Mathematics 2021-07-22 Florian Frick , Michael Harrison

We develop a general toolbox to study $W^{1,p}$ solutions of differential inclusions $\nabla u \in K$ for unbounded sets $K$. A key notion is the concept that a subset $K$ of the space $\mathbb{R}^{d \times m}$ of $d \times m$ matrices can…

Analysis of PDEs · Mathematics 2024-04-01 Bruce Kleiner , Stefan Müller , László Székelyhidi , Xiangdong Xie
‹ Prev 1 2 3 10 Next ›