Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Proof of Fejes Toths Conjecture on Sphere Packings with Kissing Number Twelve
145
0
0.0
(
0
)
Authors
Thomas C. Hales
Ask ChatGPT about the research
No Arabic abstract
In 1969, Fejes Toth conjectured that in Euclidean 3-space any packing of equal balls such that each ball is touched by twelve others consists of hexagonal layers. This article verifies this conjecture.
rate research
Read More
This paper investigates the behaviour of the kissing number $kappa(n, r)$ of congruent radius $r > 0$ spheres in $mathbb{S}^n$, for $ngeq 2$. Such a quantity depends on the radius $r$, and we plot the approximate graph of $kappa(n, r)$ with relatively high accuracy by using new upper and lower bounds that are produced via semidefinite programming and by using spherical codes, respectively.
This paper provides upper and lower bounds on the kissing number of congruent radius $r > 0$ spheres in $mathbb{H}^n$, for $ngeq 2$. For that purpose, the kissing number is replaced by the kissing function $kappa(n, r)$ which depends on the radius $r$. After we obtain some theoretical lower and upper bounds for $kappa(n, r)$, we study their asymptotic behaviour and show, in particular, that $lim_{rto infty} frac{log kappa(n,r)}{r} = n-1$. Finally, we compare them with the numeric upper bounds obtained by solving a suitable semidefinite program.
119 -
Viera v{C}erv{n}anova (Department of Mathematics
, Computern Science
, Faculty of Education
2020
Applying circle inversion on a square grid filled with circles, we obtain a configuration that we call a fabric of kissing circles. The configuration and its components, which are two orthogonal frames and two orthogonal families of chains, are in some way connected to classical geometric configurations such as the arbelos or the Pappus chain, or the Apollonian packing from the 20th century. In this paper, we build the fabric and list some of the obvious properties that result from this construction. Next, we focus on the curvature inside the individual components: we show that the curvatures of the frame circles form a doubly infinite arithmetic sequence (bi-sequence), whereas the curvatures of the circles of each chain are arranged in a quadratic bi-sequence. Because solving geometric sangaku problems was a gateway to our discovery of the fabric, we conclude this paper with two sangaku problems and their solutions using our results on curvatures.
In this note, we give a short solution of the kissing number problem in dimension three.
The average kissing number of $mathbb{R}^n$ is the supremum of the average degrees of contact graphs of packings of finitely many balls (of any radii) in $mathbb{R}^n$. We provide an upper bound for the average kissing number based on semidefinite programming that improves previous bounds in dimensions $3, ldots, 9$. A very simple upper bound for the average kissing number is twice the kissing number; in dimensions $6, ldots, 9$ our new bound is the first to improve on this simple upper bound.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
