Related papers: Triangles capturing many lattice points

The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. This paper deals with finding perfect matchings, spanning trees, or…

We present an intriguing question about lattice points in triangles where Pick's formula is "almost correct". The question has its origin in knot theory, but its statement is purely combinatorial. After more than 30 years the topological…

Witsenhausen's problem asks for the maximum fraction $\alpha_n$ of the $n$-dimensional unit sphere that can be covered by a measurable set containing no pairs of orthogonal points. The best upper bounds for $\alpha_n$ are given by…

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…

We determine the shape of all sum-free sets in $\{1,2,\ldots,n\}^2$ of size close to the maximum $\frac{3}{5}n^2$, solving a problem of Elsholtz and Rackham. We show that all such asymptotic maximum sum-free sets lie completely in the…

Aiming at the study of critical phenomena in the presence of boundaries with a non-trivial shape we discuss how lattices with an adaptive lattice spacing can be implemented. Since the parameters of the Hamiltonian transform non-trivially…

Minkowski's second theorem on successive minima asserts that the volume of a 0-symmetric convex body K over the covolume of a lattice \Lambda can be bounded above by a quantity involving all the successive minima of K with respect to…

We prove a discrete analogue to a classical isoperimetric theorem of Weil for surfaces with non-positive curvature. It is shown that hexagons in the triangular lattice have maximal volume among all sets of a given boundary in any…

A rational triangle $T$ (one whose angles are rational multiples of $\pi$) unfolds to a translation surface $(X_T,\omega_T)$. The lattice triangle problem asks to classify those $T$ for which $(X_T,\omega_T)$ is a Veech (lattice) surface,…

In a containment problem, the goal is to preprocess a set of geometric objects so that, given a geometric query object, we can report all the objects containing the query object. We consider the containment problem where input objects are…

This paper studies a problem of Erd\"{o}s concerning lattice cubes. Given an $N \times N \times N$ lattice cube, we want to find the maximum number of vertices one can select so that no eight corners of a rectangular box are chosen…

We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…

We study an optimal stretching problem for certain convex domain in $\mathbb{R}^d$ ($d\geq 3$) whose boundary has points of vanishing Gaussian curvature. We prove that the optimal domain which contains the most positive (or least…

Planar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao has shown recently that the maximum possible…

This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…

It is conjectured that if a finite set of points in the plane contains many collinear triples then there is some structure in the set. We are going to show that under some combinatorial conditions such pointsets contain special…

One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…

In this paper, we propose a class of elementary plane geometry problems closely related to the title of this paper. Here, a circle is the 1-dimensional curve bounding a disk. For any nonnegative integer, a circle is called $n$-enclosing if…

We calculate the area of the smallest triangle and the area of the smallest virtual triangle for many known lattice surfaces. We show that our list of the lattice surfaces for which the area of the smallest virtual triangle greater than .05…

Nonexpansive mappings play a central role in modern optimization and monotone operator theory because their fixed points can describe solutions to optimization or critical point problems. It is known that when the mappings are sufficiently…