Related papers: Minimal Banach-Tarski Decompositions
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
We explore an optimal partition problem on surfaces using a computational approach. The problem is to minimise the sum of the first Dirichlet Laplace--Beltrami operator eigenvalues over a given number of partitions of a surface. We consider…
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the…
We introduce a recursive procedure for computing the number of realizations of a minimally rigid graph on the sphere up to rotations. We accomplish this by combining two ingredients. The first is a framework that allows us to think of such…
We prove that almost every triangle can be dissected only into $n^2$ triangles which have to be equal one another. Moreover, such a dissection is unique for every $n$. It turns out that to solve this "simple" problem it is convenient to use…
Theoretical background is provided towards the mathematical foundation of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the…
It was shown by Ramanathan \cite{R} that any compact oriented non-simply-connected minimal surface in the three-dimensional round sphere admits at most a finite set of pairwise noncongruent minimal isometric immersions. Here we show that…
We study the problem of partitioning a given simple polygon $P$ into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for constructing such partitions that works for several notions of…
In shape optimisation it is desirable to obtain deformations of a given mesh without negative impact on the mesh quality. We propose a new algorithm using least square formulations of the Cauchy-Riemann equations. Our method allows to…
In this paper we define a small variation of the Taylor method and a formula for the global error of this new numerical method that allows us to keep track of the round-off error and does not require previous knowledge of the exact…
It was recently observed that chiral two-body interactions can be efficiently represented using matrix factorization techniques such as the singular value decomposition. However, the exploitation of these low-rank structures in a few- or…
We find tight estimates for the minimum number of proper subspaces needed to cover all lattice points in an n-dimensional convex body symmetric about the origin. We also find the order of magnitude of the number of (n-1)-dimensional…
We show some results related to the classical Banach-Tarski paradox in the setting of finite-dimensional normed spaces over a non-Archimedean valued field $K$. For instance, all balls and spheres in $K^n$, and the whole space $K^n$ (for…
For three-body problem, R.Montgomery [3] proved a reconstruction formula which calculates the overall rotation relating two similar triangle configurations if the initial triangular configuration is similar to the configuration formed at…
In analogy with the classical Minkowski problem, necessary and sufficient conditions are given to assure that a given measure on the unit sphere is the cone-volume measure of the unit ball of a finite dimensional Banach space.
The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was…
We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and…
The problem of writing a totally positive element as a sum of squares has a long history in mathematics, going back to Bachet and Lagrange. While for some specific rings (like integers or polynomials over the rationals), there are known…
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems,…
Assembling parts into an object is a combinatorial problem that arises in a variety of contexts in the real world and involves numerous applications in science and engineering. Previous related work tackles limited cases with identical unit…