Related papers: How to compute the volume in low dimension?
The isoperimetric problem with a density or weighting seeks to enclose prescribed weighted area with minimum weighted perimeter. According to Chambers' recent proof of the Log Convex Density Conjecture, for many densities on $\mathbb{R}^n$…
A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…
Given an $n$-dimensional convex body by a membership oracle in general, it is known that any polynomial-time deterministic algorithm cannot approximate its volume within ratio $(n/\log n)^n$. There is a substantial progress on randomized…
This paper develops a unified framework for estimating the volume of a set in $\mathbb{R}^d$ based on observations of points uniformly distributed over the set. The framework applies to all classes of sets satisfying one simple axiom: a…
We study the infimum of the renormalized volume for convex-cocompact hyperbolic manifolds, as well as describing how a sequence converging to such values behaves. In particular, we show that the renormalized volume is continuous under the…
We survey results concerning sharp estimates on volumes of sections and projections of certain convex bodies, mainly $\ell_p$ balls, by and onto lower dimensional subspaces. This subject emerged from geometry of numbers several decades ago…
Speakman and Lee (2017) gave a formula for the volume of the convex hull of the graph of a trilinear monomial, $y=x_1x_2x_3$, over a box in the nonnegative orthant, in terms of the upper and lower bounds on the variables. This was done in…
Generalized contextuality is a hallmark of nonclassical theories like quantum mechanics. Yet, three fundamental computational problems concerning its decidability and complexity remain open. First, determining the complexity of deciding if…
Consider a set $P \subseteq \Re^d$ of $n$ points, and a convex body $C$ provided via a separation oracle. The task at hand is to decide for each point of $P$ if it is in $C$ using the fewest number of oracle queries. We show that one can…
We construct a family of functions suitable for establishing lower bounds on the oracle complexity of first-order minimization of smooth strongly-convex functions. Based on this construction, we derive new lower bounds on the complexity of…
We note that known methods achieving the optimal oracle complexity for first order convex optimization require quadratic memory, and ask whether this is necessary, and more broadly seek to characterize the minimax number of first order…
The current paper presents a novel machinery for studying non-asymptotic minimax estimation of high-dimensional matrices, which yields tight minimax rates for a large collection of loss functions in a variety of problems. Based on the…
Given a hypothesis space, the large volume principle by Vladimir Vapnik prioritizes equivalence classes according to their volume in the hypothesis space. The volume approximation has hitherto been successfully applied to binary learning…
The new result of this paper connected with the following problem: Consider a supporting hyperplane of a regular simplex and its re ected image at this hyperplane. When will be the volume of the convex hull of these two simplices maximal?…
We study the integration and approximation problems for monotone and convex bounded functions that depend on $d$ variables, where $d$ can be arbitrarily large. We consider the worst case error for algorithms that use finitely many function…
The 3d volume inside a spherical black hole can be defined by extending an intrinsic flat-spacetime characterization of the volume inside a 2-sphere. For a collapsed object, the volume grows with time since the collapse, reaching a simple…
In this note we examine the volume of the convex hull of two congruent copies of a convex body in Euclidean $n$-space, under some subsets of the isometry group of the space. We prove inequalities for this volume if the two bodies are…
In this short survey we want to present some of the impact of Minkowski's successive minima within Convex and Discrete Geometry. Originally related to the volume of an $o$-symmetric convex body, we point out relations of the successive…
We provide a general framework to construct finite dimensional approximations of the space of convex functions, which also applies to the space of c-convex functions and to the space of support functions of convex bodies. We give estimates…
This paper collects some important formulas on hyperbolic volume. To determine concrete values of volume function is a very hard question requiring the knowledge of various methods. Our goal to give a non-elementary integral on the volume…