Related papers: Circles of Apollonius two ways
Apollonian gaskets are formed by repeatedly filling the gaps between three mutually tangent circles with further tangent circles. In this paper we give explicit formulas for the the limiting pair correlation and the limiting nearest…
The main result of this paper is an effective count for Apollonian circle packings that are either bounded or contain two parallel lines. We obtain this by proving an effective equidistribution of closed horospheres in the unit tangent…
Inspired by a question of Sarnak, we introduce the notion of a prime component in an Apollonian circle packing: a maximal tangency-connected subset having all prime curvatures. We also consider thickened prime components, which are…
The classical Apollonius' problem is to construct circles that are tangent to three given circles in a plane. This problem was posed by Apollonius of Perga in his work "Tangencies". The Sylvester problem, which was introduced by the English…
In the late 90's, Tom Wolff introduced the circle tangency counting problem in his expository article on the Kakeya conjecture. For collections of well-spaced circles, we break the $N^{3/2}$-barrier, proving that a set of $N$ well-spaced…
The depth function of three numbers representing curvatures of three mutually tangent circles is introduced. Its 2D plot leads to a partition of the moduli space of the triples of mutually tangent circles/disks that is unexpectedly a…
There are four characteristic circles for each triangle on a plane. All for are tangential to the three straight lines containing the triangles' three sides. Three are exterior circles, the fourth is the in-circle. When the triangle is…
We introduce an invariant of umbilic points on surfaces in the Euclidean or Minkowski 3-space that counts the maximum number of stable umbilic points they can split up under deformations of the surfaces. We call that number the multiplicity…
We consider Apollonian circle packings of a half Euclidean plane. We give necessary and sufficient conditions for two such packings to be related by a Euclidean similarity (that is, by translations, reflections, rotations and dilations) and…
We first review some topics in the classical computational geometry of lines, in particular the O(n^{3+\epsilon}) bounds for the combinatorial complexity of the set of lines in R^3 interacting with $n$ objects of fixed description…
The existence of excircles and an Apollonius circle for a triangle in taxicab geometry are connected to the concept of inscribed triangles.
Bounded Apollonian circle packings (ACP's) are constructed by repeatedly inscribing circles into the triangular interstices of a configuration of four mutually tangent circles, one of which is internally tangent to the other three. If the…
We prove the irreducibility of integer polynomials $f(X)$ whose roots lie inside an Apollonius circle associated to two points on the real axis with integer abscisae $a$ and $b$, with ratio of the distances to these points depending on the…
Four mutually tangent spheres form two gaps. In each of these, one can inscribe in a unique way four mutually tangent spheres such that each one of these spheres is tangent to exactly three of the original spheres. Repeating the process…
The goal of this paper is to study two basic problems of hyperbolic geometry. The first problem is to compare the hyperbolic and Euclidean distances. The second problem is to find hyperbolic counterparts of some basic geometric…
We compute the number of orbits of pairs in a finitely generated torsion module (more generally, a module of bounded order) over a discrete valuation ring. The answer is found to be a polynomial in the cardinality of the residue field whose…
We revisit the fundamental problem of assigning intersection multiplicities to subsets of solutions of (square) systems of polynomials. Severi [Ann. Mat. Pura Appl. 26 (4), 1947] suggested an intuitive dynamic solution to this problem which…
We study the following question: given a set P of 3d-2 points and an immersed curve G in the real plane R^2, all in general position, how many real rational plane curves of degree d pass through these points and are tangent to this curve.…
This paper concerns the number of lattice points in a circle.
Given a plane oval, is it possible to go around it so that, at all times, the two tangent segments to the oval from the moving point have unequal lengths? In this note we construct an example of such an oval.