Related papers: Bounds on the lattice point enumerator via slices …
Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the…
The Cauchy slicings for globally hyperbolic spacetimes and their relation with the causal boundary are surveyed and revisited, starting at the seminal conformal boundary constructions by R. Penrose. Our study covers: (1) adaptive…
In this paper, we establish mean width inequalities of sections and projections of convex bodies for isotropic measures with complete equality conditions, which extends the recent work of Alonso-Guti\'{e}rrez and Brazitikos. Different from…
We adapt an argument of Tao and Vu to show that if $\lambda_1\le\cdots\le\lambda_d$ are the successive minima of an origin-symmetric convex body $K$ with respect to some lattice $\Lambda<\mathbb{R}^d$, and if we set…
This paper provides new bounds on the size of spheres in any coordinate-additive metric with a particular focus on improving existing bounds in the sum-rank metric. We derive improved upper and lower bounds based on the entropy of a…
We prove new versions of the isomorphic Busemann-Petty problem for two different measures and show how these results can be used to recover slicing and distance inequalities. We also prove a sharp upper estimate for the outer volume ratio…
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.…
We prove a pointwise version of the multi-dimensional central limit theorem for convex bodies. Namely, let X be an isotropic random vector in R^n with a log-concave density. For a typical subspace E in R^n of dimension n^c, consider the…
We examine the moments of the number of lattice points in a fixed ball of volume $V$ for lattices in Euclidean space which are modules over the ring of integers of a number field $K$. In particular, denoting by $\omega_K$ the number of…
Herein we prove an upper bound on the number of gravitationally lensed images in a generic multiplane point-mass ensemble with K planes and g_i masses in the ith plane. With E_K and O_K the sums of the even and odd degree terms respectively…
In this note we consider two topics involving the relationship between the symplectic capacity and the mean width of convex bodies in $\mathbb{R}^{2n}$. We first describe an alternative path from the symplectic Brunn-Minkowski inequality of…
We consider the Tarski--Bang problem about covering of convex bodies by planks. The results of this kind give a lower bound on the sum of widths of planks (regions between a pair of parallel hyperplanes) covering a given convex body.…
We derive bounds on the volume of an inclusion in a body in two or three dimensions when the conductivities of the inclusion and the surrounding body are complex and assumed to be known. The bounds are derived in terms of average values of…
We prove a sharp upper bound on the number of boundary lattice points of a rational polygon in terms of its denominator and the number of interior lattice points, generalizing Scott's inequality. We then give sharp lower and upper bounds on…
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…
A detailed combinatorial analysis of planar lattice convex polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained. The…
We generalize the hyperplane inequality in dimensions up to 4 to the setting of arbitrary measures in place of the volume. To prove this generalization we establish stability in the affirmative part of the solution to the Busemann-Petty…
We obtain lower bound for the maximum distance between any three distinct points in an affine lattice which are close to a helix with small curvature and torsion.
The subgradient projection iteration is a classical method for solving a convex inequality. Motivated by works of Polyak and of Crombez, we present and analyze a more general method for finding a fixed point of a cutter, provided that the…
The purpose of this article is to describe a reduction of the slicing problem to the study of the parameter I_1(K,Z_q^o(K))=\int_K ||< :, x> ||_{L_q(K)}dx. We show that an upper bound of the form I_1(K,Z_q^o(K))\leq C_1q^s\sqrt{n}L_K^2,…