Related papers: Avoiding Intersections of Dragon Curves

Let $\F$ be a family of $n$ pairwise intersecting circles in the plane. We show that the number of lenses, that is convex digons, in the arrangement induced by $\F$ is at most $2n-2$. This bound is tight. Furthermore, if no two circles in…

We consider the $M$-curves of degree nine with three nests $1 \langle \alpha_i \rangle, i = 1, 2, 3$ in $\mathbb{R}P^2$. After systematic constructions, Korchagin conjectured that at least two of the $\alpha_i$ must be odd. It was later…

It is unlikely that the discrete Fr\'echet distance between two curves of length $n$ can be computed in strictly subquadratic time. We thus consider the setting where one of the curves, $P$, is known in advance. In particular, we wish to…

The collapse of a vapor bubble near a flat solid boundary results in the formation of a jet that is directed towards the boundary. In more complex geometries such as corners, predictions of the collapse cannot be made in a straightforward…

We consider the family of graphs whose vertex set is $\mathbb{Z}^n$ where two vertices are connected by an edge when their $\ell_\infty$-distance is 1. Towards an edge isoperimetric inequality for this graph, we calculate the edge boundary…

A {\em thrackle} is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of $n$ vertices has at most $1.3984n$ edges. {\em…

In FOCS'2002, Even et al. introduced and studied the notion of conflict-free colorings of geometrically defined hypergraphs. They motivated it by frequency assignment problems in cellular networks. This notion has been extensively studied…

We extend the notion of a source unfolding of a convex polyhedron P to be based on a closed polygonal curve Q in a particular class rather than based on a point. The class requires that Q "lives on a cone" to both sides; it includes simple,…

In the present paper, we focus on a weighted version of the Bounded Negativity Conjecture which predicts that for every smooth projective surface in characteristic zero the self-intersection numbers of reduced and irreducible curves are…

A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. If the isolated vertex is excluded as trivial, nut graphs have seven or more vertices;…

Hypersonic waveriders are special shapes with leading edges coincident with the body's shock wave, yielding high lift-to-drag ratios. The waverider geometry results from streamline tracing using the solutions of a basic flow field such as…

We investigate the number of nodal intersections of random Gaussian Laplace eigenfunctions on the standard three-dimensional flat torus with a fixed smooth reference curve, which has nowhere vanishing curvature. The expected intersection…

We study the nef cone of self-products of a curve. When the curve is very general of genus $g>2$, we construct a nontrivial class of self-intersection 0 on the boundary of the nef cone. Up to symmetry, this is the only known nontrivial…

We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of $n$ algebraic plane curves, we show that there are $O(n^{3/2})$ points where two or more curves…

We compute an asymptotic expression for the Arakelov self-intersection number of the relative dualizing sheaf of Edixhoven's minimal regular model for the modular curve $X_0(p^2)$ over $\mathbb{Q}$. The computation of the self-intersection…

A topological drawing of a graph is fan-planar if for each edge $e$ the edges crossing $e$ form a star and no endpoint of $e$ is enclosed by $e$ and its crossing edges. A fan-planar graph is a graph admitting such a drawing. Equivalently,…

One of the most fundamental results in graph theory is Mantel's theorem which determines the maximum number of edges in a triangle-free graph of order $n$. Recently a colorful variant of this problem has been solved. In such a variant we…

Given a tropical divisor $D$ in the intersection of two tropical plane curves, we study when it can be realized as the tropicalization of the intersection of two algebraic curves, and give a sufficient condition. We show that under a…

Given a set of planar curves (Jordan arcs), each pair of which meets -- either crosses or touches -- exactly once, we establish an upper bound on the number of touchings. We show that such a curve family has $O(t^2n)$ touchings, where $t$…

We construct for all $ k\in \mathbb{N} $ a $ k $-edge-connected digraph $ D $ with $ s,t\in V(D) $ such that there are no edge-disjoint $ s \rightarrow t $ and $t\rightarrow s $ paths. We use in our construction "self-similar" graphs which…