English
Related papers

Related papers: Arcs on spheres intersecting at most twice

200 papers

We introduce a new class of problems lying halfway between questions about graph capacity and intersection. We say that two binary sequences x and y of the same length have a skewincidence if there is a coordinate i for which x_i=y_{i+1}=1…

Combinatorics · Mathematics 2010-03-23 Gerard Cohen , Emanuela Fachini , Janos Korner

We show, in this first part, that the maximal number of singular points of a normal quartic surface $X \subset \mathbb{P}^3_K$ defined over an algebraically closed field $K$ of characteristic $2$ is at most $16$. We produce examples with…

Algebraic Geometry · Mathematics 2022-01-24 Fabrizio Catanese

Let $\mathcal{F}$ be a family of $k$-sized subsets of $[n]$ that does not contain $s$ pairwise disjoint subsets. The Erd\H{o}s Matching Conjecture, a celebrated and long-standing open problem in extremal combinatorics, asserts the maximum…

Combinatorics · Mathematics 2026-03-11 Tapas Kumar Mishra

A family $\mathcal{F}$ of subsets of $\{1,\dots,n\}$ is called $k$-wise intersecting if any $k$ members of $\mathcal{F}$ have non-empty intersection, and it is called maximal $k$-wise intersecting if no family strictly containing…

Combinatorics · Mathematics 2022-09-21 Barnabás Janzer

A curve in the plane is $x$-monotone if every vertical line intersects it at most once. A family of curves are called pseudo-segments if every pair of them have at most one point in common. We construct $2^{\Omega(n^{4/3})}$ families, each…

Combinatorics · Mathematics 2026-01-12 Jacob Fox , Janos Pach , Andrew Suk

Two hypergraphs $H_1,\ H_2$ are called {\em cross-intersecting} if $e_1 \cap e_2 \neq \emptyset$ for every pair of edges $e_1 \in H_1,~e_2 \in H_2$. Each of the hypergraphs is then said to {\em block} the other. Given parameters $n,r,m$ we…

Combinatorics · Mathematics 2016-05-23 Ron Aharoni , David Howard

In this paper, we prove a new point-sphere incidence bound in vector spaces over finite fields. More precisely, let $P$ be a set of points and $S$ be a set of spheres in $\mathbb{F}_q^d$. Suppose that $|P|, |S|\le N$, we prove that the…

Combinatorics · Mathematics 2021-09-20 Doowon Koh , Thang Pham

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

Let $Q$ be a finite subgraph of the integer grid $G$ in the plane, and let $T$ be a set of pairs of distinct vertices in $G$, called `terminal pairs'. Escaping a subset $X\subset T\cap Q$ from $Q$ means finding edge disjoint paths from the…

Combinatorics · Mathematics 2017-08-21 Adam S. Jobson , André E. Kézdy , Jenő Lehel

We show, in this second part, that the maximal number of singular points of a quartic surface $X \subset \mathbb{P}^3_K$ defined over an algebraically closed field $K$ of characteristic 2 is at most 14, and that, if we have 14…

Algebraic Geometry · Mathematics 2022-05-25 Fabrizio Catanese , Matthias Schütt

A matching of graph $G$ is maximal if it cannot be expanded by adding any edge to create a larger matching. In this paper, for a hexagonal ring $H$ with $n$ hexagons, we show that the number of maximal matchings of $H$ equals to the trace…

Combinatorics · Mathematics 2025-06-11 Chengqi Li , Jinhui Yin , Lingjuan Shi

We consider an extremal problem for subsets of high-dimensional spheres that can be thought of as an extension of the classical isoperimetric problem on the sphere. Let $A$ be a subset of the $(m-1)$-dimensional sphere $\mathbb{S}^{m-1}$,…

Probability · Mathematics 2018-11-27 Leighton Pate Barnes , Ayfer Ozgur , Xiugang Wu

We improve on the lower bound of the maximum number of planes in $\operatorname{PG}(8,q)\cong\F_q^{9}$ pairwise intersecting in at most a point. In terms of constant dimension codes this leads to $A_q(9,4;3)\ge q^{12}+…

Combinatorics · Mathematics 2019-12-02 Sascha Kurz

We give a construction of singular curves with many rational points over finite fields. This construction enables us to prove some results on the maximum number of rational points on an absolutely irreducible projective algebraic curve…

Algebraic Geometry · Mathematics 2015-10-05 Yves Aubry , Annamaria Iezzi

We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number.

Combinatorics · Mathematics 2022-07-08 Lars Jaffke , Paloma T. Lima

An arrangement of pseudocircles is a collection of simple closed curves on the sphere or in the plane such that any two of the curves are either disjoint or intersect in exactly two crossing points. We call an arrangement intersecting if…

Computational Geometry · Computer Science 2020-01-17 Stefan Felsner , Manfred Scheucher

Let $P$ be a set of $n$ points in the plane, and let $\mathcal C$ be a collection of $n$ simple $k$-intersecting curves, meaning that every two distinct curves of $\mathcal C$ meet in at most $k$ points. A classical theorem of Pach and…

Combinatorics · Mathematics 2026-05-21 Andrew Suk , Su Zhou

We prove that a component of the closure of the set of star points on a hypersurface X of degree d>2 in N-dimensional projective space is linear. Afterwards, we focus on the case where the component is of maximal dimension N-2 and the case…

Algebraic Geometry · Mathematics 2009-09-10 Filip Cools , Marc Coppens

The paper is concerned with families of plane algebraic curves that contain a given and quite special finite set X of points in the projective plane. We focus on the case in which the set X is formed by transversally intersecting pairs of…

Algebraic Geometry · Mathematics 2007-05-23 Gabriel Katz

We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite…

Geometric Topology · Mathematics 2015-11-11 Javier Aramayona , Ariadna Fossas , Hugo Parlier