Related papers: No-dimensional Tverberg-type problems
The maximal graph Dirichlet problem asks whether there exists a spacelike graph, in a semi-Euclidean space, with a given boundary and with mean curvature everywhere zero. We prove the existence of solutions to this problem under certain…
We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…
Conditions, related to the so-called bending problem are considered for hypersurfaces of a pseudo-Euclidean space. Corresponding theorems are proved.
Suppose that $A$ and $B$ are closed subsets of a Euclidean space such that $A\cap B\neq\varnothing$, and we aim to find a point in this intersection with the help of the sequences $(a_n)_\nnn$ and $(b_n)_\nnn$ generated by the \emph{method…
This paper views the honeycomb conjecture and the Kepler problem essentially as extreme value problems and solves them by partitioning 2-space and 3-space into building blocks and determining those blocks that have the universal extreme…
In this thesis I discuss combinatorial optimization problems, from the statistical physics perspective. The starting point are the motivations which brought physicists together with computer scientists and mathematicians to work on this…
We consider the dynamics of finite systems of point masses which move along the real line. We suppose the particles interact pairwise and undergo perfectly inelastic collisions when they collide. In particular, once particles collide, they…
The Topological Tverberg Theorem claims that any continuous map of a (q-1)(d+1)-simplex to \R^d identifies points from q disjoint faces. (This has been proved for affine maps, for d=1, and if q is a prime power, but not yet in general.) The…
Motivated by a question of R.\ Nandakumar, we show that the Euclidean plane can be dissected into mutually incongruent convex pentagons of the same area and the same perimeter.
Consider four point particles with equal masses in the euclidean space, subject to the following symmetry constraint: at each instant they are symmetric with respect to the dihedral group $D_2$, that is the group generated by two rotations…
Translational tiling problems are among the most fundamental and representative undecidable problems in all fields of mathematics. Greenfeld and Tao obtained two remarkable results on the undecidability of translational tiling in recent…
In view of solving problems of geometric realizability of polyhedra with given geometric constraints, we describe the space of geometric realizations of a simply-connected triangulated euclidean polyhedron in $\mathbb{R}^3$ up to similarity…
We give a complete proof of Thurston's celebrated hyperbolic Dehn filling theorem, following the ideal triangulation approach of Thurston and Neumann-Zagier. We avoid to assume that a genuine ideal triangulation always exists, using only a…
In 1933 Karol Borsuk asked whether each bounded set in the n-dimensional Euclidean space can be divided into n+1 parts of smaller diameter. The diameter of a set is defined as the supremum (least upper bound) of the distances of contained…
Little known relations of the renown concept of the halfspace depth for multivariate data with notions from convex and affine geometry are discussed. Halfspace depth may be regarded as a measure of symmetry for random vectors. As such, the…
We study symmetrization procedures within the class $\mathcal S_n$ of \emph{ball-bodies}, i.e.\ intersections of unit Euclidean balls (equivalently, summands of the Euclidean unit ball, or $c$-convex sets via the $c$-duality $A\mapsto…
Given a set of disjoint simple polygons $\sigma_1, \ldots, \sigma_n$, of total complexity $N$, consider a convexification process that repeatedly replaces a polygon by its convex hull, and any two (by now convex) polygons that intersect by…
We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…
Consider a 3$-$dimensional manifold $N$ obtained by gluing a finite number of ideal hyperbolic tetrahedra via isometries along their faces. By varying the isometry type of each tetrahedron but keeping fixed the gluing pattern we define a…
We develop a new concept of non-positive curvature for metric spaces, based on intersection patterns of closed balls. In contrast to the synthetic approaches of Alexandrov and Buesemann, our concept also applies to metric spaces that might…