Related papers: The farthest point map on the 4-cube
Minimal surfaces and Einstein manifolds are among the most natural structures in differential geometry. Whilst minimal surfaces are well understood, Einstein manifolds remain far less so. This exposition synthesises together a set of…
We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…
We study the problem of approximating the corner polyhedron using intersection cuts derived from families of lattice-free sets in $\mathbb{R}^n$. In particular, we look at the problem of characterizing families that approximate the corner…
In this note we establish a Ramsey-type result for certain subsets of the $n$-dimensional cube. This can then be applied to obtain reasonable bounds on various related structures, such as (partial) Hales-Jewett lines for alphabets of sized…
The corner polyhedron is described by minimal valid inequalities from maximal lattice-free convex sets. For the Relaxed Corner Polyhedron (RCP) with two free integer variables and any number of non-negative continuous variables, it is known…
Arguably, geodesics are the most important geometric objects on a differentiable manifold. They describe candidates for shortest paths and are guaranteed to be unique shortest paths when the starting velocity stays within the so-called…
A problem that is simple to state in the context of spherical geometry, and that seems rather interesting, appears to have been unexamined to date in the mathematical literature. The problem can also be recast as a problem in the real…
In a spherically complete ultrametric space, a strictly contracting mapping has a fixed point. We indicate in this paper how this fixed point can either be reached or approximated.
We find minimal and maximal length of intersections of lines at a fixed distance to the origin with the cross-polytope. We also find maximal volume noncentral sections of the cross-polypote by hyperplanes which are at a fixed large distance…
A set of lines in $\mathbb{R}^d$ passing through the origin is called equiangular if any two lines in the set form the same angle. We proved an alternative version of the three-point semidefinite constraints developed by Bachoc and…
In computer vision and graphics, various types of symmetries are extensively studied since symmetry present in objects is a fundamental cue for understanding the shape and the structure of objects. In this work, we detect the intrinsic…
A set of rational points on a curve is said to be in geometric progression if either the abscissae or the ordinates of the points are in geometric progression. Examples of three points in geometric progression on a circle are already known.…
We characterize rotund, uniformly rotund, locally uniformly rotund and compactly locally uniformly rotund spaces in terms of sets of (almost) farthest points from the unit sphere using the generalized diameter. For this we introduce few…
We study computing geometric problems on uncertain points. An uncertain point is a point that does not have a fixed location, but rather is described by a probability distribution. When these probability distributions are restricted to a…
For all $n,\phi\in \mathbb{N}$ with $\phi\geqslant n+1$, the smallest possible isoperimetric quotient of an $n$-dimensional convex polytope that has $\phi$ facets is shown to be bounded from above and from below by positive universal…
We apply the specialization technique based on the decomposition of the diagonal to find an explicit example over $\mathbb{Q}$ of a quadric and cubic hypersurface in $\mathbb{P}^6$ such that their intersection is a smooth stably irrational…
Neighborly cubical polytopes exist: for any $n\ge d\ge 2r+2$, there is a cubical convex d-polytope $C^n_d$ whose $r$-skeleton is combinatorially equivalent to that of the $n$-dimensional cube. This solves a problem of Babson, Billera &…
We consider the problem of extending the drawing of a subgraph of a given plane graph to a drawing of the entire graph using straight-line and polyline edges. We define the notion of star complexity of a polygon and show that a drawing…
Fix a choice and ordering of four pairwise non-adjacent vertices of a parallelepiped, and call a motif a sequence of four points in R^3 that coincide with these vertices for some, possibly degenerate, parallelepiped whose edges are parallel…
We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…