Related papers: On Random Simplex Picking Beyond the Blashke Probl…
A variant of the Falconer distance problem asks for fixed $k\geq 1$ and $d\geq k+1$, how large does the Hausdorff dimension of a Borel set $E\subset\mathbb{R}^d$ need to be to guarantee that there exist $x_0,\ldots,x_{k}\in E$ such that…
We describe the computation of polytope volumes by descent in the face lattice, its implementation in Normaliz, and the connection to reverse-lexicographic triangulations. The efficiency of the algorithm is demonstrated by several high…
The generalized problem of moments is a conic linear optimization problem over the convex cone of positive Borel measures with given support. It has a large variety of applications, including global optimization of polynomials and rational…
We derive explicit expressions for the volume elements of both the minimal and maximal monotone metrics over the (n^{2} - 1)-dimensional convex set of n x n density matrices for the cases n = 3 and 4. We make further progress for the…
A Radial Basis Function Generated Finite-Differences (RBF-FD) inspired technique for evaluating definite integrals over the volume of the ball in three dimensions is described. Such methods are necessary in many areas of Applied…
Spontaneous symmetry breaking is a fundamental notion in modern physics, ranging from high energy to condensed matter. However, the usual spontaneous symmetry breaking only considers the equal probability to select the vacua. In this work,…
A general device is proposed, which provides for extension of exponential inequalities for sums of independent real-valued random variables to those for martingales in the 2-smooth Banach spaces. This is used to obtain optimum bounds of the…
The celebrated Dvoretzky theorem asserts that every $N$-dimensional convex body admits central sections of dimension $d = \Omega(\log N)$, which is nearly spherical. For many instances of convex bodies, typically unit balls with respect to…
In this paper, we generalize the chance optimization problems and introduce constrained volume optimization where enables us to obtain convex formulation for challenging problems in systems and control. We show that many different problems…
The three-particle quantization condition is partially diagonalized in the center-of-mass frame by using cubic symmetry on the lattice. To this end, instead of spherical harmonics, the kernel of the Bethe-Salpeter equation for…
We present the first numerical investigation of the method proposed in Ref. [1] to utilize gradient flow to obtain precise determinations of higher moments of PDFs from lattice QCD, circumventing power divergent mixing with lower…
Shrinkage of large particles, either through depolymerisation (i.e. progressive shortening) or through fragmentation (breakage into smaller pieces) may be modelled by discrete equations, of Becker-D\''oring type, or by continuous ones. In…
We study the volume of unit balls $B^n_{p,q}$ of finite-dimensional Lorentz sequence spaces $\ell_{p,q}^n.$ We give an iterative formula for ${\rm vol}(B^n_{p,q})$ for the weak Lebesgue spaces with $q=\infty$ and explicit formulas for $q=1$…
We evaluate the variance of the number of lattice points in a small randomly rotated spherical ball on a surface of 3-dimensional sphere centered at the origin. Previously, Bourgain, Rudnick, and Sarnak showed conditionally on the…
We study dual volume sampling, a method for selecting k columns from an n x m short and wide matrix (n <= k <= m) such that the probability of selection is proportional to the volume spanned by the rows of the induced submatrix. This method…
We establish central limit theorems for natural volumes of random inscribed polytopes in projective Riemannian or Finsler geometries. In addition, normal approximation of dual volumes and the mean width of random polyhedral sets are…
In this paper, we consider the numerical solution of the one-dimensional Schr\"odinger equation with a periodic lattice potential and a random external potential. This is an important model in solid state physics where the randomness is…
We study the problem of finding the Lowner-John ellipsoid, i.e., an ellipsoid with minimum volume that contains a given convex set. We reformulate the problem as a generalized copositive program, and use that reformulation to derive…
We establish formulae for the moments of the moments of the characteristic polynomials of random orthogonal and symplectic matrices in terms of certain lattice point count problems. This allows us to establish asymptotic formulae when the…
We present a method to extend the finite element library FEniCS to solve problems with domains in dimensions above three by constructing tensor product finite elements. This methodology only requires that the high dimensional domain is…