Related papers: Trisected Rainbows and Braids
Let $G$ be a nontrivial connected graph with an edge-coloring $c:E(G)\rightarrow \{1,2,\ldots,q\},$ $q\in \mathbb{N}$, where adjacent edges may be colored the same. A tree $T$ in $G$ is a $rainbow tree$ if no two edges of $T$ receive the…
We study framed surfaces, which are a class of Euclidean minimal and hyperbolic CMC-1 surfaces that generalize immersed minimal surfaces in $\mathbb{R}^3$ and Bryant surfaces. For this class we prove a lower bound on the (unrestricted)…
We construct a Seifert surface for a given null-homologous transverse link in a contact manifold that is compatible with a planar open book decomposition, then obtain a formula of the self-linking number. It extends Bennequin's self-linking…
We present a technique for deriving lower bounds for incidences with hypersurfaces in ${\mathbb R}^d$ with $d\ge 4$. These bounds apply to a large variety of hypersurfaces, such as hyperplanes, hyperspheres, paraboloids, and hypersurfaces…
A triangulation of a polygon is a subdivision of it into triangles, using diagonals between its vertices. Two different triangulations of a polygon can be related by a sequence of flips: a flip replaces a diagonal by the unique other…
A rainbow colouring of a connected graph is a colouring of the edges of the graph, such that every pair of vertices is connected by at least one path in which no two edges are coloured the same. Such a colouring using minimum possible…
In this paper we show how to express RNA tertiary interactions via the concepts of tangled diagrams. Tangled diagrams allow to formulate RNA base triples and pseudoknot-interactions and to control the maximum number of mutually crossing…
We consider closed acylindrical surfaces in 3-manifolds and in knot and link complements, and show that the genus of these surfaces is bounded linearly by the number of tetrahedra in the triangulation of the manifold and by the number of…
In this paper, we develop new techniques for understanding surfaces in $\mathbb{CP}^2$ via bridge trisections. Trisections are a novel approach to smooth 4-manifold topology, introduced by Gay and Kirby, that provide an avenue to apply…
A bridge trisection of a smooth surface in $S^4$ is a decomposition analogous to a bridge splitting of a link in $S^3$. The Kirby-Thompson invariant of a bridge trisection measures its complexity in terms of distances between disc sets in…
We consider homologically essential simple closed curves on Seifert surfaces of genus one knots in $S^3$, and in particular those that are unknotted or slice in $S^3$. We completely characterize all such curves for most twist knots: they…
A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…
It is shown that given any link-manifold, there is an algorithm to decide if the manifold contains an embedded, essential planar surface; if it does, the algorithm will construct one. If a slope on the boundary of the link-manifold is…
This is a follow-up paper of arXiv:1805.00115, where rational curves in surfaces that satisfy general positioned point and cross-ratio conditions were enumerated. A suitable correspondence theorem provided in arXiv:1509.07453 allowed us to…
Two isomorphic graphs can have inequivalent spatial embeddings in 3-space. In this way, an isomorphism class of graphs contains many spatial graph types. A common way to measure the complexity of a spatial graph type is to count the minimum…
Kirby diagrams for smooth four-dimensional manifolds typically depict only the 1- and 2-handles, omitting the 3-handles. In this work, we undertake a study of 3-handle attachments and provide tools to explicitly include them in handle…
A tree $T$, in an edge-colored graph $G$, is called {\em a rainbow tree} if no two edges of $T$ are assigned the same color. A {\em $k$-rainbow coloring}of $G$ is an edge coloring of $G$ having the property that for every set $S$ of $k$…
The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. Using binary indexed tree data structure, we improve algorithms for calculating the size and the number of…
We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its…
A branched covering surface-knot is a surface-knot in the form of a branched covering over an oriented surface-knot $F$, where we include the case when the covering has no branch points. A branched covering surface-knot is presented by a…