English
Related papers

Related papers: Arcs on spheres intersecting at most twice

200 papers

We prove that on a punctured oriented surface with Euler characteristic chi < 0, the maximal cardinality of a set of essential simple arcs that are pairwise non-homotopic and intersecting at most once is 2|chi|(|chi|+1). This gives a cubic…

Geometric Topology · Mathematics 2014-08-27 Piotr Przytycki

We classify maximal systems of arcs which intersect at most once on the 4-punctured sphere.

Geometric Topology · Mathematics 2021-08-02 Paul Tee

Let $S$ be an $n$-punctured sphere, with $n \geq 3$. We prove that $\binom{n}{3}$ is the maximum size of a family of pairwise non-homotopic simple arcs on $S$ joining a fixed pair of distinct punctures of $S$ and pairwise intersecting at…

Geometric Topology · Mathematics 2019-06-17 Sami Douba

We show that the order of the cardinality of maximal complete $1$-systems of loops on non-orientable surfaces is $\sim |\chi|^{2}$. In particular, we determine the exact cardinality of maximal complete $1$-systems of loops on punctured…

Geometric Topology · Mathematics 2025-04-10 Xiao Chen

For a compact surface $ S $ with a finite set of marked points $ P $, we define a 1-system to be a collection of arcs which are pairwise non-homotopic and intersect pairwise at most once. We prove that, up to equivalence, there are exactly…

Geometric Topology · Mathematics 2022-09-13 Denali Relles

Let $D_n$ be the $n$-punctured disk. We prove that a family of essential simple arcs starting and ending at the boundary and pairwise intersecting at most twice is of size at most $\binom{n+1}{3}$. On the way, we also show that any…

Geometric Topology · Mathematics 2017-08-23 Assaf Bar-Natan

We prove that on a closed surface of genus $g$, the cardinality of a set of simple closed curves in which any two are non-homotopic and intersect at most once is $\lesssim g^2 \log(g)$. This bound matches the largest known constructions to…

Geometric Topology · Mathematics 2018-07-17 Joshua Evan Greene

We investigate the maximum number of intersections between two polygons with p and q vertices, respectively, in the plane. The cases where p or q is even or the polygons do not have to be simple are quite easy and already known, but when p…

Combinatorics · Mathematics 2015-02-11 Felix Günther

For a graph property $\mathcal{P}$ and a common vertex set $V = \{1, 2, \ldots, n\}$, a family of graphs on $V$ is \emph{$\mathcal{P}$-intersecting} iff $G \cap H$ satisfies $\mathcal{P}$ for all $G,H$ in the family. Addressing a question…

Combinatorics · Mathematics 2019-01-08 Aaron Berger , Ross Berkowitz , Pat Devlin , Michael Doppelt , Sonali Durham , Tessa Murthy , Harish Vemuri

Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set $P=\{p_1,...,p_n\}\subset\mathbb{Z}^2$ a maximal integral point set over $\mathbb{Z}^2$ if all pairwise distances are integral and…

Combinatorics · Mathematics 2008-04-09 Andrey Radoslavov Antonov , Sascha Kurz

We determine the maximal number of systoles among all spheres with $n$ punctures endowed with a complete Riemannian metric of finite area.

Geometric Topology · Mathematics 2025-09-16 Sebastian Baader , Jasmin Jörg

For an even set of points in the plane, choose a max-sum matching, that is, a perfect matching maximizing the sum of Euclidean distances of its edges. For each edge of the max-sum matching, consider the ellipse with foci at the edge's…

Computational Geometry · Computer Science 2023-11-23 Polina Barabanshchikova , Alexandr Polyanskii

In this short note, we construct a minimally intersecting pair of simple closed curves that fill a genus 2 surface with an odd, greater than 3, number of punctures. This finishes the determination of minimally intersecting filling pairs for…

Geometric Topology · Mathematics 2019-06-06 Luke Jeffreys

We consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p in R and q in B, we consider the disk through p and q with the smallest diameter. We prove that for any R and B…

Computational Geometry · Computer Science 2019-02-25 Clemens Huemer , Pablo Pérez-Lantero , Carlos Seara , Rodrigo I. Silveira

We give short and simple proofs of what seem to be folklore results: * the maximum cardinality of the intersection of a lattice cube with an affine subspace; * the minimum number of affine subspaces needed to cover a lattice cube.

Combinatorics · Mathematics 2019-09-13 Lê Thành Dũng Nguyên

We show that the asymptotic growth rate for the minimal cardinality of a set of simple closed curves on a closed surface of genus $g$ which fill and pairwise intersect at most $K\ge 1$ times is $2\sqrt{g}/\sqrt{K}$ as $g \to \infty$ . We…

Geometric Topology · Mathematics 2010-10-11 James W. Anderson , Hugo Parlier , Alexandra Pettet

According to a conjecture of Pach, there are $O(n)$ tangent pairs among any family of $n$ Jordan arcs in which every pair of arcs has precisely one common point and no three arcs share a common point. This conjecture was proved for two…

Combinatorics · Mathematics 2026-03-13 Eyal Ackerman , Balázs Keszegh

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 study filling sets of simple closed curves on punctured surfaces. In particular we study lower bounds on the cardinality of sets of curves that fill and that pairwise intersect at most k times on surfaces with given genus and number of…

Geometric Topology · Mathematics 2015-08-17 Federica Fanoni , Hugo Parlier

In this paper we study a question related to the classical Erd\H{o}s-Ko-Rado theorem, which states that any family of $k$-element subsets of the set $[n] = \{1,\ldots,n\}$ in which any two sets intersect, has cardinality at most…

Combinatorics · Mathematics 2017-11-30 Peter Frankl , Andrey Kupavskii
‹ Prev 1 2 3 10 Next ›