Related papers: Many Touchings Force Many Crossings

We construct pairs of elliptic curves over number fields with large intersection of projective torsion points.

Polygons are cycles embedded into the plane; their vertices are associated with $x$- and $y$-coordinates and the edges are straight lines. Here, we consider a set of polygons with pairwise non-overlapping interior that may touch along their…

The crossing number of a graph $G$ is the least number of crossings over all possible drawings of $G$. We present a structural characterization of graphs with crossing number one.

The Tait-Kneser theorem states that the osculating circles of a plane curve with monotonic curvature are pairwise disjoint and nested. We discuss this theorem and a number of its variations.

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…

Several authors have recently attempted to show that the intersection of three simply connected subcontinua of the plane is simply connected provided it is non-empty and the intersection of each two of the continua is path connected. In…

We introduce the concept of the touching of two multifunctions on a real Hilbert space, and deduce that certain multifunctions on the space have a unique fixed point. These result are applied to the theory of genaralized cycles and…

Consider the system of $n$ identical hard balls in $\mathbb R^3$ moving freely and colliding elastically. We show that there exist initial conditions such that the number of collisions is exponential in $n$.

A thrackle is a graph drawing in which every pair of edges meets exactly once. The Thrackle Conjecture (established by John Conway) states that the number of edges of a thrackle cannot exceed the number of its vertices. Cairns, Koussas, and…

Given two curves in $\PP^3$, either implicitly or by a parameterization, we want to check if they intersect. For that purpose, we present and further develop generalized resultant techniques. Our aim is to provide a closed formula in the…

We call $(a_1, \dots, a_n)$ an \emph{$r$-partial sequence} if exactly $r$ of its entries are positive integers and the rest are all zero. For ${\bf c} = (c_1, \dots, c_n)$ with $1 \leq c_1 \leq \dots \leq c_n$, let $S_{\bf c}^{(r)}$ be the…

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 study the number of elliptic curves, up to isomorphism, over a fixed quartic field $K$ having a prescribed torsion group $T$ as a subgroup. Let $T=\Z/m\Z \oplus \Z/n\Z$, where $m|n$, be a torsion group such that the modular curve…

We show a generalization of the crossing lemma for multi-graphs drawn on orientable surfaces in which pairs of edges are assumed to be drawn by non-homotopic simple arcs which pairwise cross at most $k$ times.

Given a family of sets on the plane, we say that the family is intersecting if for any two sets from the family their interiors intersect. In this paper, we study intersecting families of triangles with vertices in a given set of points. In…

We consider hypergraph visualizations that represent vertices as points in the plane and hyperedges as curves passing through the points of their incident vertices. Specifically, we consider several different variants of this problem by (a)…

A pair $(\alpha, \beta)$ of simple closed curves on a closed and orientable surface $S_g$ of genus $g$ is called a filling pair if the complement is a disjoint union of topological disks. If $\alpha$ is separating, then we call it as…

We determine the maximum possible number of edges of a graph with $n$ vertices, matching number at most $s$ and clique number at most $k$ for all admissible values of the parameters.

We confirm the following conjecture of Fekete and Woeginger from 1997: for any sufficiently large even number $n$, every set of $n$ points in the plane can be connected by a spanning tour (Hamiltonian cycle) consisting of straight-line…

Let a set of nodes $\mathcal X$ in the plane be $n$-independent, i.e., each node has a fundamental polynomial of degree $n.$ Assume that $\#\mathcal X=d(n,k-3)+3= (n+1)+n+\cdots+(n-k+5)+3$ and $4 \le k\le n-1.$ In this paper we prove that…