Related papers: On Random Simplex Picking Beyond the Blashke Probl…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are…
We derive the effective cosmological equations for a non-$\mathbb{Z}_2$ symmetric codimension one brane embedded in an arbitrary D-dimensional bulk spacetime, generalizing the $D=5,6$ cases much studied previously. As a particular case,…
We consider the problem of estimating the volume of a compact domain in a Euclidean space based on a uniform sample from the domain. We assume the domain has a boundary with positive reach. We propose a data splitting approach to correct…
We examine how the measure and the number of vertices of the convex hull of a random sample of $n$ points from an arbitrary probability measure in $\mathbf{R}^d$ relates to the wet part of that measure. This extends classical results for…
Volume is a natural geometric measure for comparing polyhedral relaxations of non-convex sets. Speakman and Lee gave volume formulae for comparing relaxations of trilinear monomials, quantifying the strength of various natural relaxations.…
In this paper, we will introduce a high order numerical method to solve the scattering problems with non-periodic incident fields and (locally perturbed) periodic surfaces. For the problems we are considering, the classical methods to treat…
We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…
It was shown by G. Pisier that any finite-dimensional normed space admits an $\alpha$-regular $M$-position, guaranteeing not only regular entropy estimates but moreover regular estimates on the diameters of minimal sections of its unit-ball…
Consider a random $d$-dimensional simplex whose vertices are $d+1$ random points sampled independently and uniformly from the unit sphere in $\mathbb R^d$. We show that the expected sum of solid angles at the vertices of this random simplex…
We introduce a space-time Trefftz discontinuous Galerkin method for the first-order transient acoustic wave equations in arbitrary space dimensions, extending the one dimensional scheme of Kretzschmar et al. (2016, IMA J. Numer. Anal., 36,…
We consider the numerical solution of time-harmonic acoustic scattering by obstacles with uncertain geometries for Dirichlet, Neumann, impedance and transmission boundary conditions. In particular, we aim to quantify diffracted fields…
Spherical symmetry arguments are used to produce a general device to convert identities and inequalities for the $p$th absolute moments of real-valued random variables into the corresponding identities and inequalities for the $p$th moments…
We consider a random variable expressed as the Euclidean distance between an arbitrary point and a random variable uniformly distributed in a closed and bounded set of a three-dimensional Euclidean space. Four cases are considered for this…
We investigate the performance of the finite volume method in solving viscoplastic flows. The creeping square lid-driven cavity flow of a Bingham plastic is chosen as the test case and the constitutive equation is regularised as proposed by…
Optimally convergent (with respect to the regularity) quadratic finite element method for two dimensional obstacle problem on simplicial meshes is studied in (Brezzi, Hager, Raviart, Numer. Math, 28:431--443, 1977). There was no analogue of…
We investigate the average number of lattice points within a ball for the $n$th cyclotomic number field, where the lattice is chosen at random from the set of unit determinant ideal lattices of the field. We show that this average is nearly…
We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of…
Define a body A to be able to hide behind a body B if the orthogonal projection of B contains a translation of the corresponding orthogonal projection of A in every direction. In two dimensions, it is easy to observe that there exist two…
We propose a novel and simple method of computing the volume of the moduli space of BPS solitons in supersymmetric gauge theory. We use a D-brane realization of vortices and T-duality relation to domain walls. We there use a special limit…