Related papers: Avoiding Intersections of Dragon Curves

In the mid eighties Goldman proved an embedded curve could be isotoped to not intersect a closed geodesic if and only if their Lie bracket (as defined in that work) vanished. Goldman asked for a topological proof and about extensions of the…

For an oriented surface $S$, the singular set of a fold map $f:S\rightarrow \mathbb{R}^2$ is a collection of smooth curves, also known as fold singularities. We construct a sharp lower bound on the number of self-intersections of such fold…

Let $G$ be a multigraph with $n$ vertices and $e>4n$ edges, drawn in the plane such that any two parallel edges form a simple closed curve with at least one vertex in its interior and at least one vertex in its exterior. Pach and T\'oth (A…

It remains unknown if every prismatoid has a nonoverlapping edge-unfolding, a special case of the long-unsolved "D\"urer's problem." Recently nested prismatoids have been settled [Rad24] by mixing (in some sense) the two natural unfoldings,…

We call a multigraph {\em non-homotopic} if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can…

The twisted torsion of a 3-manifold is well-known to be zero whenever the corresponding twisted Alexander module is non-torsion. Under mild extra assumptions we introduce a new twisted torsion invariant which is always non-zero. We show how…

We discuss sufficient conditions for a given curve to be covered by a maximal curve with the covering being unramified; it turns out that the given curve itself will be also maximal. We relate our main result to the question of whether or…

For a tetrahedron, suppose that all internal angles of faces and all dihedral angles are less than a fixed constant $C$ that is smaller than $\pi$. Then, it is said to satisfy the maximum angle condition with the constant $C$. The maximum…

We give bounds on the number of non-simple closed curves on a negatively curved surface, given upper bounds on both length and self-intersection number. In particular, it was previously known that the number of all closed curves of length…

We calculate the intersection ring of three-dimensional graph manifolds with rational coefficients and give an algebraic characterization of these rings when the manifold's underlying graph is a tree. We are able to use this…

A well-known conjecture of Tuza asserts that if a graph has at most $t$ pairwise edge-disjoint triangles, then it can be made triangle-free by removing at most $2t$ edges. If true, the factor 2 would be best possible. In the directed…

This paper explores the relationship between closed curves on surfaces and their intersections. Like Dehn-Thurston coordinates for simple curves, we explore how to determine closed curves using the number of times they intersect other…

We give a close formula for the N\'eron-Tate height of tautological integral cycles on Jacobians of curves over number fields as well as a new lower bound for the arithmetic self-intersection number $\hat{\omega}^2$ of the dualizing sheaf…

Let $\Gamma$ be an arrangement of Jordan curves in the plane, i.e., simple closed curves in the plane. For any curve $\gamma \in \Gamma$, we denote the bounded region enclosed by $\gamma$ as $\tilde{\gamma}$. We say that $\Gamma$ is…

Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the…

We say that a nonnegatively curved manifold $(M,g)$ has quarter pinched flag curvature if for any two planes which intersect in a line the ratio of their sectional curvature is bounded above by 4. We show that these manifolds have…

A pseudo-edge graph of a convex polyhedron K is a 3-connected embedded graph in K whose vertices coincide with those of K, whose edges are distance minimizing geodesics, and whose faces are convex. We construct a convex polyhedron K in…

A {\it vertex-ordered} graph is a graph equipped with a linear ordering of its vertices. A pair of independent edges in an ordered graph can exhibit one of the following three patterns: separated, nested or crossing. We say a pair of…

We classify completely the intersections of the Hermitian curve with parabolas in the affine plane. To obtain our results we employ well-known algebraic methods for finite fields and geometric properties of the curve automorphisms. In…

We show non-collapsing for the evolution of nearly spherical closed convex curves in \mathbb{R}^2 under power curvature flow using two-point-methods.