Related papers: Good bounds for sets lacking skew corners

For every $k>3$, we give a construction of planar point sets with many collinear $k$-tuples and no collinear $(k+1)$-tuples. We show that there are $n_0=n_0(k)$ and $c=c(k)$ such that if $n\geq n_0$, then there exists a set of $n$ points in…

Here is a square problem: in a unit square, is there a point with four rational distances to the vertices? A probability argument suggests a negative answer. This paper proves several special cases of the square problem: if the point sits…

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

A Kakeya set $S \subset (\mathbb{Z}/N\mathbb{Z})^n$ is a set containing a line in each direction. We show that, when $N$ is any square-free integer, the size of the smallest Kakeya set in $(\mathbb{Z}/N\mathbb{Z})^n$ is at least…

We introduce in this article a new method to estimate the minimum distance of codes from algebraic surfaces. This lower bound is generic, i.e. can be applied to any surface, and turns out to be ``liftable'' under finite morphisms, paving…

Let $\mathcal{P}$ be a set of $n$ points in the Euclidean plane. We prove that, for any $\epsilon > 0$, either a single line or circle contains $n/2$ points of $\mathcal{P}$, or the number of distinct perpendicular bisectors determined by…

Say that a subset S of the plane is a "circle-center set" if S is not a subset of a line, and whenever we choose three noncollinear points from S, the center of the unique circle through those three points is also an element of S. A problem…

A Delone set in $\mathbb{R}^n$ is a set such that (a) the distance between any two of its points is uniformly bounded below by a strictly positive constant and such that (b) the distance from any point to the remaining points in the set is…

We prove a theorem on the relationships between the lengths of sides of a spherical quadrilateral with three right angles. They are analogous to the relationships in the Lambert quadrilateral in the hyperbolic plane. We apply this theorem…

In a recent paper, C. Gambicchia and A. Pratelli proved a quantitative isoperimetric inequality involving the isoperimetric deficit $\delta(K)$ and the barycentric distance $\lambda_0(K)$ for sets $K\subset \mathbb{R}^N$ with given diameter…

On a convex bounded open set, we prove that Poincar\'e-Sobolev constants for functions vanishing at the boundary can be bounded from below in terms of the norm of the distance function in a suitable Lebesgue space. This generalizes a result…

We study open point sets in Euclidean spaces $\mathbb{R}^d$ without a pair of points an integral distance apart. By a result of Furstenberg, Katznelson, and Weiss such sets must be of Lebesgue upper density zero. We are interested in how…

We consider representations of general non-overlapping placements of rectangles by spatial relations (west, south, east, north) of pairs of rectangles. We call a set of representations complete if it contains a representation of every…

Skewness is a common occurrence in statistical applications. In recent years, various distribution families have been proposed to model skewed data by introducing unequal scales based on the median or mode. However, we argue that the point…

After a short introduction to anti-linearity, bounds for the number of orthogonal (skew) conjugations are proved. They are saturated if the dimension of the Hilbert space is a power of two. For the other dimensions this is an open problem.

In this note, we show that the method of Croot, Lev, and Pach can be used to bound the size of a subset of $F_q^n$ with no three terms in arithmetic progression by $c^n$ with $c < q$. For $q=3$, the problem of finding the largest subset…

We prove a quantitative Roth-type theorem for polynomial corners in $\mathbb{R}^2$. Let $P_1$ and $P_2$ be two linearly independent polynomials with zero constant term. We show that any measurable subset of $[0,1]^2$ with positive measure…

We show that the maximum number of triples on $n$~points, if no three triples span at most five points, is $(1\pm o(1))n^2/5$. More generally, let $f^{(r)}(n;k,s)$ be the maximum number of edges of an $r$-uniform hypergraph on $n$~vertices…

In this paper we consider the problem of bounding the Betti numbers, $b_i(S)$, of a semi-algebraic set $S \subset \R^k$ defined by polynomial inequalities $P_1 \geq 0,...,P_s \geq 0$, where $P_i \in \R[X_1,...,X_k]$ and $\deg(P_i) \leq 2$,…

An approach to the enumeration of feasible parameters for strongly regular graphs is described, based on the pair of structural parameters (a,c) and the positive eigenvalue e. The Krein bound ensures that there are only finitely many…