Related papers: Bisectors and pinned distances

We consider weighted Hardy inequalities involving the distance function to the boundary of a domain in the $N$-dimensional Euclidean space with nonempty boundary. We give a lower bound for the corresponding best Hardy constant for a domain…

An $L$-spherical code is a set of Euclidean unit vectors whose pairwise inner products belong to the set $L$. We show, for a fixed $\alpha,\beta>0$, that the size of any $[-1,-\beta]\cup\{\alpha\}$-spherical code is at most linear in the…

We consider a class of bi-parameter kernels and related square functions in the upper half-space, and give an efficient proof of a boundedness criterion for them. The proof uses modern probabilistic averaging methods and is based on…

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is…

We classify the solutions to an overdetermined elliptic problem in the plane in the finite connectivity case. This is achieved by establishing a one-to-one correspondence between the solutions to this problem and a certain type of minimal…

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

We prove a lower bound on the dimension of the set of maximal border subrank tensors. This is the first such bound of its type.

Motivated by a question of R.\ Nandakumar, we show that the Euclidean plane can be dissected into mutually incongruent convex quadrangles of the same area and the same perimeter. As a byproduct we obtain vertex-to-vertex dissections of the…

In this note we give a shortened proof of a theorem of Rudnev, which bounds the number of incidences between points and planes over an arbitrary field. Rudnev's proof uses a map that goes via the four-dimensional Klein quadric to a…

We solve the problem of finding a sharp upper bound on the minimum angle formed by $N$ points in the Euclidean and Hyperbolic planes.

We consider a subset of projective space over a finite field and give bounds on the minimal degree of a non-vanishing form with respect to this subset.

This work considers new entropy-based proofs of some known, or otherwise refined, combinatorial bounds for bipartite graphs. These include upper bounds on the number of the independent sets, lower bounds on the minimal number of colors in…

We study a pinned variant of Bourgain's theorem, concerning the occurrence of affine copies of $k$-point patterns in $\mathbb{R}^d$. Focusing on the case $k=2$, which corresponds to pinned distances, we show that the classical conclusion…

We show upper and lower bounds for angles in iterations of trisections of certain triangulations.

In this paper we obtain a new lower bound on the Erd\H{o}s distinct distances problem in the plane over prime fields. More precisely, we show that for any set $A\subset \mathbb{F}_p^2$ with $|A|\le p^{7/6}$, the number of distinct distances…

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

We prove that positive solutions of the superlinear Lane-Emden system in a two-dimensional smooth bounded domain are bounded independently of the exponents in the system, provided the exponents are comparable. As a consequence, the energy…

We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.

Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy…

We give an upper bound on the number of rational points of an arbitrary Zariski closed subset of a projective space over a finite field. This bound depends only on the dimensions and degrees of the irreducible components and holds for very…