English
Related papers

Related papers: Embedding simply connected 2-complexes in 3-space

200 papers

We will describe some results regarding the algorithmic nature of homeomorphism problems for manifolds; in particular, the following theorem. Theorem 1: Every PL or smooth simply connected manifold M^n of dimension n at least 5 can be…

Geometric Topology · Mathematics 2016-09-07 Alexander Nabutovsky , Shmuel Weinberger

We quantify the topological expansion properties of bounded degree simplicial complexes in terms of a family of sublinear functions, in analogy with the separation profile of Benjamini-Schramm-Tim\'ar for classical expansion of bounded…

Metric Geometry · Mathematics 2024-11-21 David Hume

A simplicial polytope is a polytope with all its facets being combinatorially equivalent to simplices. We deal with the edge connectivity of the graphs of simplicial polytopes. We first establish that, for any $d\ge 3$, for any $d\ge 3$,…

Combinatorics · Mathematics 2023-03-07 Guillermo Pineda-Villavicencio , Julien Ugon

In the present note we study combinatorial and algebraic properties of cubic-line arrangements in the complex projective plane admitting nodes, ordinary triple and $A_{5}$ singular points. We deliver a Hirzebruch-type inequality for such…

Algebraic Geometry · Mathematics 2024-03-27 Przemysław Talar

We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…

Combinatorics · Mathematics 2020-09-21 Matthew Kahle , Elliot Paquette , Érika Roldán

We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. Theorem. Let S be a triangulation of a circle with s…

Geometric Topology · Mathematics 2019-07-16 Mikhail Skopenkov

Ehrenborg, Govindaiah, Park, and Readdy recently introduced the van der Waerden complex, a pure simplicial complex whose facets correspond to arithmetic progressions. Using techniques from combinatorial commutative algebra, we classify when…

Combinatorics · Mathematics 2017-07-25 Becky Hooper , Adam Van Tuyl

Although the strong embedding of a 3-connected planar graph $G$ on the sphere is unique, $G$ can have different inequivalent strong embeddings on a surface of positive genus. If $G$ is cubic, then the strong embeddings of $G$ on the…

Combinatorics · Mathematics 2025-09-19 Meike Weiß , Reymond Akpanya , Alice C. Niemeyer

We consider 2-dimensional random simplicial complexes $Y$ in the multi-parameter model. We establish the multi-parameter threshold for the property that every 2-dimensional simplicial complex $S$ admits a topological embedding into $Y$…

Geometric Topology · Mathematics 2020-01-08 Michael Farber , Tahl Nowik

A parallel minor is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer k, every internally 4-connected graph of sufficiently high order contains a parallel minor…

Combinatorics · Mathematics 2008-02-12 Carolyn Chun , Guoli Ding , Bogdan Oporowski , Dirk Vertigan

Associated to any Coxeter system $(W,S)$, there is a labeled simplicial complex $L$ and a contractible CW-complex $\Sigma_L$ (the Davis complex) on which $W$ acts properly and cocompactly. $\Sigma_L$ admits a cellulation under which the…

Group Theory · Mathematics 2008-10-28 Timothy A. Schroeder

The Reidemeister theorem states that any link in $3$-space can be encoded by a diagram (a suitably decorated projection) on a plane, and provides a finite set of combinatorial moves relating two diagrams of the same link up to isotopy. In…

Geometric Topology · Mathematics 2025-06-18 Carlo Petronio

We exhibit several families of planar graphs that are minor-minimal intrinsically spherical $3$-linked. A graph is intrinsically spherical 3-linked if it is planar graph that has, in every spherical embedding, a non-split 3-link consisting…

Combinatorics · Mathematics 2021-07-20 Madeleine Burkhart , Andrew Castillo , Jonathan Doane , Joel Foisy , Cristopher Negron

Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…

Combinatorics · Mathematics 2020-03-05 Michael Cuntz , Paul Mücksch

We prove two results on the classification of trivial Legendrian embeddings $g: G \rightarrow (S^3,\xi_{std})$ of planar graphs. First, the oriented Legendrian ribbon $R_g$ and rotation invariant $\text{rot}_g$ are a complete set of…

Geometric Topology · Mathematics 2016-04-05 Peter Lambert-Cole , Danielle O'Donnol

In this paper, we investigate a family of graphs associated to collections of arcs on surfaces. These {\it multiarc graphs} naturally interpolate between arc graphs and flip graphs, both well studied objects in low dimensional geometry and…

Geometric Topology · Mathematics 2019-03-01 Hugo Parlier , Ashley Weber

A step 2 branching decomposition of spaces of homogeneous Hermitian monogenic polynomials in C^n is established with explicit embedding factors in terms of the generalized Jacobi polynomials, which allows for an inductive construction of an…

Complex Variables · Mathematics 2013-05-17 F. Brackx , H. De Schepper , R. Lavicka , V. Soucek

It is known that any two triangulations of a compact 3-manifold are related by finite sequences of certain local transformations. We prove here an upper bound for the length of a shortest transformation sequence relating any two…

Geometric Topology · Mathematics 2007-05-23 Simon A. King

Recent work Bobienski-Nurowski on 5-dimensional Riemannian manifolds with an SO(3) structure prompts us to investigate which Lie groups admit such a geometry. The case in which the SO(3) structure admits a compatible connection with torsion…

Differential Geometry · Mathematics 2012-01-04 Anna Fino , Simon Chiossi

One measure of the complexity of a 3-manifold is its triangulation complexity: the minimal number of tetrahedra in a triangulation of it. A natural question is whether we can relate this quantity to its topology. We determine the…

Geometric Topology · Mathematics 2023-01-06 Adele Jackson
‹ Prev 1 8 9 10 Next ›