Related papers: On Random Simplex Picking Beyond the Blashke Probl…
We develop a simple model to study classical fields on the background of a fluctuating spacetime volume. It is applied to formulate the stochastic Einstein equations with a perfect-fluid source. We investigate the particular case of a…
Solutions to a linear Diophantine system, or lattice points in a rational convex polytope, are important concepts in algebraic combinatorics and computational geometry. The enumeration problem is fundamental and has been well studied,…
Using the translation method of Tartar, Murat, Lurie, and Cherkaev bounds are derived on the volume occupied by an inclusion in a three-dimensional conducting body. They assume electrical impedance tomography measurements have been made for…
For most optimisation methods an essential assumption is the vector space structure of the feasible set. This condition is not fulfilled if we consider optimisation problems over the sphere. We present an algorithm for solving a special…
In this work, based on consideration of periodicity and asymptotic forms of wave function, we propose a novel approach to the solution of finite volume three-body problem by mapping a three-body problem into a higher dimensional two-body…
We give a new proof for the well-known Blaschke--Petkantschin formula which is based on the polar decomposition of rectangular matrices and may be of interest in random matrix theory.
The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…
Fr\'echet means, conceptually appealing, generalize the Euclidean expectation to general metric spaces. We explore how well Fr\'echet means can be estimated from independent and identically distributed samples and uncover a fundamental…
Chv\'{a}tal and Klincsek (1980) gave an $O(n^3)$-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set $P$ of $n$ points in the plane. This paper examines a generalization of the problem,…
We present a higher order space-time unfitted finite element method for convection-diffusion problems on coupled (surface and bulk) domains. In that way, we combine a method suggested by Heimann, Lehrenfeld, Preu{\ss} (SIAM J. Sci. Comput.…
We show that the chaos representation of some Compound Poisson Type processes displays an underlying intrinsic combinatorial structure, partly independent of the chosen process. From the computational viewpoint, we solve the arising…
Universal (pointwise uniform and time shifted) truncation error upper bounds are presented for the Whittaker--Kotel'nikov--Shannon (WKS) sampling restoration sum for Bernstein function classes $B_{\pi,d}^q,\, q>1,\, d\in \mathbb N$, when…
In this paper, we propose a sparse spectral-Galerkin approximation scheme for solving the second-order partial differential equations on an arbitrary tetrahedron. Generalized Koornwinder polynomials are introduced on the reference…
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…
Numerous tasks in imaging and vision can be formulated as variational problems over vector-valued maps. We approach the relaxation and convexification of such vectorial variational problems via a lifting to the space of currents. To that…
We consider solving the Laplace-Beltrami problem on a smooth two dimensional surface embedded into a three dimensional space meshed with tetrahedra. The mesh does not respect the surface and thus the surface cuts through the elements. We…
Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a flat defined by two parallel hyperplanes.…
The width of a closed convex subset of Euclidean space is the distance between two parallel supporting planes. The Blaschke-Lebesgue problem consists of minimizing the volume in the class of convex sets of fixed constant width and is still…
The standard numerical approach to determining matrix elements of local operators and width of resonances uses the finite volume dependence of energy levels and matrix elements. Finite size corrections that decay exponentially in the volume…
The main theme of this dissertation is the study of the lattice points in a rational convex polyhedron and their encoding in terms of Barvinok's short rational functions. The first part of this thesis looks into theoretical applications of…