Related papers: Simultaneous packing and covering in the two-dimen…
Lebesgue's universal covering problem is re-examined using computational methods. This leads to conjectures about the nature of the solution which if correct could provide a blueprint for a complete solution. Empirical lower bounds for the…
We prove optimal convergence rates for the discretization of a general second-order linear elliptic PDE with an adaptive vertex-centered finite volume scheme. While our prior work Erath and Praetorius [SIAM J. Numer. Anal., 54 (2016), pp.…
This is the sequel to our first paper concerning the balanced embedding of a non-compact complex manifold into an infinite-dimensional projective space. We prove the uniqueness of such an embedding. The proof relies on fine estimates of the…
Given N points in the plane $P_1 P_2...P_N$ and a location $\Omega$, the union of discs with diameters $[\Omega P_i], i = 1, 2,...N$ covers the convex hull of the points. The location $\Omega_s$ minimizing the area covered by the union of…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…
We provide a new characterisation of the decades old open problem of extending bilipschitz mappings given on a Euclidean separated net. In particular, this allows for the complete positive solution of the open problem in dimension two.…
We give a sharp lower bound to the largest possible Euclidean norm of signed sums of $n$ vectors in the plane. This is achieved by connecting the signed vector sum problem to the isoperimetric problem for the circumradius of polygons. In…
We discuss the cosmological constant problem in the context of higher codimension brane world scenarios with infinite-volume extra dimensions. In particular, by adding higher curvature terms in the bulk action we are able to find smooth…
The Euclidean projection onto a convex set is an important problem that arises in numerous constrained optimization tasks. Unfortunately, in many cases, computing projections is computationally demanding. In this work, we focus on…
We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…
Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems…
Problems with localized nonhomogeneous material properties present well-known challenges for numerical simulations. In particular, such problems may feature large differences in length scales, causing difficulties with meshing and…
We develop a general strategy in order to implement (approximate) discrete transparent boundary conditions for finite difference approximations of the two-dimensional transport equation. The computational domain is a rectangle equipped with…
This paper is the second part of a threefold article, aimed at solving numerically the Poisson problem in three-dimensional prismatic or axisymmetric domains. In the first part of this series, the Fourier Singular Complement Method was…
In this paper, we investigate universal estimates for eigenvalues of a buckling problem. For a bounded domain in a Euclidean space, we give a positive contribution for obtaining a sharp universal inequality for eigenvalues of the buckling…
Let $C_{\theta}$ be a circular cone in Euclidean space $\mathbb{R}^{3}$,which apex is the origin and apex angle of the cone is $\theta\in \left(\pi/3, \pi\right)$. Let $M_\theta$ be the class of compact convex domains in Euclidean space…
The exact solution of Terzaghi's consolidation equation has further highlighted the limits of this theory in the one-dimensional field as, like Taylor's approximate solution, it overestimates the decay times of the phenomenon; on the other…
By rectangle packing we mean putting a set of rectangles into an enclosing rectangle, without any overlapping. We begin with perfect rectangle packing problems, then prove two continuity properties for parallel rectangle packing problems,…
This work revolves around the two following questions: Given a convex body $C\subset\mathbb{R}^d$, a positive integer $k$ and a finite set $S\subset\mathbb{R}^d$ (or a finite Borel measure $\mu$ on $\mathbb{R}^d$), how many homothets of $C$…