English
Related papers

Related papers: Avoiding Intersections of Dragon Curves

200 papers

We investigate plane curves intersecting in at most two unibranched points to study the algebraic exceptional set appearing in standard conjectures of diophantine and hyperbolic geometry. Our first result compares the local geometry of two…

Algebraic Geometry · Mathematics 2025-06-23 Lucia Caporaso , Amos Turchet

We derive asymptotically optimal upper bounds on the number of L-rational torsion points on a given elliptic curve or Drinfeld module defined over a finitely generated field K, as a function of the degree [L:K]. Our main tool is the adelic…

Number Theory · Mathematics 2008-10-20 Florian Breuer

The paper deals with an extremal problem concerning colorings of hypergraphs with bounded edge degrees. Consider the family of $b$-simple hypergraphs, in which any two edges do not share more than $b$ common vertices. We prove that for…

Combinatorics · Mathematics 2020-12-18 Margarita Akhmejanova , Dmitry Shabanov

In this paper the author provides a generalization of classical linkage, i.e. linkage by a complete intersection, in a different context. Namely she looks at residuals in the scheme theoretic intersection of a rational normal surface or…

Algebraic Geometry · Mathematics 2007-05-23 Rita Ferraro

A family of closed simple (i.e., Jordan) curves is $m$-intersecting if any pair of its curves have at most $m$ points of common intersection. We say that a pair of such curves touch if they intersect at a single point of common tangency. In…

Computational Geometry · Computer Science 2021-11-29 Maya Bechler-Speicher

We propose a criterion for examining whether or not the uncertainty of the outer rotation curves is sufficiently small to distinguish a Keplerian rotation curve from flat ones. We have applied this criterion to both Keplerian and…

Astrophysics · Physics 2015-06-24 Mareki Honma , Yoshiaki Sofue

Given the $r$-distance graph on the hypercube $\mathbb{F}_2^n$, where two vertices are adjacent if their Hamming distance is exactly $r$, we study the maximum size $T(n,r)$ of a triangle-free set of vertices. For even $r\le n/2$, we prove…

Combinatorics · Mathematics 2026-04-17 Padmini Mukkamala , Ananthakrishnan Ravi

Let $\mathcal{D}$ be a set of $n$ disks in the plane. The disk graph $G_\mathcal{D}$ for $\mathcal{D}$ is the undirected graph with vertex set $\mathcal{D}$ in which two disks are joined by an edge if and only if they intersect. The…

Computational Geometry · Computer Science 2023-05-30 Sergio Cabello , Wolfgang Mulzer

It is shown that for a constant $t\in \mathbb{N}$, every simple topological graph on $n$ vertices has $O(n)$ edges if it has no two sets of $t$ edges such that every edge in one set is disjoint from all edges of the other set (i.e., the…

Combinatorics · Mathematics 2015-08-25 Andres J. Ruiz-Vargas , Andrew Suk , Csaba D. Tóth

If two Jordan curves in the plane have precisely one point in common, and there they do not properly cross, then the common point is called a {\em touching point}. The main result of this paper is a Crossing Lemma for simple curves: Let $X$…

Combinatorics · Mathematics 2017-08-08 János Pach , Natan Rubin , Gábor Tardos

Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and…

Computational Geometry · Computer Science 2021-11-03 Satyan L. Devadoss , Matthew Harvey

In the present paper we investigate the question concerning the existence of maximizing curves of degree $7$ with some prescribed ${\rm ADE}$ singularities. We give a result proving the non-existence of such maximizing septics and we…

Algebraic Geometry · Mathematics 2024-02-05 Izabela Czarnota

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

Computational Geometry · Computer Science 2010-01-21 Erik D. Demaine , David Eppstein , Jeff Erickson , George W. Hart , Joseph O'Rourke

We present an intrinsic formulation of the kinematic problem of two $n-$dimensional manifolds rolling one on another without twisting or slipping. We determine the configuration space of the system, which is an $\frac{n(n+3)}2-$dimensional…

Differential Geometry · Mathematics 2015-08-12 Mauricio Godoy Molina , Erlend Grong , Irina Markina , Fátima Silva Leite

On a general hypersurface of degree $d\leq n$ in $\mathbb P^n$ or $\mathbb P^n$ itself, we prove the existence of curves of any genus and high enough degree depending on the genus passing through the expected number $t$ of general points or…

Algebraic Geometry · Mathematics 2022-11-22 Ziv Ran

Simple closed curves in the plane can be mapped to nontrivial knots under the action of origami foldings that allow the paper to self-intersect. We show all tame knot types may be produced in this manner, motivating the development of a new…

Geometric Topology · Mathematics 2021-05-05 Joseph Slote , Thomas Bertschinger

It is shown that every orthogonal terrain, i.e., an orthogonal (right-angled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its surface may be unfolded to a single non-overlapping piece…

Computational Geometry · Computer Science 2007-07-12 Joseph O'Rourke

It is proved that every series-parallel digraph whose maximum vertex-degree is $\Delta$ admits an upward planar drawing with at most one bend per edge such that each edge segment has one of $\Delta$ distinct slopes. This is shown to be…

Computational Geometry · Computer Science 2016-08-31 Emilio Di Giacomo , Giuseppe Liotta , Fabrizio Montecchiani

We provide examples of smooth three-dimensional Fano complete intersections of dergee 2, 4, 6, and 8 that have coregularity 0. Considering the main theorem of arXiv:2309.16784 on the remaining 101 families of smooth Fano threefolds, our…

Algebraic Geometry · Mathematics 2024-09-05 Olzhas Zhakupov

The minimum number of self-intersection points for members of a free homotopy class of curves on the punctured torus is bounded above in terms of the number L of letters required for a minimal description of the class in terms of the…

Geometric Topology · Mathematics 2009-01-21 Moira Chas , Anthony Phillips
‹ Prev 1 8 9 10 Next ›