Related papers: Minimal Banach-Tarski Decompositions
A reformulation of the three circles theorem of Johnson with distance coordinates to the vertices of a triangle is explicitly represented in a polynomial system and solved by symbolic computation. A similar polynomial system in distance…
We propose a Monte Carlo method to efficiently find, count, and sample abstract triangulations of a given manifold M. The method is based on a biased random walk through all possible triangulations of M (in the Pachner graph), constructed…
Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…
We prove that any diffeomorphism of the sphere S^n to itself can be decomposed into bi-Lipschitz mappings of small isometric distortion and which move points a small amount in the spherical metric.
We determine upper and lower bounds for the minimal number of balls of a given radius needed to cover the space of schlicht functions.
The initial-value problem is posed by giving a conformal three-metric on each of two nearby spacelike hypersurfaces, their proper-time separation up to a multiplier to be determined, and the mean (extrinsic) curvature of one slice. The…
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletion of e results in a graph that is not a brick. We prove a…
Our main result essentially reduces the problem of finding an edge-decomposition of a balanced r-partite graph of large minimum degree into r-cliques to the problem of finding a fractional r-clique decomposition or an approximate one.…
A square trisection is a problem of assembling three identical squares from a larger square, using a minimal number of pieces. This paper presents an historical overview of the square trisection problem starting with its origins in the…
Primal and dual algorithms are developed for solving the $n$-dimensional convex optimization problem of finding the Euclidean ball of minimum radius that covers $m$ given Euclidean balls, each with a given center and radius. Each algorithm…
One method for obtaining every closed orientable 3-manifold is as branched covering of the 3-sphere over a link. There is a classical topological result showing that the minimun possible number of sheets in the covering is three. In this…
The paper deals with the computation of the rank and the identifiability of a specific ternary form. Often, one knows some short Waring decomposition of a given form, and the problem is to determine whether the decomposition is minimal and…
We consider decompositions of the real line into pairwise disjoint Borel pieces so that each piece is closed under addition. How many pieces can there be? We prove among others that the number of pieces is either at most 3 or uncountable,…
These notes are not intended to substitute for a course in linear algebra on reduction of endomorphisms nor an exhaustive presentation of the Dunford's decomposition. We will limit ourselves to the case where the base is R or C, and the…
Modern 3D printing technologies and the upcoming mass-customization paradigm call for efficient methods to produce and distribute arbitrarily-shaped 3D objects. This paper introduces an original algorithm to split a 3D model in parts that…
Given $n$ pairwise openly disjoint triangles in 3-space, their vertical depth relation may contain cycles. We show that, for any $\varepsilon>0$, the triangles can be cut into $O(n^{3/2+\varepsilon})$ connected semi-algebraic pieces, whose…
In this paper, continuing our previous work, we investigate the third gap problem in the Simon conjecture for closed minimal surfaces in the unit sphere. By developing refined third-order Simons-type integral identities and establishing new…
In this paper, we prove that the $3$-sphere endowed with an arbitrary Riemannian metric either contains at least two embedded minimal $2$-spheres or admits an optimal foliation by $2$-spheres. This generalizes recent results by…
We construct closed embedded minimal surfaces in the round three-sphere, resembling two parallel copies of the equatorial two-sphere, joined by small catenoidal bridges symmetrically arranged either along two parallel circles of the…
Motivated by recent studies of superconformal mechanics extended by spin degrees of freedom, we construct minimally superintegrable models of spinning particles on 2-sphere, the spin degrees of freedom of which are represented by a 3-vector…