Related papers: Minimal Banach-Tarski Decompositions
The statistical physics approach to the number partioning problem, a classical NP-hard problem, is both simple and rewarding. Very basic notions and methods from statistical mechanics are enough to obtain analytical results for the phase…
Three-dimensional $N^{th}$ order nodal Lagrangian tetrahedral finite elements ($P_N$ elements) can be generated using Pascal's tetrahedron $\mathcal{H}$ where each node in 3D element space corresponds to an entry in $\mathcal{H}$. For the…
This is the announcement, and the long summary, of a series of articles on the algorithmic study of Thurston maps. We describe branched coverings of the sphere in terms of group-theoretical objects called bisets, and develop a theory of…
Assume you have a 2-dimensional pizza with $2n$ ingredients that you want to share with your friend. For this you are allowed to cut the pizza using several straight cuts, and then give every second piece to your friend. You want to do this…
For rearranging objects on tabletops with overhand grasps, temporarily relocating objects to some buffer space may be necessary. This raises the natural question of how many simultaneous storage spaces, or "running buffers", are required so…
Using an analogue of Myers' theorem for minimal surfaces and three dimensional topology, we prove the diameter sphere theorem for Ricci curvature in dimension three and a corresponding eigenvalue pinching theorem. This settles these two…
The Tammes problem is to find the arrangement of N points on a unit sphere which maximizes the minimum distance between any two points. This problem is presently solved for several values of N, namely for N=3,4,6,12 by L. Fejes Toth (1943);…
Weighted Triebel-Lizorkin and Besov spaces on the unit ball $B^d$ in $\Rd$ with weights $\W(x)= (1-|x|^2)^{\mu-1/2}$, $\mu \ge 0$, are introduced and explored. A decomposition scheme is developed in terms of almost exponentially localized…
In Part I of this series we described three algorithms that construct canonical tree-decompositions of graphs which distinguish all their k-blocks and tangles of order k. We now establish bounds on the number of parts in these…
This is an experimental case study in real algebraic geometry, aimed at computing the image of a semialgebraic subset of 3-space under a polynomial map into the plane. For general instances, the boundary of the image is given by two highly…
Thinning is the removal of contour pixels/points of connected components in an image to produce their skeleton with retained connectivity and structural properties. The output requirements of a thinning procedure often vary with…
Let M be a (possibly non-orientable) compact 3-manifold with (possibly empty) boundary consisting of tori and Klein bottles. Let $X\subset\partial M$ be a trivalent graph such that $\partial M\setminus X$ is a union of one disc for each…
We give a minimum degree condition sufficent to ensure the existence of a fractional $K_r$-decomposition in a balanced $r$-partite graph (subject to some further simple necessary conditions). This generalises the non-partite problem studied…
We present a construction method for triharmonic maps to spheres. In particular, we show that for any $m\in\mathbb{N}$ with $m\geq 3$ there exists a triharmonic map from $\mathbb{R}^m\setminus\{0\}$ into a round sphere. In addition, we…
We build on the correspondence between abstract key polynomials and minimal pairs made by Novacoski and show how to relate the valuations that are generated by each object. We can then give a geometric interpretation of valuations built in…
We study the space of all tilings which can be obtained using the Robinson tiles (this is a two-dimensional subshift of finite type). We prove that it has a unique minimal subshift, and describe it by means of a substitution. This…
Thomson problem is a classical problem in physics to study how $n$ number of charged particles distribute themselves on the surface of a sphere of $k$ dimensions. When $k=2$, i.e. a 2-sphere (a circle), the particles appear at equally…
A mathematical method for constructing fractal curves and surfaces, termed the $p\lambda n$ fractal decomposition, is presented. It allows any function to be split into a finite set of fractal discontinuous functions whose sum is equal…
We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a…
More than two centuries ago Malfatti (see \cite{malfatti}) raised and solved the following problem (the so-called Malfatti's construction problem):Construct three circles into a triangle so that each of them touches the two others from…