Related papers: The kissing number in four dimensions
The infinite cosmological "constant" limit of the de Sitter solutions to Einstein's equation is studied. The corresponding spacetime is a singular, four-dimensional cone-space, transitive under proper conformal transformations, which…
A $t$-intersecting constant dimension subspace code $C$ is a set of $k$-dimensional subspaces in a projective space PG(n,q), where distinct subspaces intersect in a $t$-dimensional subspace. A classical example of such a code is the…
H. Busemann and C. M. Petty posed the following problem in 1956: If K and L are origin-symmetric convex bodies in R^n and for each hyperplane H through the origin the volumes of their central slices satisfy vol(K cap H) < vol(L cap H), does…
It is shown uniquely that quantized spaces are realised on four-dimensional compact manifolds. In the case of O(1,5) quantized space this are four independent parameters of O(5) unit vector; in the case of O(2,4) these are parameters of one…
In the present work, the problem about shadow, generalized on domains of space $\mathbb{R}^n$, $n\le 3$, is investigated. Here the shadow problem means to find the minimal number of balls satisfying some conditions an such that every line…
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks whether there is a disjoint collection of the hyperedges which…
We solve Blaschke's problem for hypersurfaces of dimension $n\geq 3$. Namely, we determine all pairs of Euclidean hypersurfaces $f,\tilde{f}\colon M^n\to\R^{n+1}$ that induce conformal metrics on $M^n$ and envelope a common sphere…
A classic result due to Douglas establishes that, for odd spread $k$ and dimension $d=\frac{1}{2}(3k+3)$, all maximum length $(d,k)$ circuit codes are isomorphic. Using a recent result of Byrnes we extend Douglas's theorem to prove that,…
The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…
In connection with an unsolved problem of Bang (1951) we give a lower bound for the sum of the base volumes of cylinders covering a d-dimensional convex body in terms of the relevant basic measures of the given convex body. As an…
The closest pair problem is a fundamental problem of computational geometry: given a set of $n$ points in a $d$-dimensional space, find a pair with the smallest distance. A classical algorithm taught in introductory courses solves this…
A well-known theorem of Sch\"utte (1963) gives a sharp lower bound for the ratio between the maximum distance and minimum distance between n+2 points in n-dimensional Euclidean space. In this brief note we adapt B\'ar\'any's elegant proof…
Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…
It is pointed out that the 60 complex rays in four dimensions associated with a system of two qubits yield over 10^9 critical parity proofs of the Kochen-Specker theorem. The geometrical properties of the rays are described, an overview of…
In this paper we study the following problems: given a finite number of nonempty closed subsets of a normed space, find a ball with the smallest radius that encloses all of the sets, and find a ball with the smallest radius that intersects…
We study the property of matter in equilibrium with a static, spherically symmetric black hole in D-dimensional spacetime. It requires this kind of matter has an equation of state (\omega\equiv p_r/\rho=-1/(1+2kn), k,n\in \mathbb{N}), which…
We derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…
The study of perfect numbers (numbers which equal the sum of their proper divisors) goes back to antiquity, and is responsible for some of the oldest and most popular conjectures in number theory. We investigate a generalization introduced…
We perform a systematic search for rotationally invariant cosmological solutions to matrix models, or more specifically the bosonic sector of Lorentzian IKKT-type matrix models, in dimensions $d$ less than ten, specifically $d=3$ and $d=5$.…
In this paper, we prove that given a 2-edge-coloured complete graph $K_{4n}$ that has the same number of edges of each colour, we can always find a perfect matching with an equal number of edges of each colour. This solves a problem posed…