اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuasi-circles through prescribed points
52
0
0.0
(
0
)
تأليف
John M. Mackay
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We show that in an L-annularly linearly connected, N-doubling, complete metric space, any n points lie on a K-quasi-circle, where K depends only on L, N and n. This implies, for example, that if G is a hyperbolic group that does not split over any virtually cyclic subgroup, then any geodesic line in G lies in a quasi-isometrically embedded copy of the hyperbolic plane.
قيم البحث
اقرأ أيضاً
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 so
me 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.
We develop a framework for obtaining linear programming bounds for spherical codes whose inner products belong to a prescribed subinterval $[ell,s]$ of $[-1,1)$. An intricate relationship between Levenshtein-type upper bounds on cardinality of codes
with inner products in $[ell,s]$ and lower bounds on the potential energy (for absolutely monotone interactions) for codes with inner products in $[ell,1)$ (when the cardinality of the code is kept fixed) is revealed and explained. Thereby, we obtain a new extension of Levenshtein bounds for such codes. The universality of our bounds is exhibited by a unified derivation and their validity for a wide range of codes and potential functions.
A circle, centered at the origin and with radius chosen so that it has non-empty intersection with the integer lattice $mathbb{Z}^{2}$, gives rise to a probability measure on the unit circle in a natural way. Such measures, and their weak limits, are
said to be attainable from lattice points on circles. We investigate the set of attainable measures and show that it contains all extreme points, in the sense of convex geometry, of the set of all probability measures that are invariant under some natural symmetries. Further, the set of attainable measures is closed under convolution, yet there exist symmetric probability measures that are not attainable. To show this, we study the geometry of projections onto a finite number of Fourier coefficients and find that the set of attainable measures has many singularities with a fractal structure. This complicated structure in some sense arises from prime powers - singularities do not occur for circles of radius $sqrt{n}$ if $n$ is square free.
We find all analytic surfaces in space $mathbb{R}^3$ such that through each point of the surface one can draw two transversal circular arcs fully contained in the surface. The problem of finding such surfaces traces back to the works of Darboux from
XIXth century. We prove that such a surface is an image of a subset of one of the following sets under some composition of
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
