Related papers: Interpolating between volume and lattice point enu…
Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b(\mathcal{P})$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c(\mathcal{P})$ that to the interior of $\mathcal{P}$.…
By studying the volume of a generalized difference body, this paper presents the first nontrivial lower bound for the lattice covering density by $n$-dimensional simplices.
The volume distance from a point p to a convex hypersurface M of the (N+1)-dimensional space is defined as the minimum (N+1)-volume of a region bounded by M and a hyperplane H through the point. This function is differentiable in a…
In this expository paper we discuss the volume product P(K) of convex bodies K in $R^n$; this is the product of volumes of K and its polar K*. The Blaschke- Santalo inequalities state that always $ P(K) \le P(B_2)$ and $ P(B_1)\le P(K)$ .…
We study the volume ratio between projections of two convex bodies. Given a high-dimensional convex body $K$ we show that there is another convex body $L$ such that the volume ratio between any two projections of fixed rank of the bodies…
In a previous article it was shown that when a three-dimensional smooth convex body has rotational symmetry around a coordinate axis one can find better bounds for the lattice point discrepancy than what is known for more general convex…
For Laplace operator in one space dimension, we propose to formulate the heuristic finite volume method with the help of mixed Petrov-Galerkin finite elements. Weighting functions for gradient discretization are parameterized by some…
Let $K \subseteq \mathbb{R}^d$ be a convex body and let $\mathbf{w} \in \operatorname{int}(K)$ be an interior point of $K$. The coefficient of asymmetry $\operatorname{ca}(K,\mathbf{w}) := \min\{ \lambda \geq 1 : \mathbf{w} - K \subseteq…
Let a random simplex in a d-dimensional convex body be the convex hull of d+1 random points from the body. We study the following question: As a function of the convex body, is the expected volume of a random simplex monotone non-decreasing…
In 2021, Ordentlich, Regev and Weiss made a breakthrough that the lattice covering density of any $n$-dimensional convex body is upper bounded by $cn^{2}$, improving on the best previous bound established by Rogers in 1959. However, for the…
We investigate minimal-perimeter configurations of two finite sets of points on the square lattice. This corresponds to a lattice version of the classical double-bubble problem. We give a detailed description of the fine geometry of…
We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming…
A lattice $\Lambda$ is said to be an extension of a sublattice $L$ of smaller rank if $L$ is equal to the intersection of $\Lambda$ with the subspace spanned by $L$. The goal of this paper is to initiate a systematic study of the geometry…
We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…
We obtain asymptotic formulae with optimal error terms for the number of lattice points under and near a dilation of the standard parabola, the former improving upon an old result of Popov. These results can be regarded as achieving the…
This article is a survey of recent results on slicing inequalities for convex bodies. The focus is on the setting of arbitrary measures in place of volume.
An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…
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…
In an earlier paper \cite{mazeng} the authors introduced the notion of curvature entropy, and proved the plane log-Minkowski inequality of curvature entropy under the symmetry assumption. In this paper we demonstrate the plane log-Minkowski…
Latitude on the choice of initialisation is a shared feature between one-step extended state-space and multi-step methods. The paper focuses on lattice Boltzmann schemes, which can be interpreted as examples of both previous categories of…