English
Related papers

Related papers: Incidence Bounds for Block Designs

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

The dimension of a block design is the maximum positive integer $d$ such that any $d$ of its points are contained in a proper subdesign. Pairwise balanced designs PBD$(v,K)$ have dimension at least two as long as not all points are on the…

Combinatorics · Mathematics 2019-07-22 Coen del Valle , Peter J. Dukes

We give a new bound on the number of collinear triples for two arbitrary subsets of a finite field. This improves on existing results which rely on the Cauchy inequality. We then us this to provide a new bound on trilinear and quadrilinear…

Number Theory · Mathematics 2017-09-01 Simon Macourt

We generalize work of Erdos and Fishburn to study the structure of finite point sets that determine few distinct triangles. Specifically, we ask for a given $t$, what is the maximum number of points that can be placed in the plane to…

Combinatorics · Mathematics 2017-02-10 Alyssa Epstein , Adam Lott , Steven J. Miller , Eyvindur A. Palsson

We focus on working on incidence rings, a class of (possibly infinite) matrix rings indexed by ordered sets. Some general properties about them are given, including how they are always the inverse limit of finite matrix rings, giving a…

Group Theory · Mathematics 2025-03-03 João V. P. e Silva

Let $p_1,\ldots,p_n$ be a set of points in the unit square and let $T_1,\ldots,T_n$ be a set of $\delta$-tubes such that $T_j$ passes through $p_j$. We prove a lower bound for the number of incidences between the points and tubes under a…

Combinatorics · Mathematics 2025-03-19 Alex Cohen , Cosmin Pohoata , Dmitrii Zakharov

Given a sequence of properly embedded minimal surfaces in a $3$-manifold with local bounds on area and genus, we prove subsequential convergence, smooth away from a discrete set, to a smooth embedded limit surface, possibly with…

Differential Geometry · Mathematics 2024-01-26 Brian White

Motivated by integral point sets in the Euclidean plane, we consider integral point sets in affine planes over finite fields. An integral point set is a set of points in the affine plane $\mathbb{F}_q^2$ over a finite field $\mathbb{F}_q$,…

Combinatorics · Mathematics 2015-10-16 Michael Kiermaier , Sascha Kurz

We prove the existence theorem for basic elements in the quasi-projective case, extending results of Eisenbud-Evans and Bruns from the affine case. We give several geometric applications. For example, we show that every local complete…

Algebraic Geometry · Mathematics 2020-06-02 Mengyuan Zhang

We show that the number of incidences between $m$ distinct points and $n$ distinct lines in ${\mathbb R}^4$ is $O\left(2^{c\sqrt{\log m}} (m^{2/5}n^{4/5}+m) + m^{1/2}n^{1/2}q^{1/4} + m^{2/3}n^{1/3}s^{1/3} + n\right)$, for a suitable…

Combinatorics · Mathematics 2015-03-26 Micha Sharir , Noam Solomon

Incidence varieties are spaces of $n$-tuples of points in the projective plane that satisfy a given set of collinearity conditions. We classify the components of incidence varieties and realization moduli spaces associated to configurations…

Algebraic Geometry · Mathematics 2025-07-15 Kelly Isham , Nathan Kaplan , Sam Kimport , Rachel Lawrence , Luke Peilen , Max Weinreich

Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model…

Combinatorics · Mathematics 2021-03-05 Ewan Davies , Matthew Jenssen , Will Perkins , Barnaby Roberts

We prove a new upper bound on the number of $r$-rich lines (lines with at least $r$ points) in a `truly' $d$-dimensional configuration of points $v_1,\ldots,v_n \in \mathbb{C}^d$. More formally, we show that, if the number of $r$-rich lines…

Combinatorics · Mathematics 2014-12-03 Zeev Dvir , Sivakanth Gopi

This paper discusses Tverberg-type theorems with coordinate constraints (i.e., versions of these theorems where all points lie within a subset $S \subset \mathbb{R}^d$ and the intersection of convex hulls is required to have a non-empty…

Metric Geometry · Mathematics 2019-01-30 Jesús A. De Loera , Thomas A. Hogan , Frédéric Meunier , Nabil Mustafa

In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs associated with maximal arcs in projective planes of even order, and their dual codes. Upper and lower bounds on the 2-rank of the incidence…

Combinatorics · Mathematics 2020-03-06 Mustafa Gezek , Rudi Mathon , Vladimir D. Tonchev

In this paper, we establish the following family version of Habegger's bounded height theorem on abelian varieties: a locally closed subvariety of an abelian scheme with Gao's $t^{\mathrm{th}}$ degeneracy locus removed, intersected with all…

Number Theory · Mathematics 2024-11-26 Tangli Ge

We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…

Number Theory · Mathematics 2019-09-12 László Mérai , Igor E. Shparlinski

We study the log-rank conjecture from the perspective of point-hyperplane incidence geometry. We formulate the following conjecture: Given a point set in $\mathbb{R}^d$ that is covered by constant-sized sets of parallel hyperplanes, there…

Combinatorics · Mathematics 2023-04-14 Noah Singer , Madhu Sudan

Given an iterated function system of affine dilations with fixed points the vertices of a regular polygon, we characterize which points in the limit set lie on the boundary of its convex hull.

Dynamical Systems · Mathematics 2018-11-20 Danny Calegari , Alden Walker

For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…

Combinatorics · Mathematics 2018-05-22 A. Iosevich , J. Passant