Related papers: Bounds on Area Involving Lattice Size
Upper and lower bounds are derived for the Gaussian mean width of the intersection of a convex hull of $M$ points with an Euclidean ball of a given radius. The upper bound holds for any collection of extreme point bounded in Euclidean norm.…
In this paper we discuss about properties of lattices and its application in theoretical and algorithmic number theory. This result of Minkowski regarding the lattices initiated the subject of Geometry of Numbers, which uses geometry to…
The width of a convex curve in the plane is the minimal distance between a pair of parallel supporting lines of the curve. In this paper we study the width of nodal lines of eigenfunctions of the Laplacian on the standard flat torus. We…
We investigate lattice packings of Minkowski's balls and domains, as well as the distribution of lattice points on Minkowski's curves which are boundaries of Minkowski's balls. By results of the proof of Minkowski's conjecture about the…
The Plateau-Douglas problem asks to find an area minimizing surface of fixed or bounded genus spanning a given finite collection of Jordan curves in Euclidean space. In the present paper we solve this problem in the setting of proper metric…
We present a short elementary proof of the following Twelve Points Theorem: Let M be a convex polygon with vertices at the lattice points, containing a single lattice point in its interior. Denote by m (resp. m*) the number of lattice…
Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…
This paper studies the lattice agreement problem and proposes a stronger form, $\varepsilon$-bounded lattice agreement, that enforces an additional tightness constraint on the outputs. To formalize the concept, we define a quasi-metric on…
A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…
We study the module $C^r(\mathcal{P})$ of piecewise polynomial functions of smoothness $r$ on a pure $n$-dimensional polytopal complex $\mathcal{P}\subset\mathbb{R}^n$, via an analysis of certain subcomplexes $\mathcal{P}_W$ obtained from…
We prove asymptotic lower bounds on the variance of the number of vertices and missed area of random disc-polygons in convex discs whose boundary is $C_+^2$ smooth. The established lower bounds are of the same order as the upper bounds…
The second and fourth authors have conjectured that a certain hollow tetrahedron $\Delta$ of width $2+\sqrt2$ attains the maximum lattice width among all three-dimensional convex bodies. We here prove a local version of this conjecture:…
A variant of the flatness problem from integer programming is studied, in which one considers convex bodies in $\mathbb{R}^d$ with at most $k$ interior lattice points. The maximum lattice width of such a body is denoted by Flt(d,k) and it…
Given an affine variety X and a finite dimensional vector space of regular functions L on X, we associate a convex body to (X, L) such that its volume is responsible for the number of solutions of a generic system of functions from L. This…
Given a sequence of Marcinkiewicz-Zygmund inequalities in $L_2$ on a usual compact space $\mathcal M$, Gr\"ochenig introduced the weighted least squares polynomials and the least squares quadrature from pointwise samples of a function, and…
In this paper we solve several reverse isoperimetric problems in the class of $\lambda$-convex bodies, i.e., convex bodies whose curvature at each point of their boundary is bounded below by some $\lambda > 0$. We give an affirmative answer…
A Lipschitz space is defined in the Ornstein-Uhlenbeck setting, by means of a bound for the gradient of the Ornstein-Uhlenbeck Poisson integral. This space is then characterized with a Lipschitz-type continuity condition. These functions…
Approximating convex bodies is a fundamental question in geometry, which has a wide variety of applications. Given a convex body $K$ in $\textbf{R}^d$ for fixed $d$, the objective is to minimize the number of facets of an approximating…
We obtain $C^2$ a priori estimates for solutions of the nonlinear second-order elliptic equation related to the geometric problem of finding a strictly locally convex hypersurface with prescribed curvature and boundary in a space form.…
In recent decades, the use of ideas from Minkowski's Geometry of Numbers has gained recognition as a helpful tool in bounding the number of solutions to modular congruences with variables from short intervals. In 1941, Mahler introduced an…