English
Related papers

Related papers: Beyond the Richter-Thomassen Conjecture

200 papers

For a plane curve, a point on the projective plane is said to be Galois if the projection from the point as a map from the curve to a line induces a Galois extension of function fields. We present upper bounds for the number of Galois…

Algebraic Geometry · Mathematics 2016-04-08 Satoru Fukasawa

An $n$-Venn diagram is a diagram in the plane consisting of $n$ simple closed curves that intersect only finitely many times such that each of the $2^n$ possible intersections is represented by a single connected region. An $n$-Venn diagram…

Combinatorics · Mathematics 2025-11-13 Sofia Brenner , Petr Gregor , Torsten Mütze , Francesco Verciani

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…

Geometric Topology · Mathematics 2016-11-16 Moira Chas , Siddhartha Gadgil

We present a conjecture for the power-law exponent in the asymptotic number of types of plane curves as the number of self-intersections goes to infinity. In view of the description of prime alternating links as flype equivalence classes of…

Mathematical Physics · Physics 2007-05-23 Gilles Schaeffer , Paul Zinn-Justin

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…

Geometric Topology · Mathematics 2011-08-03 Moira Chas , Steven P. Lalley

The celebrated Szemer\'edi--Trotter theorem states that the maximum number of incidences between $n$ points and $n$ lines in the plane is $O(n^{4/3})$, which is asymptotically tight. Solymosi (2005) conjectured that for any set of points…

Combinatorics · Mathematics 2025-09-29 Martin Balko , Nóra Frankl

We consider the number of edge crossings in a random graph drawing generated by projecting a random geometric graph on some compact convex set $W\subset \mathbb{R}^d$, $d\geq 3$, onto a plane. The positions of these crossings form the…

Probability · Mathematics 2025-06-06 Hanna Döring , Lianne de Jonge

A subset $A$ of $[n] = \{1, \dots, n\}$ is $k$-separated if, when the elements of $[n]$ are considered on a circle, between any two elements of $A$ there are at least $k$ elements of $[n]$ that are not in $A$. A family $\mathcal{A}$ of sets…

Combinatorics · Mathematics 2020-12-08 Peter Borg , Carl Feghali

We prove that there are $O(n)$ tangencies among any set of $n$ red and blue planar curves in which every pair of curves intersects at most once and no two curves of the same color intersect. If every pair of curves may intersect more than…

Combinatorics · Mathematics 2021-03-05 Eyal Ackerman , Balázs Keszegh , Dömötör Pálvölgyi

Consider a bicolored point set $P$ in general position in the plane consisting of $n$ blue and $n$ red points. We show that if a subset of the red points forms the vertices of a convex polygon separating the blue points, lying inside the…

Combinatorics · Mathematics 2024-04-10 Jan Soukup

We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in $\mathbb{R}^4$. Specifically, we show that an arrangement of $n$ algebraic curves determines at most $C_\epsilon…

Combinatorics · Mathematics 2018-01-19 Larry Guth , Joshua Zahl

Let $\Omega=(\omega_{j})_{j\in I}$ be a collection of pairwise non-isotopic simple closed curves on the closed, orientable, genus $g$ surface $S_{g}$, such that $\omega_{i}$ and $\omega_{j}$ intersect exactly once for $i\neq j$. It was…

Geometric Topology · Mathematics 2012-10-11 Tarik Aougab

We consider closed chains of circles $C_1,C_2,\ldots,C_n,C_{n+1}=C_1$ such that two neighbouring circles $C_i,C_{i+1}$ intersect or touch each other with $A_i$ being a common point. We formulate conditions such that a polygon with vertices…

General Mathematics · Mathematics 2025-02-25 Norbert Hungerbühler

Given a regular $n$-gon on the plane, it is evident that from any point on the plane, taken as a center, one can draw $n$ concentric circles such that each circle passes through one of the vertices of the polygon. Naturally, this raises the…

General Mathematics · Mathematics 2026-04-17 Mamuka Meskhishvili

We give a criterion when a planar tree-like curve, i.e. a generic immersed plane curve each double point of which cuts it into two disjoint parts, can be send by a diffeomorphism of the plane onto a curve with no inflection points. We also…

dg-ga · Mathematics 2008-02-03 Boris Shapiro

Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…

Computational Geometry · Computer Science 2017-08-22 Sergey Bereg , Matias Korman , Rodrigo I. Silveira , Ferran Hurtado , Dolores Lara , Jorge Urrutia , Mikio Kano , Carlos Seara , Kevin Verbeek

The square-peg problem asks if every Jordan curve in the plane has four points which are the vertices of a square. The problem is open for continuous Jordan curves, but it has been resolved for various regularity classes of curves between…

Differential Geometry · Mathematics 2021-03-26 Jason Cantarella , Elizabeth Denne , John McCleary

We study the number of points in the family of plane curves defined by a trinomial \[ \mathcal{C}(\alpha,\beta)= \{(x,y)\in\mathbb{F}_q^2\,:\,\alpha x^{a_{11}}y^{a_{12}}+\beta x^{a_{21}}y^{a_{22}}=x^{a_{31}}y^{a_{32}}\} \] with fixed…

Number Theory · Mathematics 2021-02-23 Martin Avendano , Jorge Martin-Morales

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…

Combinatorics · Mathematics 2020-09-22 János Pach , Gábor Tardos , Géza Tóth

We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this…

Computational Geometry · Computer Science 2017-04-03 Mercè Claverol , Alfredo García , Delia Garijo , Carlos Seara , Javier Tejel