Related papers: Linking of three triangles in 3-space
A $3$-$tangle$ $T$ is the disjoint union of $3$ properly embedded arcs in the unit 3-ball; it is called rational if there is a homeomorphism of pairs from $(B^3,T)$ to $(D^2\times I,\{x_1,x_2,x_3\}\times I)$. Two rational 3-tangles $T$ and…
In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…
A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex while remaining in the category of simplicial complexes and preserving the topology of the surface. A complete list of…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
We show that there are infinitely many triples of non-isotopic hyperbolic links in the lens space $L(4,1)$ such that the three lifts of each triple in $S^{3}$ are isotopic. They are obtained as the lifts of links in $S^{3} / Q_{8}$ by…
Given a combinatorial structure, a ``twin'' is a pair of disjoint substructures which are isomorphic (or look the same in some sense). In recent years, there have been many problems about finding large twins in various combinatorial…
A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…
There are four non-isomorphic configurations of triples that can form a triangle in a $3$-uniform hypergraph. Forbidding different combinations of these four configurations, fifteen extremal problems can be defined, several of which already…
We give a short proof of the contractibility of the space of geodesic triangulations with fixed combinatorial type of a convex polygon in the Euclidean plane. Moreover, for any $n>0$, we show that there exists a space of geodesic…
We study the problem of deciding if a given triple of permutations can be realized as geometric permutations of disjoint convex sets in $\mathbb{R}^3$. We show that this question, which is equivalent to deciding the emptiness of certain…
Three disjoint rays in euclidean 3-space form Borromean rays provided their union is knotted, but the union of any two components is unknotted. We construct infinitely many Borromean rays, uncountably many of which are pairwise…
A triangulation of a punctured or pinched surface is irreducible if no edge can be shrunk without producing multiple edges or changing the topological type of the surface. The finiteness of the set of (non-isomorphic) irreducible…
It is known that there exist hyperplane arrangements with same underlying matroid that admit non-homotopy equivalent complement manifolds. In this work we show that, in any rank, complex central hyperplane arrangements with up to 7…
We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…
A periodic tangle is a one-dimensional submanifold in $\mathbb{R}^3$ that has translational symmetry in one, two or three transverse directions. A periodic tangle can be seen as the universal cover of a link in the solid torus, the…
We construct a link in the $3$-space that is not isotopic to any PL link (non-ambiently). In fact, there exist uncountably many $I$-equivalence classes of links. The paper also includes some observations on Cochran's invariants $\beta_i$.
A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the surface. In this work we propose an algorithm that constructs the set of irreducible triangulations of any surface with…
A combinatorial presentation of closed orientable 3-manifolds as bi-tricolored links is given together with two versions of a calculus via moves to manipulate bi-tricolored links without changing the represented manifold. That is, we…
In this article we prove some theorems related to the triplets of triangles, homological two by two. These theorems will be used later to build triplets of triangles two by two tri-homological.
Any convex polytope whose combinatorial automorphism group has two orbits on the flags is isomorphic to one whose group of Euclidean symmetries has two orbits on the flags (equivalently, to one whose automorphism group and symmetry group…