اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTriangles capturing many lattice points
129
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study a combinatorial problem that recently arose in the context of shape optimization: among all triangles with vertices $(0,0)$, $(x,0)$, and $(0,y)$ and fixed area, which one encloses the most lattice points from $mathbb{Z}_{>0}^2$? Moreover, does its shape necessarily converge to the isosceles triangle $(x=y)$ as the area becomes large? Laugesen and Liu suggested that, in contrast to similar problems, there might not be a limiting shape. We prove that the limiting set is indeed nontrivial and contains infinitely many elements. We also show that there exist `bad areas where no triangle is particularly good at capturing lattice points and show that there exists an infinite set of slopes $y/x$ such that any associated triangle captures more lattice points than any other fixed triangle for infinitely many (and arbitrarily large) areas; this set of slopes is a fractal subset of $[1/3, 3]$ and has Minkowski dimension at most $3/4$.
قيم البحث
اقرأ أيضاً
We consider an optimal stretching problem for strictly convex domains in $mathbb{R}^d$ that are symmetric with respect to each coordinate hyperplane, where stretching refers to transformation by a diagonal matrix of determinant $1$. Specifically, we
prove that the stretched convex domain which captures the most positive lattice points in the large volume limit is balanced: the $(d-1)$-dimensional measures of the intersections of the domain with each coordinate hyperplane are equal. Our results extend those of Antunes & Freitas, van den Berg, Bucur & Gittins, Ariturk & Laugesen, van den Berg & Gittins, and Gittins & Larson. The approach is motivated by the Fourier analysis techniques used to prove the classical $#{(i,j) in mathbb{Z}^2 : i^2 +j^2 le r^2 } =pi r^2 + mathcal{O}(r^{2/3})$ result for the Gauss circle problem.
Given a family of sets on the plane, we say that the family is intersecting if for any two sets from the family their interiors intersect. In this paper, we study intersecting families of triangles with vertices in a given set of points. In particula
r, we show that if a set $P$ of $n$ points is in convex position, then the largest intersecting family of triangles with vertices in $P$ contains at most $(frac{1}{4}+o(1))binom{n}{3}$ triangles.
Given a convex disk $K$ and a positive integer $k$, let $vartheta_T^k(K)$ and $vartheta_L^k(K)$ denote the $k$-fold translative covering density and the $k$-fold lattice covering density of $K$, respectively. Let $T$ be a triangle. In a very recent p
aper, K. Sriamorn proved that $vartheta_L^k(T)=frac{2k+1}{2}$. In this paper, we will show that $vartheta_T^k(T)=vartheta_L^k(T)$.
We confirm a conjecture of Monical, Tokcan and Yong on a characterization of the lattice points in the Newton polytopes of key polynomials.
We prove the following generalised empty pentagon theorem: for every integer $ell geq 2$, every sufficiently large set of points in the plane contains $ell$ collinear points or an empty pentagon. As an application, we settle the next open case of the
big line or big clique conjecture of Kara, Por, and Wood [emph{Discrete Comput. Geom.} 34(3):497--506, 2005].
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
