Related papers: Triangles capturing many lattice points

In this paper, we consider integral maximal lattice-free simplices. Such simplices have integer vertices and contain integer points in the relative interior of each of their facets, but no integer point is allowed in the full interior. In…

Assume we are given a set of parallel line segments in the plane, and we wish to place a point on each line segment such that the resulting point set maximizes or minimizes the area of the largest or smallest triangle in the set. We analyze…

For large $R$, we consider measurable sets $A\subseteq [0,R]^2$ that avoid triples of points of the form $(x,y)$, $(x+t,y)$, $(x,y+1/t)$ with $x,y\in\mathbb{R}$ and $t>0$, i.e., the vertices of upward-oriented, axis-aligned right triangles…

We consider random lattice triangulations of $n\times k$ rectangular regions with weight $\lambda^{|\sigma|}$ where $\lambda>0$ is a parameter and $|\sigma|$ denotes the total edge length of the triangulation. When $\lambda\in(0,1)$ and $k$…

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…

We study sets of triple points of B\"{o}r\"{o}czky's arrangements of lines in the context of the containment problem proposed by Harbourne and Huneke. We show that in the class of those arrangements, the smallest counterexample to the…

By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $\lfloor \frac{n^{2}}{4} \rfloor+1$ edges must contain a triangle. A theorem of Erd\H{o}s gives a strengthening: there are not only one, but at least…

We map certain highly correlated electron systems on lattices with geometrical frustration in the motion of added particles or holes to the spatial defect-defect correlations of dimer models in different geometries. These models are studied…

Let $K$ be a maximal lattice-free set in $\mathbb{R}^d$, that is, $K$ is convex and closed subset of $\mathbb{R}^d$, the interior of $K$ does not cointain points of $\mathbb{Z}^d$ and $K$ is inclusion-maximal with respect to the above…

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

Given a triangle $\Delta$, we study the problem of determining the smallest enclosing and largest embedded isosceles triangles of $\Delta$ with respect to area and perimeter. This problem was initially posed by Nandakumar and was first…

We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include convex subsets of…

Brauer and Thrall conjectured that a finite-dimensional algebra over a field of bounded representation type is actually of finite representation type and a finite-dimensional algebra (over an infinite field) of infinite representation type…

We introduce a pointfree theory of convergence on lattices and coframes. A convergence lattice is a lattice $L$ with a monotonic map $\lim_L$ from the lattice of filters on $L$ to $L$, meant to be an abstract version of the map sending…

We give a short proof of the fact that there are no measurable subsets of Euclidean space (in dimension d > 2), which, no matter how translated and rotated, always contain exactly one integer lattice point. In dimension d=2 (the original…

The objective here is to find the maximum polygon, in area, which can be enclosed in a given triangle, for the polygons: parallelograms, rectangles and squares. It will initially be assumed that the choices are inscribed polygons, that is…

We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…

A convex set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattice-free convex sets are known to be polyhedra. The precision…

The search for optimal configurations of pointsets, the most notable examples being the problems of Kepler and Thompson, have an extremely rich history with diverse applications in physics, chemistry, communication theory, and scientific…

We adapt an argument of Tao and Vu to show that if $\lambda_1\le\cdots\le\lambda_d$ are the successive minima of an origin-symmetric convex body $K$ with respect to some lattice $\Lambda<\mathbb{R}^d$, and if we set…