中文
相关论文

相关论文: Eine Bemerkung zu einigen $2$-dimensionalen Komple…

200 篇论文

We give examples of finite, simplicial $2$-complexes that do not PL embed in $\mathbb{R}^4$ and exhibit, for each such complex, a family of PL immersions into $\mathbb{R}^4$ that hide the obstruction to embedding in "higher and higher order…

几何拓扑 · 数学 2021-08-04 Grigori Avramidi , T. Tam Nguyen Phan

The vanishing of Van Kampen's obstruction is known to be necessary and sufficient for embeddability of a simplicial n-complex into $R^{2n}$ for $n\neq 2$, and it was recently shown to be incomplete for $n=2$. We use algebraic-topological…

几何拓扑 · 数学 2007-05-23 Vyacheslav S. Krushkal

We produce an infinite family of $2$-complexes that are intrinsically linked when embedded into four dimensions. In particular, we show that any embedding into $\mathbb{R}^4$ of the suspension of a graph containing $K_6$ as a minor contains…

We study the potentially undecidable problem of whether a given 2-dimensional CW complex can be embedded into $\mathbb{R}^4$. We provide operations that preserve embeddability, including joining and cloning of 2-cells, as well as…

组合数学 · 数学 2024-08-26 Agelos Georgakopoulos , Martin Winter

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)…

几何拓扑 · 数学 2020-10-27 Arkadiy Skopenkov , Martin Tancer

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…

度量几何 · 数学 2014-09-30 Michael Freedman , Vyacheslav Krushkal

We study smooth, proper embeddings of noncompact surfaces in 4-manifolds, focusing on exotic planes and annuli, i.e., embeddings pairwise homeomorphic to the standard embeddings of R^2 and R^2-int D^2 in R^4. We encounter two uncountable…

几何拓扑 · 数学 2025-01-08 Robert E. Gompf

(1) We show that if a presentation of the trivial group is "hard to trivialize", in the sense that lots of Tietze moves are necessary to transform it into the trivial presentation, then the associated presentation complex (which is a…

度量几何 · 数学 2020-08-06 Karim A. Adiprasito , Bruno Benedetti

We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…

几何拓扑 · 数学 2017-03-06 Anders Björner , Afshin Goodarzi

We offer the following explanation of the statement of the Kuratowski graph planarity criterion and of 6/7 of the statement of the Robertson-Seymour-Thomas intrinsic linking criterion. Let us call a cell complex 'dichotomial' if to every…

几何拓扑 · 数学 2011-05-18 Sergey A. Melikhov

We provide a simple characterization of simplicial complexes on few vertices that embed into the $d$-sphere. Namely, a simplicial complex on $d+3$ vertices embeds into the $d$-sphere if and only if its non-faces do not form an intersecting…

组合数学 · 数学 2023-11-10 Florian Frick , Mirabel Hu , Verity Scheel , Steven Simon

In this note, we investigate the relation between double points and complex points of immersed surfaces in almost-complex 4-manifolds and show how estimates for the minimal genus of embedded surfaces lead to inequalities between the number…

几何拓扑 · 数学 2007-05-23 Christian Bohr

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…

几何拓扑 · 数学 2022-04-12 S. Avvakumov , I. Mabillard , A. Skopenkov , U. Wagner

We characterise the embeddability of simply connected locally 3-connected 2-dimensional simplicial complexes in 3-space in a way analogous to Kuratowski's characterisation of graph planarity, by excluded minors. This answers questions of…

组合数学 · 数学 2019-09-05 Johannes Carmesin

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…

计算几何 · 计算机科学 2020-01-28 Salman Parsa

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)) =…

组合数学 · 数学 2018-12-21 Anna Gundert

A map $\varphi:K\to R^2$ of a graph $K$ is approximable by embeddings, if for each $\varepsilon>0$ there is an $\varepsilon$-close to $\varphi$ embedding $f:K\to R^2$. Analogous notions were studied in computer science under the names of…

几何拓扑 · 数学 2018-10-02 Arkadiy Skopenkov

We review a cochain-free treatment of the classical van Kampen obstruction \theta to embeddability of an n-polyhedron into R^{2n} and consider several analogues and generalizations of \theta, including an extraordinary lift of \theta which…

几何拓扑 · 数学 2021-06-15 Sergey A. Melikhov

This paper is the last paper in a series of five papers. Building on earlier papers in this series, we prove an analogue of Kuratowski's characterisation of graph planarity for three dimensions. More precisely, a simply connected…

组合数学 · 数学 2019-09-05 Johannes Carmesin

The space $SL(2,\mathbb{R})\times SL(2,\mathbb{R})$ admits a natural homogeneous pseudo-Riemannian nearly Kaehler structure. We investigate almost complex surfaces in this space. In particular we obtain a complete classification of the…

微分几何 · 数学 2020-06-23 Elsa Ghandour , Luc Vrancken
‹ 上一页 1 2 3 10 下一页 ›