相关论文: Stretching convex domains to capture many lattice …

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…

We study an optimal stretching problem, which is a variant lattice point problem, for convex domains in $\mathbb{R}^d$ ($d\geq 2$) with smooth boundary of finite type that are symmetric with respect to each coordinate hyperplane/axis. We…

We aim to maximize the number of first-quadrant lattice points in a convex domain with respect to reciprocal stretching in the coordinate directions. The optimal domain is shown to be asymptotically balanced, meaning that the stretch factor…

We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…

Suppose we count the positive integer lattice points beneath a convex decreasing curve in the first quadrant having equal intercepts. Then stretch in the coordinate directions so as to preserve the area under the curve, and again count…

We prove a sharp upper bound on convex domains, in terms of the diameter alone, of the best constant in a class of weighted Poincar\'e inequalities. The key point is the study of an optimal weighted Wirtinger inequality.

If $\mathcal{B}\subset \mathbb{R}^d$ ($d\geqslant 2$) is a compact convex domain with a smooth boundary of finite type, we prove that for almost every rotation $\theta\in SO(d)$ the remainder of the lattice point problem, $P_{\theta…

We consider planar curved strictly convex domains with no or very weak smoothness assumptions and prove sharp bounds for square-functions associated to the lattice point discrepancy.

We prove the following for a bounded convex planar domain that is symmetric with respect to both coordinate axes. Consider a centered rectangle with sides parallel to the axes that strictly contains the domain. If the domain is not a…

This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…

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…

This paper determines the optimal upper bound for the simultaneous packing and covering constants of the two-dimensional centrally symmetric convex domains. It solved a problem opening for more than thirty years.

Let $\mathcal{B}$ be a compact convex planar domain with smooth boundary of finite type and $\mathcal{B}_\theta$ its rotation by an angle $\theta$. We prove that for almost every $\theta\in[0, 2\pi]$ the remainder…

We study translative arrangements of centrally symmetric convex domains in the plane (resp., of congruent balls in the Euclidean $3$-space) that neither pack nor cover. We define their soft density depending on a soft parameter and prove…

We study the lattice point problem associated with a special class of high-dimensional finite type domains via estimating the Fourier transforms of corresponding indicator functions.

The present work surveys problems in $n$-dimensional space with $n$ large. Early development in the study of packing and covering in high dimensions was motivated by the geometry of numbers. Subsequent results, such as the discovery of the…

Given a hyperbolic domain, the nearest point retraction is a conformally natural homotopy equivalence from the domain to the boundary of the convex core of its complement. Marden and Markovic showed that if the domain is uniformly perfect,…

It has been a widely belief that for a planar convex domain with two coordinate axes of symmetry, the location of maximal norm of gradient of torsion function is either linked to contact points of largest inscribed circle or connected to…

Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…

For any sequence of properly convex domains in the real projective plane such that the zeros of Pick differentials have bounded multiplicity and get further and further apart, we determined all Hausdorff limit domains that one can obtain…