Related papers: Minimal Banach-Tarski Decompositions
In the present paper, we study problems related to the classical Borsuk's problem. Recall that the Borsuk's problem consists in finding the smallest number $ f(n) $ of parts of smaller diameter into which an arbitrary set of diameter 1 in…
We prove that, for sufficiently large $n$, every graph of order $n$ with minimum degree at least $0.852n$ has a fractional edge-decomposition into triangles. We do this by refining a method used by Dross to establish a bound of $0.9n$. By a…
Reconstructing a complete object from its parts is a fundamental problem in many scientific domains. The purpose of this article is to provide a systematic survey on this topic. The reassembly problem requires understanding the attributes…
We discuss construction of coverings of the unit ball of a finite dimensional Banach space. The well known technique of comparing volumes gives upper and lower bounds on covering numbers. This technique does not provide a construction of…
We show that every $3$-dimensional convex body can be covered by $14$ smaller homothetic copies. The previous result was $16$ copies established by Papadoperakis in 1999, while a conjecture by Hadwiger is $8$. We modify Papadoperakis's…
We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…
Laczkovich proved that if bounded subsets $A$ and $B$ of $R^k$ have the same non-zero Lebesgue measure and the box dimension of the boundary of each set is less than $k$, then there is a partition of $A$ into finitely many parts that can be…
The $n$-cube is the poset obtained by ordering all subsets of $\{1,\ldots,n\}$ by inclusion, and it can be partitioned into $\binom{n}{\lfloor n/2\rfloor}$ chains, which is the minimum possible number. Two such decompositions of the…
Tarski's Circle Squaring Problem from 1925 asks whether it is possible to partition a disk in the plane into finitely many pieces and reassemble them via isometries to yield a partition of a square of the same area. It was finally resolved…
Modeling deformations of a real object is an important task in computer vision, biomedical engineering and biomechanics. In this paper, we focus on a situation where a three-dimensional object is rotationally deformed about a fixed axis,…
The Borsuk problem asks for the smallest number of subsets with strictly smaller diameters into which any bounded set in the $d$-dimensional space can be decomposed. It is a classical problem in combinatorial geometry that has been subject…
The aim of this work is to describe subsets of Banach limits in terms of a certain functional characteristic. We compute radii and cardinalities for some of these subsets.
Methodology is provided towards the solution 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 d-dimensional Euclidean…
This paper studies the minimal number of vertices $\lambda(n,d)$ required in a triangulation of the $n$-sphere to admit a simplicial map to the boundary of a $(n+1)$-simplex with a given degree $d$. We establish upper bounds for…
In this paper, we deal with a simple geometric problem: Is it possible to partition a rectangle into $k$ non-congruent rectangles of equal area? This problem is motivated by the so-called `Mondrian art problem' that asks a similar question…
Given a set $P$ of $n$ points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate $n$ points, picked randomly…
Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with…
We consider spectral minimal partitions. Continuing work of the the present authors about problems for planar domains, [23], we focus on the sphere and obtain a sharp result for 3-partitions which is related to questions from harmonic…
It is important to have fast and effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex…
We introduce a new method to reconstruct 3D objects using a set of volumetric primitives, i.e., superquadrics. The method hierarchically decomposes a target 3D object into pairs of superquadrics recovering finer and finer details. While…