Related papers: A note on five dimensional kissing arrangements
A set of $k$ orthonormal bases of $\mathbb C^d$ is called mutually unbiased if $|\langle e,f\rangle |^2 = 1/d$ whenever $e$ and $f$ are basis vectors in distinct bases. A natural question is for which pairs $(d,k)$ there exist~$k$ mutually…
It is shown that embedding of flipped SU(5) in a five-dimensional SO(10) enables exact unification of the gauge coupling constants. The demand for the unification uniquely determines both the compactification scale and the cutoff scale.…
We describe an astrometric and spectroscopic campaign to confirm the youth and association of a complete sample of candidate wide companions in Taurus and Upper Sco. Our survey found fifteen new binary systems (3 in Taurus and 12 in Upper…
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…
A subset of the Hamming cube over $n$-letter alphabet is said to be $d$-maximal if its diameter is $d$, and adding any point increases the diameter. Our main result shows that each $d$-maximal set is either of size at most $(n+o(n))^d$ or…
Every graph $G$ can be represented by a collection of equi-radii spheres in a $d$-dimensional metric $\Delta$ such that there is an edge $uv$ in $G$ if and only if the spheres corresponding to $u$ and $v$ intersect. The smallest integer $d$…
A complete 5-dimensional SU(5) unified theory is constructed which, on compactification on the orbifold with two different Z_2's (Z_2 and Z_2'), yields the minimal supersymmetric standard model. The orbifold accomplishes SU(5) gauge…
This paper investigates the existence and properties of spherical $5$-designs of minimal type. We focus on two cases: tight spherical $5$-designs and antipodal spherical $4$-distance $5$-designs. We prove that a tight spherical $5$-design…
In this paper, we mainly consider the problem of spherical distribution of 5 points, that is, how to configure 5 points on a sphere such that the mutual distance sum attains the maximum. It is conjectured that the sum of distances is…
We consider three-dimensional clusters of identical bubbles packed around a central bubble and calculate their energy and optimal shape. We obtain the surface area and bubble pressures to improve on existing growth laws for…
The smallest maximum kissing-number Voronoi polyhedron of 3d spheres is the icosahedron and the tetrahedron is the smallest volume that can show up in Delaunay tessalation. No periodic lattice is consistent with either and hence these dense…
In 1694, Gregory and Newton discussed the problem to determine the kissing number of a rigid material ball. This problem and its higher dimensional generalization have been studied by many mathematicians, including Minkowski, van der…
We study the sphere packing problem in Euclidean space where we impose additional constraints on the separations of the center points. We prove that any sphere packing in dimension $48$, with spheres of radii $r$, such that no two centers…
Consider a system consisting of n d-dimensional quantum particles (qudits), and suppose that we want to optimize the entanglement between each pair. One can ask the following basic question regarding the sharing of entanglement: what is the…
Spherical codes, with a rich history spanning nearly five centuries, remain an area of active mathematical exploration and are far from being fully understood. These codes, which arise naturally in problems of geometry, combinatorics, and…
The average distance of the equal hard spheres is introduced to evaluate the density of a given arrangement. The absolute smallest value is two radii because the spheres can not be closer to each other than their diameter. The absolute…
In this paper, we prove the existence of a spherical $t$-design formed by adding extra points to an arbitrarily given point set on the sphere and, subsequently, deduce the existence of nested spherical designs. Estimates on the number of…
Erd\H{o}s and Lov\'asz noticed that an $r$-uniform intersecting hypergraph $H$ with maximal covering number, that is $\tau(H)=r$, must have at least $\frac{8}{3}r-3$ edges. There has been no improvement on this lower bound for 45 years. We…
Let $N$ denote the maximum number of congruent infinite cylinders that can be arranged in $\mathbb{R}^3$ so that every pair of cylinders touches each other. Littlewood posed the question of whether $N=7$, which remains unsolved. In this…
We elaborate on a recently found $SU(5)$ relation confined to the up-(s)quark flavour space, that remains immune to large quantum corrections up to the TeV scale. We investigate the possibilities opened by this new window on the GUT scale…