اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn a Fabric of Kissing Circles
120
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason - the problem of super resolution
of images. We have found optimal arrangements for N=6, 7 and 8 circles. Surprisingly, for the case N=7 there are three different optimal arrangements. Our proof is based on a computer enumeration of toroidal irreducible contact graphs.
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.
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 relativel
y 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.
In this note, we give a short solution of the kissing number problem in dimension three.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
