English
Related papers

Related papers: Incidences between points and lines on two- and th…

200 papers

Two sets $A$ and $B$ of points in the plane are \emph{mutually avoiding} if no line generated by any two points in $A$ intersects the convex hull of $B$, and vice versa. In 1994, Aronov, Erd\H os, Goddard, Kleitman, Klugerman, Pach, and…

Combinatorics · Mathematics 2020-06-23 Mozhgan Mirzaei , Andrew Suk

The Lov\'{a}sz Local Lemma (LLL) says that, given a set of bad events that depend on the values of some random variables and where each event happens with probability at most $p$ and depends on at most $d$ other events, there is an…

Data Structures and Algorithms · Computer Science 2019-08-21 Sebastian Brandt , Yannic Maus , Jara Uitto

We prove that a general complete intersection of dimension $n$, codimension $c$ and type $d_1, \dots, d_c$ in $\mathbb{P}^N$ has ample cotangent bundle if $c \geq 2n-2$ and the $d_i$'s are all greater than a bound that is $O(1)$ in $N$ and…

Algebraic Geometry · Mathematics 2020-02-05 Izzet Coskun , Eric Riedl

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

Metric Geometry · Mathematics 2022-03-23 Brett Leroux , Luis Rademacher

We consider elliptic surfaces $\mathcal{E}$ over a field $k$ equipped with zero section $O$ and another section $P$ of infinite order. If $k$ has characteristic zero, we show there are only finitely many points where $O$ is tangent to a…

Algebraic Geometry · Mathematics 2020-10-21 Douglas Ulmer , Giancarlo Urzúa

One can embed arbitrarily many disjoint, non-parallel, non-boundary parallel, incompressible surfaces in any three manifold with at least one boundary component of genus two or greater [4]. This paper proves the contrasting, but not…

Geometric Topology · Mathematics 2007-05-23 Hugh Nelson Howards

Let $F$ be a field with positive odd characteristic $p$. We prove a variety of new sum-product type estimates over $F$. They are derived from the theorem that the number of incidences between $m$ points and $n$ planes in the projective…

Combinatorics · Mathematics 2016-09-06 Oliver Roche-Newton , Misha Rudnev , Ilya D. Shkredov

The first goal of this paper is to prove a sharp condition to guarantee of having a positive proportion of all congruence classes of triangles in given sets in $\mathbb{F}_q^2$. More precisely, for $A, B, C\subset \mathbb{F}_q^2$, if…

Combinatorics · Mathematics 2023-08-16 Thang Pham

In their work [IM16] I.A. Ikromov and D. M\"{u}ller proved the full range $L^p-L^2$ Fourier restriction estimates for a very general class of hypersurfaces in $\R^3$ which includes the class of real analytic hypersurfaces. In this article…

Classical Analysis and ODEs · Mathematics 2020-07-15 Ljudevit Palle

We study 2d and 3d gravity theories on spacetimes with causal (timelike or null) codimension one boundaries while allowing for variations in the position of the boundary. We construct the corresponding solution phase space and specify…

High Energy Physics - Theory · Physics 2022-06-15 H. Adami , Pujian Mao , M. M. Sheikh-Jabbari , V. Taghiloo , H. Yavartanoo

In this article we study congruences of lines in $\mathbb{P}^n$, and in particular of order one. After giving general results, we obtain a complete classification in the case of $\mathbb{P}^4$ in which the fundamental surface $F$ is in fact…

Algebraic Geometry · Mathematics 2017-02-03 Pietro De Poi

Steinitz's theorem states that if a point $a \in \mathrm{int\,conv\,} X$ for a set $X \subset \mathbb{R}^d$, then $X$ contains a subset $Y$ of size at most $2d$ such that $a \in \mathrm{int\,conv\,}Y$. The bound $2d$ is best possible here.…

Combinatorics · Mathematics 2026-03-13 Imre Bárány , Yun Qi

We study the probability for a random line to intersect a given plane curve, defined over a finite field, in a given number of points defined over the same field. In particular, we focus on the limits of these probabilities under successive…

Combinatorics · Mathematics 2021-04-30 Mehdi Makhul , Josef Schicho , Matteo Gallet

The point placement problem is to determine the positions of a set of $n$ distinct points, P = {p1, p2, p3, ..., pn}, on a line uniquely, up to translation and reflection, from the fewest possible distance queries between pairs of points.…

Data Structures and Algorithms · Computer Science 2012-10-16 Md. Shafiul Alam , Asish Mukhopadhyay

Let $S$ be a set of $n$ points in $\mathbb{R}^d$, where $d \geq 2$ is a constant, and let $H_1,H_2,\ldots,H_{m+1}$ be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly $n/m$ points of $S$ are…

Given an irreducible variety $X$ over a finite field, the density of hypersurfaces of varying degree $d$ intersecting $X$ in an irreducible subvariety is $1$, by a result of Charles and Poonen. In this note, we analyse the situation fixing…

Algebraic Geometry · Mathematics 2020-02-11 Mehdi Makhul , Josef Schicho

Let $L$ be a sequence $(\ell_1,\ell_2,\ldots,\ell_n)$ of $n$ lines in $\mathbb{C}^3$. We define the {\it intersection graph} $G_L=([n],E)$ of $L$, where $[n]:=\{1,\ldots, n\}$, and with $\{i,j\}\in E$ if and only if $i\neq j$ and the…

Combinatorics · Mathematics 2016-07-15 Orit E. Raz

Let $L$ be a set of $n$ lines in the plane, not necessarily in general position. We present an efficient algorithm for finding all the vertices of the arrangement $A(L)$ of maximum level, where the level of a vertex $v$ is the number of…

Computational Geometry · Computer Science 2020-03-03 Dan Halperin , Sariel Har-Peled , Kurt Mehlhorn , Eunjin Oh , Micha Sharir

An "edge guard set" of a plane graph $G$ is a subset $\Gamma$ of edges of $G$ such that each face of $G$ is incident to an endpoint of an edge in $\Gamma$. Such a set is said to guard $G$. We improve the known upper bounds on the number of…

Computational Geometry · Computer Science 2018-04-20 Ahmad Biniaz , Prosenjit Bose , Aurélien Ooms , Sander Verdonschot

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

Combinatorics · Mathematics 2024-03-14 Dmitrii Zakharov
‹ Prev 1 8 9 10 Next ›