Related papers: Algebraic methods for computing smallest enclosing…
Riemannian optimization uses local methods to solve optimization problems whose constraint set is a smooth manifold. A linear step along some descent direction usually leaves the constraints, and hence retraction maps are used to…
A regular polygon circumscribing another regular polygon (with a different side number) may be tightened to minimize the difference of both areas. The manuscripts computes the optimum result under the restriction that both polygons are…
We formulate and give partial answers to several combinatorial problems on volumes of simplices determined by $n$ points in 3-space, and in general in $d$ dimensions. (i) The number of tetrahedra of minimum (nonzero) volume spanned by $n$…
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary accuracy, defined by $\epsilon >0$, and in time complexity…
We give a Clifford correspondence for an algebra A over an algebraically closed field, that is an algorithm for constructing some finite-dimensional simple A-modules from simple modules for a subalgebra and endomorphism algebras. This…
A high-level description of an algorithm which computes the minimum perimeter triangle enclosing a convex polygon in linear time exists in the literature. Besides that an implementation of the algorithm is given in the subsequent work.…
We show that for the regular n-simplex, the 1-codimensional central slice that's parallel to a facet will achieve the minimum area (up to a 1-o(1) factor) among all 1-codimensional central slices, thus improving the previous best known…
In this paper, we consider the problem of finding the hypersurface M^n in the Euclidean (n+1)-space R^{n+1} that satisfies an equation of mean curvature type, called singular minimal hypersurface equation. Such an equation physically…
The sliding cubes model is a well-established theoretical framework that supports the analysis of reconfiguration algorithms for modular robots consisting of face-connected cubes. The best algorithm currently known for the reconfiguration…
A translation surface of Euclidean space $\r^3$ is the sum of two regular curves $\alpha$ and $\beta$, called the generating curves. In this paper we classify the minimal translation surfaces of $\r^3$ and we give a method of construction…
A triangulation of a circle bundle $ E \xrightarrow[\text{}]{\pi} B$ is a triangulation of the total space $E$ and the base $B$ such that the projection $\pi$ is a simplicial map. In the paper we address the following questions: Which…
In [5], Colding-Ilmanen-Minicozzi-White showed that within the class of closed smooth self-shrinkers in $\mathbb{R}^{n+1}$, the entropy is uniquely minimized at the round sphere. They conjectured that, for $2\leq n\leq 6$, the round sphere…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
We solve a long-standing open problem about the optimal codebook structure of codes in $n$-dimensional Euclidean space that consist of $n+1$ codewords subject to a codeword energy constraint, in terms of minimizing the average decoding…
We construct a new class of maximal acyclic matchings on the Salvetti complex of a locally finite hyperplane arrangement. Using discrete Morse theory, we then obtain an explicit proof of the minimality of the complement. Our construction…
We extend the results of B. Minemyer by showing that any indefinite metric polyhedron (either compact or not) with the vertex degree bounded from above admits an isometric simplicial embedding into a Minkowski space of the lowest possible…
In 1970, Lawson solved the topological realization problem for minimal surfaces in the sphere, showing that any closed orientable surface can be minimally embedded in $\mathbb{S}^3$. The analogous problem for surfaces with boundary was…
We show the regularity of, and derive a-priori estimates for (weakly) harmonic maps from a Riemannian manifold into a Euclidean sphere under the assumption that the image avoids some neighborhood of a half-equator. The proofs combine…
We observe structure in the sequences of quotients and remainders of the Euclidean algorithm with two families of inputs. Analyzing the remainders, we obtain new algorithms for computing modular inverses and representating prime numbers by…
In this paper, we propose a class of elementary plane geometry problems closely related to the title of this paper. Here, a circle is the 1-dimensional curve bounding a disk. For any nonnegative integer, a circle is called $n$-enclosing if…