Related papers: Interpolating between volume and lattice point enu…
We introduce the arithmetic width of a convex body, defined as the number of distinct values a linear functional attains on the lattice points within the body. Arithmetic width refines lattice width by detecting gaps in the lattice point…
In this paper, we deal with the successive inner and outer radii with respect to Orlicz Minkowski sum. The upper and lower bounds for the radii of the Orlicz Minkowski sum of two convex bodies are established.
We prove the log-Brunn-Minkowski conjecture for convex bodies with symmetries to $n$ independent hyperplanes, and discuss the equality case and the uniqueness of the solution of the related case of the logarithmic Minkowski problem. We also…
The Brunn-Minkowski theory in convex geometry concerns, among other things, the volumes, mixed volumes, and surface area measures of convex bodies. We study generalizations of these concepts to Borel measures with density in…
In this note, we estimate the upper bound of volume of closed positively or nonnegatively curved Alexandrov space $X$ with strictly convex boundary. We also discuss the equality case. In particular, the Boundary Conjecture holds when the…
We extend the results of Bey, Hen, and Wills (http://arxiv.org/abs/math/0606089). In this paper, we show that, up to equivalence under unimodular transformations, there is exactly one class of $d$-simplices having $k \ge 1$ interior lattice…
We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…
We give the sharp lower bound of the volume product of three dimensional convex bodies which are invariant under two kinds of discrete subgroups of $O(3)$ of order four. We also characterize the convex bodies with the minimal volume product…
We study periodic tessellations of the Euclidean space with unequal cells arising from the minimization of perimeter functionals. Existence results and qualitative properties of minimizers are discussed for different classes of problems,…
The goal of this paper is to continue the study of the relation between the Poincar\'e inequality and the lower bounds of Minkowski content of separating sets, initiated in our previous work [Caputo, Cavallucci: Poincar\'e inequality and…
The enumeration of normal surfaces is a key bottleneck in computational three-dimensional topology. The underlying procedure is the enumeration of admissible vertices of a high-dimensional polytope, where admissibility is a powerful but…
The Blaschke-Santal\'{o} inequality is a classical inequality in convex geometry concerning the volume of a convex body and that of its dual. In this work we investigate an analogue of this inequality in the context of billiard dynamical…
The parametric lattice-point counting problem is as follows: Given an integer matrix $A \in Z^{m \times n}$, compute an explicit formula parameterized by $b \in R^m$ that determines the number of integer points in the polyhedron $\{x \in…
We consider the variation of von Neumann entropy of subsystem reduced states of general many- body lattice spin systems due to local quantum quenches. We obtain Lieb-Robinson-like bounds that are independent of the subsystem volume. The…
We establish some important inequalities under a lower weighted Ricci curvature bound on Finsler manifolds. Firstly, we establish a relative volume comparison of Bishop-Gromov type. As one of the applications, we obtain an upper bound for…
The present note is a result of an on-going investigation into the logarithmic Brunn-Minkowski inequality. We obtain lower estimates on the volume product for convex bodies in $\mathbb{R}^n$ not necessarily symmetric with respect to the…
The Lasserre or moment-sum-of-square hierarchy of linear matrix inequality relaxations is used to compute inner approximations of the maximal positively invariant set for continuous-time dynamical systems with polynomial vector fields.…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…
The classical Loomis-Whitney inequality and the uniform cover inequality of Bollob\'{a}s and Thomason provide lower bounds for the volume of a compact set in terms of its lower dimensional coordinate projections. We provide further…
The long-standing Godbersen's conjecture asserts that the Rogers-Shephard inequality for the volume of the difference body is refined by an inequality for the mixed volume of a convex body and its reflection about the origin. The conjecture…