English
Related papers

Related papers: Incidences between planes over finite fields

200 papers

Let $P = A\times A \subset \mathbb{F}_p \times \mathbb{F}_p$, $p$ a prime. Assume that $P= A\times A$ has $n$ elements, $n<p$. See $P$ as a set of points in the plane over $\mathbb{F}_p$. We show that the pairs of points in $P$ determine…

Combinatorics · Mathematics 2014-01-14 Harald Andres Helfgott , Misha Rudnev

We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…

Computational Geometry · Computer Science 2012-06-05 Taylor Gordon

We established a hyperplane restriction theorem for the local holomorphic mappings between projective spaces, which is inspired by the corresponding theorem of Green for homogeneous ideals in polynomial rings. Our theorem allows us to give…

Complex Variables · Mathematics 2021-12-24 Yun Gao , Sui-Chung Ng

The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…

Computational Geometry · Computer Science 2015-03-17 Jean Cardinal , Matias Korman

We study regularity of the time-delayed coordinate maps \[\phi_{h,k}(x) = (h(x), h(Tx), \ldots, h(T^{k-1}x))\] for a diffeomorphism $T$ of a compact manifold $M$ and smooth observables $h$ on $M$. Takens' embedding theorem shows that if $k…

Dynamical Systems · Mathematics 2025-05-13 Adam Śpiewak

The following theorem is proved: For all $k$-connected graphs $G$ and $H$ each with at least $n$ vertices, the treewidth of the cartesian product of $G$ and $H$ is at least $k(n -2k+2)-1$. For $n\gg k$ this lower bound is asymptotically…

Combinatorics · Mathematics 2013-10-02 David R. Wood

We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of $n$ algebraic plane curves, we show that there are $O(n^{3/2})$ points where two or more curves…

Combinatorics · Mathematics 2018-07-10 Jordan S. Ellenberg , Jozsef Solymosi , Joshua Zahl

We consider the problem of bounding the number of exceptional projections (projections which are smaller than typical) of a subset of a vector space over a finite field onto subspaces. We establish bounds that depend on $L^p$ estimates for…

Combinatorics · Mathematics 2025-04-24 Jonathan M. Fraser , Firdavs Rakhmonov

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 initiate the study of average intersection theory in real Grassmannians. We define the expected degree $\textrm{edeg} G(k,n)$ of the real Grassmannian $G(k,n)$ as the average number of real $k$-planes meeting nontrivially $k(n-k)$ random…

Algebraic Geometry · Mathematics 2018-01-22 Peter Bürgisser , Antonio Lerario

We use Picard-Lefschetz theory to prove a new formula for intersection numbers of twisted cocycles associated to a given arrangement of hyperplanes. In a special case when this arrangement produces the moduli space of punctured Riemann…

High Energy Physics - Theory · Physics 2018-04-11 Sebastian Mizera

The point-line incidence problem has been widely studied in Euclidean spaces and vector spaces over finite fields, whereas the analogous problem has rarely been considered over finite $p$-adic rings. In this paper, we investigate incidences…

Combinatorics · Mathematics 2025-10-24 Yuhan Chu

We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex…

Discrete Mathematics · Computer Science 2015-03-17 Michael Hoffmann , Micha Sharir , Adam Sheffer , Csaba D. Tóth , Emo Welzl

We show that the maximum number of pairwise non-overlapping $k$-rich lenses (lenses formed by at least $k$ circles) in an arrangement of $n$ circles in the plane is $O\left(\frac{n^{3/2}\log{(n/k^3)}}{k^{5/2}} + \frac{n}{k} \right)$, and…

Combinatorics · Mathematics 2020-12-09 Esther Ezra , Orit E. Raz , Micha Sharir , Joshua Zahl

A random geometric graph, $G(n,r)$, is formed by choosing $n$ points independently and uniformly at random in a unit square; two points are connected by a straight-line edge if they are at Euclidean distance at most $r$. For a given…

Discrete Mathematics · Computer Science 2018-10-01 Ahmad Biniaz , Evangelos Kranakis , Anil Maheshwari , Michiel Smid

Let $P$ be a finite point set in $\mathbb{R}^2$ with the set of distance $n$-chains defined as $$ \Delta_n(P)=\{(|p_1-p_2|,|p_2-p_3|,\ldots,|p_n-p_{n+1}|):p_i \in P\}.$$ We show that for $2\leq n=O_{|P|}(1)$ we have $$|\Delta_n(P)|\gtrsim…

Combinatorics · Mathematics 2021-02-09 Jonathan Passant

The aim of the paper is to address the behavior in large population of diffusions interacting on a random, possibly diluted and inhomogeneous graph. This is the natural continuation of a previous work, where the homogeneous Erd\H os-R\'enyi…

Probability · Mathematics 2019-04-01 Eric Luçon

We show that $m$ points and $n$ smooth algebraic surfaces of bounded degree in $\mathbb{R}^3$ satisfying suitable nondegeneracy conditions can have at most $O(m^{\frac{2k}{3k-1}}n^{\frac{3k-3}{3k-1}}+m+n)$ incidences, provided that any…

Combinatorics · Mathematics 2018-07-18 Joshua Zahl

We prove Pach-Sharir type incidence theorems for a class of curves in R^n and surfaces in R^3, which we call pseudoflats. In particular, our results apply to a wide class of generic irreducible real algebraic sets of bounded degree.

Combinatorics · Mathematics 2007-05-23 Izabella Laba , Jozsef Solymosi

A graph $H$ is common if the limit as $n\to\infty$ of the minimum density of monochromatic labelled copies of $H$ in an edge colouring of $K_n$ with red and blue is attained by a sequence of quasirandom colourings. We apply an…

Combinatorics · Mathematics 2023-07-11 Natalie Behague , Natasha Morrison , Jonathan A. Noel