English
Related papers

Related papers: Linear embeddings of contractible and collapsible …

200 papers

A well-known theorem of Whitney states that a 3-connected planar graph admits an essentially unique embedding into the 2-sphere. We prove a 3-dimensional analogue: a simply-connected $2$-complex every link graph of which is 3-connected…

Combinatorics · Mathematics 2021-09-10 Agelos Georgakopoulos , Jaehoon Kim

We consider the geometric join of a family of subsets of the Euclidean space. This is a construction frequently used in the (colorful) Carath\'eodory and Tverberg theorems, and their relatives. We conjecture that when the family has at…

Metric Geometry · Mathematics 2015-10-02 Imre Barany , Andreas F. Holmsen , Roman Karasev

We prove that if G is a graph without 3-cycles and 4-cycles, then the discrete cubical homology of G is trivial in dimension d, for all d\ge 2. We also construct a sequence { G_d } of graphs such that this homology is non-trivial in…

Combinatorics · Mathematics 2020-05-18 Helene Barcelo , Curtis Greene , Abdul Salam Jarrah , Volkmar Welker

A good cover in R^d is a collection of open contractible sets in R^d such that the intersection of any subcollection is either contractible or empty. Motivated by an analogy with convex sets, intersection patterns of good covers were…

Computational Geometry · Computer Science 2016-06-03 Martin Tancer , Dmitry Tonkonog

Groups defined by presentations for which the components of the corresponding star graph are the incidence graphs of generalized polygons are of interest as they are small cancellation groups that - via results of Edjvet and Vdovina - are…

Group Theory · Mathematics 2021-05-14 Ihechukwu Chinyere , Gerald Williams

Simplicial surfaces describe the incidence relations between vertices, edges and faces of triangulated 2-dimensional manifolds in a purely combinatorial way. By considering only the incidences of edges and faces, simplicial surfaces are…

Combinatorics · Mathematics 2025-06-26 Meike Weiß , Alice C. Niemeyer

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

We construct several families of embeddings of braid groups into mapping class groups of orientable and non-orientable surfaces and prove that they induce the trivial map in stable homology in the orientable case, but not so in the…

Algebraic Topology · Mathematics 2012-04-20 Carl-Friedrich Bödigheimer , Ulrike Tillmann

A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…

Group Theory · Mathematics 2016-02-29 Cai Heng Li , Binzhou Xia

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

We prove that for any set $F$ of $n\ge 2$ pairwise disjoint open convex sets in $\mathbb{R}^3$, the connected components of the set of lines intersecting every member of $F$ are contractible. The same result holds for directed lines.

Metric Geometry · Mathematics 2024-09-06 Otfried Cheong , Xavier Goaoc , Andreas F. Holmsen

A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…

Metric Geometry · Mathematics 2013-10-08 D. Kitson , S. C. Power

We show that under suitable hypotheses, the second homotopy group of the coned-off space associated to a $C(9)$ cubical presentation is trivial, and use this to provide classifying spaces for proper actions for the fundamental groups of…

Group Theory · Mathematics 2023-10-31 Macarena Arenas

Let $A$ be a finite-dimensional algebra over an algebraically closed field. The problem of constructing indecomposable $A$-modules inductively from simple ones by means of exact sequences - called accessibility - is the starting point of…

Representation Theory · Mathematics 2014-01-07 Wolfgang Peternell

Trivial links are unique up to number of link components, but they can be hard to recognize from arbitrary diagrams. We define a new measure of the complexity of a link embedding, the crumple, and show how this may be used to measure…

Geometric Topology · Mathematics 2013-02-28 Chad Musick

Any smooth projective curve embeds into $\mathbb{P}^3$. More generally, any curve embeds into a rationally connected variety of dimension at least three. We prove conversely that if every curve embeds in a threefold $X$, then $X$ is…

Algebraic Geometry · Mathematics 2024-10-15 Sixuan Lou

We say a $d$-dimensional simplicial complex embeds into double dimension if it embeds into the Euclidean space of dimension $2d$. For instance, a graph is planar iff it embeds into double dimension. We study the conditions under which the…

Algebraic Topology · Mathematics 2022-03-18 Salman Parsa

Let $H$ be a closed normal subgroup of a compact Lie group $G$ such that $G/H$ is connected. This paper provides a necessary and sufficient condition for every complex representation of $H$ to be extendible to $G$, and also for every…

Representation Theory · Mathematics 2023-10-31 Jin-Hwan Cho , Min Kyu Kim , Dong Youp Suh

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…

Geometric Topology · Mathematics 2007-05-23 Vyacheslav S. Krushkal

Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…

Computational Complexity · Computer Science 2017-10-17 Mikhail Tikhomirov