English
Related papers

Related papers: Circles of Apollonius two ways

200 papers

We discuss a number of naturally arising problems in arithmetic, culled from completely unrelated sources, which turn out to have a common formulation involving "thin" orbits. These include the local-global problem for integral Apollonian…

Number Theory · Mathematics 2012-08-28 Alex Kontorovich

It is shown that any primitive integral Apollonian circle packing captures a fraction of the prime numbers. Basically the method consists in applying the circle method, considering the curvatures produced by a well-chosen family of binary…

Number Theory · Mathematics 2012-01-13 Jean Bourgain

We consider a polynomial version of the Cayley numbers. Namely, we define the ring of Cayley polynomials in terms of generators and relations in the category of alternative algebras. The ring turns out to be an octonion algebra over an…

Rings and Algebras · Mathematics 2007-05-23 Yoji Yoshii

Let S be a set of 2n+1 points in the plane such that no three are collinear and no four are concyclic. A circle will be called point-splitting if it has 3 points of S on its circumference, n-1 points in its interior and n-1 in its exterior.…

Combinatorics · Mathematics 2007-05-23 Federico Ardila M

Consider two circles, externally tangential,and with integer radii R1, R2; and with R1>R2.The two circles have three tangent lines in common, one of them being T1T2. If M is the midpoint of T1T2, and K the point of intersection of the lines…

History and Overview · Mathematics 2009-10-02 Konstantine Zelator

An ordinary circle of a set $P$ of $n$ points in the plane is defined as a circle that contains exactly three points of $P$. We show that if $P$ is not contained in a line or a circle, then $P$ spans at least $\frac{1}{4}n^2 - O(n)$…

An arrangement of circles in which circles intersect only in angles of $\pi/2$ is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are nested, the intersection graph of such an arrangement is…

Computational Geometry · Computer Science 2021-08-17 Sarah Carmesin , André Schulz

Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…

Computational Geometry · Computer Science 2018-04-05 Vincent Despré , Olivier Devillers , Hugo Parlier , Jean-Marc Schlenker

We construct invariants for any closed semipositive symplectic manifold which count rational curves satisfying tangency constraints to a local divisor. More generally, we introduce invariants involving multibranched local tangency…

Symplectic Geometry · Mathematics 2021-10-20 Dusa McDuff , Kyler Siegel

Fix two points $p$ and $q$ in the plane and a positive number $k \neq 1$. A result credited to Apollonius of Perga states that the set of points $x$ that satisfy $d(x, p)/d(x, q) = k$ forms a circle. In this paper we study the analogous set…

We construct families of circles in the plane such that their tangency graphs have arbitrarily large girth and chromatic number. This provides a strong negative answer to Ringel's circle problem (1959). The proof relies on a…

Combinatorics · Mathematics 2023-09-07 James Davies , Chaya Keller , Linda Kleist , Shakhar Smorodinsky , Bartosz Walczak

The Apollonius theorem gives the length of a median of a triangle in terms of the lengths of its sides. The straightforward generalization of this theorem obtained for m-simplices in the n-dimensional Euclidean space for n greater than or…

Geometric Topology · Mathematics 2024-01-09 Michael N. Vrahatis

We use polynomial method techniques to bound the number of tangent pairs in a collection of $N$ spheres in $\mathbb{R}^n$ subject to a non-degeneracy condition, for any $n \geq 3$. The condition, inspired by work of Zahl for $n=3$, asserts…

Combinatorics · Mathematics 2023-01-18 Conrad Crowley , Marco Vitturi

In this paper, applying a canonical system with field rotation parameters and using geometric properties of the spirals filling the interior and exterior domains of limit cycles, we solve first the problem on the maximum number of limit…

Dynamical Systems · Mathematics 2012-03-05 Valery A. Gaiko

We initiate a study of the rings of invariants of modular representations of elementary abelian p-groups. With a few notable exceptions, the modular representation theory of an elementary abelian p-group is wild. However, for a given…

Commutative Algebra · Mathematics 2012-05-11 H. E. A. Campbell , R. J. Shank , D. L. Wehlau

Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…

Combinatorics · Mathematics 2017-06-30 Yi Bo

The Descartes circle theorem states that if four circles are mutually tangent with disjoint intersion, then their curvatures (or "bends) b_j = 1/r_j satisfy the relation (b_1 + b_2 + b_3 + b_4)^2 = 2(b_1^2 + b_2^2 + b_3^2 + b_4^2). We show…

Metric Geometry · Mathematics 2007-05-23 Jeffrey C. Lagarias , Colin L. Mallows , Allan R. Wilks

We consider two incidence problems for integral curves of vector fields. The first is an analogue of the Euclidean joints problem, in which lines are replaced by integral curves of smooth vector fields taken from some finite-dimensional…

Classical Analysis and ODEs · Mathematics 2025-09-12 Kaiyi Huang , Betsy Stovall , Sarah Tammen

The optimal one-sided parametric polynomial approximants of a circular arc are considered. More precisely, the approximant must be entirely in or out of the underlying circle of an arc. The natural restriction to an arc's approximants…

Numerical Analysis · Mathematics 2025-09-03 Ada Šadl Praprotnik , Aleš Vavpetič , Emil Žagar

We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…

Combinatorics · Mathematics 2021-12-03 James East , Michael Hendriksen , Laurence Park