Related papers: Avoiding Intersections of Dragon Curves
One of the goals of this paper is to prove that the index of intersection of two complex curves in a two-dimensional complex manifold tangent to each other at a common boundary point is positive. This is achieved via the construction of a…
To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if every n-vertex geometric planar graph can be untangled while…
Trisecting an angle has been proved to be impossible by Euclidean Geometry, using only straight edge and compass. However, there is a method using Origami (paper folding) procedure to trisect an angle. The algebraic analysis of the same…
We construct infinitely many non-diffeomorphic examples of $5$-dimensional contact manifolds which are tight, admit no strong fillings, and do not have Giroux torsion. We obtain obstruction results for symplectic cobordisms, for which we…
We prove: if $d/m < 2280/721$, there is no curve of degree $d$ passing through $n = 10$ general points with multiplicity $m$ in $\bf{P}^2$. Similar results are given for other special values of $n$. Our bounds can be naturally written as…
We present a simple nonadaptive randomized algorithm that estimates the number of edges in a simple, unweighted, undirected graph, possibly containing isolated vertices, using only degree and random edge queries. For an $n$-vertex graph,…
We obtain a sharp bound on the number of self-intersections of a closed planar curve with trigonometric parameterization. Moreover, we show that a generic curve of this form is normal in the sense of Whitney.
We wish to bring attention to a natural but slightly hidden problem, posed by Erd\H{o}s and Ne\v{s}et\v{r}il in the late 1980s, an edge version of the degree--diameter problem. Our main result is that, for any graph of maximum degree…
This paper is devoted to presenting a new approach to determine the intersection of two quadrics based on the detailed analysis of its projection in the plane (the so called cutcurve) allowing to perform the corresponding lifting correctly.…
We give a simple proof of the non-existence of limit E-Brody curves, in the sense of Do Duc Thai, Mai Anh Duc and Ninh Van Thu, for a class of manifolds including $\mathbb{C}^n$ and $(\mathbb{C}^{\ast})^2$ which were studied by these…
We provide some new local obstructions to approximating tropical curves in smooth tropical surfaces. These obstructions are based on the relation between tropical and complex intersection theories which is also established here. We give two…
Intersection angles of stable and unstable manifolds for area preserving mappings are numerically calculated by extremely accurate computation. With the use of multiprecision library the values of angle as small as 10^{-400} are obtained.…
We study the following problem - How many arbitrary edges can be removed from a complete geometric graph with 2n vertices such that the resulting graph always contains a perfect non-crossing matching? We first address the case where the…
An arrangement of circles in which circles intersect only in angles of $\pi/2$ is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are nested, the intersection graph of such an arrangement is…
An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…
Let $G$ be a bipartite graph without loops and multiple edges on $v\ge 4$ vertices, which can be drawn on the plane such that any edge intersects at most one other edge. We prove that such graph has at most $3v-8$ edges for even $v\ne 6$…
A multigraph drawn in the plane is non-homotopic if no two edges connecting the same pair of vertices can be continuously deformed into each other without passing through a vertex, and is $k$-crossing if every pair of edges…
Research about crossings is typically about minimization. In this paper, we consider \emph{maximizing} the number of crossings over all possible ways to draw a given graph in the plane. Alpert et al. [Electron. J. Combin., 2009] conjectured…
We establish sharp lower and upper bounds for the number of integral points near dilations of a space curve with nowhere vanishing torsion.
The avoidance principle says that mean curvature flows of hypersurfaces remain disjoint if they are disjoint at the initial time. We prove several generalizations of the avoidance principle that allow for intersections of hypersurfaces.…