--- title: 'Circles in Mathematics: Theory & Applications' url: https://www.emergentmind.com/topics/circles type: topic --- # Circles in Mathematics: Theory & Applications Circles occupy a central position in contemporary geometry, combinatorics, and discrete mathematics, but recent research treats them in several distinct formal senses. In the Euclidean plane they appear as incidence objects in arrangements, as carriers of graph and convex-geometry representations, and as separators of finite point configurations; in arithmetic and constant-curvature settings they acquire modified distance laws and spectral invariants; and in homogeneous geometry the term “circle” denotes a distinguished class of curves defined without reference to a Riemannian metric [2106.03557], [2502.15751], [2412.04662], [2605.15457], [1902.01467]. The resulting theory is correspondingly plural: it includes extremal bounds for intersection graphs, rigidity and closure theorems for circle chains, representation theorems for planar graphs and convex geometries, and specialized families such as Omega and Ajima circles. ## 1. Analytic definitions and generalized meanings Several recent works begin by replacing the informal notion of a circle with explicit analytic or structural conditions. For an arrangement of Euclidean circles, orthogonality of two circles \(A,B\) with centers \(C_A,C_B\) and radii \(r_A,r_B\) is equivalent to \[ |C_AC_B|^2=r_A^2+r_B^2. \] If the circles meet at an angle \(\theta\le \pi/2\), then \[ |C_AC_B|^2=r_A^2+r_B^2-2r_Ar_B\cos\theta, \qquad \cos\theta\ge 0, \] hence \( |C_AC_B|^2\le r_A^2+r_B^2 \) [2106.03557]. A different analytic model appears in the generalized Apollonius problem in constant-curvature geometries. In the Euclidean plane the classical locus \(PA/PB=k\) is a circle for \(k\neq 1\); in the unified formulation for the Euclidean, spherical, and hyperbolic planes, the generalized Apollonius curve of two points \(A,B\) is defined by \[ \frac{S(d(P,A))}{S(d(P,B))}=k, \] where \[ S(r)= \begin{cases} r,&\text{curvature }0,\\ \sin r,&\text{curvature }+1,\\ \sinh r,&\text{curvature }-1. \end{cases} \] In affine coordinates with \(A=(a,0)\), \(B=(b,0)\), the locus is a real conic with equation \[ \frac{(x-a)^2}{1+\varepsilon a^2}-k^2\frac{(x-b)^2}{1+\varepsilon b^2}+(1-k^2)y^2=0, \] reducing in the Euclidean limit to the classical Apollonius circle [2605.15457]. In integer geometry, a circle is defined relative to the lattice \(\mathbb Z^2\) and the integer distance \[ \id(A,B)=\gcd(|x_B-x_A|,|y_B-y_A|). \] For a lattice point \(O\) and integer \(r>0\), the integer circle of radius \(r\) is \[ S(O,r)=\{P\in\mathbb Z^2:\id(O,P)=r\}. \] This notion is invariant under integer affine transformations, and it leads to integer and rational circumscribed spectra for finite subsets of \(\mathbb Z^2\) [2412.04662]. The most abstract usage occurs for self-dual symmetric \(R\)-spaces. If \(p,p_1,q\) are pairwise opposite points and \(p_1=\exp(y)\cdot p\) in an opposite chart, then \[ c(t)=\exp(ty)\cdot p,\qquad c(\infty)=q, \] is called the circle through \((p,p_1,q)\). Different triples with the same image differ by a fractional-linear reparametrization. Here “circle” denotes a distinguished \(G\)-invariant curve rather than a planar metric locus [1902.01467]. ## 2. Arrangements, intersections, and extremal structure One major research direction studies finite arrangements of circles through their intersection combinatorics. For an arrangement \(\mathcal A\), the intersection graph \(G(\mathcal A)\) has one vertex per circle and an edge whenever two circles meet. When no two circles are nested, the straight-line drawing obtained by placing each vertex at the center of its circle is crossing-free for arrangements of orthogonal circles. The same holds when all intersections occur at an angle of at most \(\pi/2\). Consequently, in the nonnested case the intersection graph is planar [2106.03557]. The nested case is subtler. For \(n\) circles, the maximal number of edges in an intersection graph of an arrangement of orthogonal circles lies between \[ 4n-O(\sqrt n) \quad\text{and}\quad \left(4+\frac{5}{11}\right)n. \] The lower bound is realized by the “nested wheels” construction \(\mathfrak B_{x,a}\): for \(i=1,\dots,x\), one places a hub circle \(H_i\) together with a ring of \(a\) satellite circles \(S_{i,1},\dots,S_{i,a}\), each orthogonal to \(H_i\) and to its two near-neighbors, then nests the wheels so that each satellite on ring \(i\) meets exactly two satellites on ring \(i\pm1\). With \(n=x(a+1)\), the edge count is \[ |E|=4xa-2a=4n-2a=4n-O(\sqrt n) \] for \(x\approx a\approx \sqrt n\). The same construction improves the lower bound for the number of triangular cells to \[ (3+5/9)n-O(\sqrt n). \] The paper also records open problems, including tightening the coefficient \(4+5/11\), fixed-parameter or approximation algorithms for dense subgraphs, higher-dimensional analogues for orthogonal spheres in \(\mathbb R^3\), and analogous extremal questions for a fixed acute angle \(\alpha\) [2106.03557]. This extremal viewpoint is complemented by a topological description of the regions surrounded by circle arrangements. For a normally-inductive arrangement \((\mathcal S,D_{\mathcal S})\), one fixes a coordinate projection \[ \pi_{2,1,i}:(x_1,x_2)\mapsto x_i,\qquad i=1 \text{ or }2, \] and collapses each fiber \(\pi_{2,1,i}^{-1}(t)\cap \overline{D_{\mathcal S}}\) to a point. The quotient is a finite graph \(G_{D_{\mathcal S},i}\), with vertices corresponding to selected poles or circle intersections and edges corresponding to interval fibers. The resulting structure is a \(V\)-digraph whose vertex order is induced by the projection values [2502.15195]. ## 3. Regions, labels, and local modification of circle arrangements The Poincaré–Reeb framework refines the combinatorial study of arrangements by encoding which circle arcs appear along monotone fibers. For an NI arrangement, every edge \(e\subset G_{D_{\mathcal S},i}\) lifts to a strip in \(\overline{D_{\mathcal S}}\) bounded by two smooth arcs \(C_{e,1},C_{e,2}\) lying on circles \(S_{e,1},S_{e,2}\in\mathcal S\). The edge label is a pair of finite sets of \((j,j+1)\frac{\pi}{4}\)-arcs on these circles. Vertex labels are more elaborate: depending on degree \(1\), \(2\), or \(\ge 3\), one records a finite sequence of finite arc-sets, one for each sector around the vertex. The labeling function \[ l_{(\mathcal S,D_{\mathcal S}),i}:V_{D_{\mathcal S},i}\sqcup E_{D_{\mathcal S},i}\longrightarrow \{\text{finite sequences of finite sets of $(j,j+1)\tfrac\pi4$-arcs}\} \] is well defined, and the admissible labels are forced by combinatorial rules relating tangent-vector signs to allowable quarter-arc data [2502.15195]. This labeling theory supports explicit local change theorems. If an edge label contains a single \((j,j+1)\tfrac\pi4\)-arc of a circle \(S\), then adding a sufficiently small new circle \(S_x\) at a point \(x\) in the interior of that arc changes the graph locally by splitting the edge into three edges, inserting two new vertices, and attaching a new leaf edge to the middle vertex. If the chosen label contains two adjacent arcs, one can realize either of the two basic local changes by a suitable choice of chord position. These operations give a controlled calculus for modifying circle arrangements while tracking the induced Poincaré–Reeb graph [2502.15195]. Examples illustrate the formalism. For the unit disk \(D^2\), \(G_{D_{\mathcal S},i}\) is a single edge with two end-vertices, and the edge and vertex labels can be written explicitly in terms of arc-sets. For the annulus between two concentric circles, the quotient graph has three edges and four vertices, and adding a small circle near a specified quarter-arc produces one of the local modifications described above. The same paper notes that \(\overline{D_{\mathcal S}}\) is realized as the image of a real algebraic map generalizing natural projections of spheres [2502.15195]. ## 4. Circle-based representations of graphs and convex geometries Circles also function as representational primitives for discrete structures. For a connected simple \(4\)-regular planar graph \(G\), a circle-representation is a drawing together with a set \(\mathcal C\) of circles such that every vertex is realized as either a crossing point or a tangency point of two circles, and every edge is drawn along an arc lying on one of the defining circles. If only tangencies occur, the representation is a touching-circle representation. For \(n=|V(G)|\), the minimum number \(c(G)\) of circles in a circle-representation satisfies \[ \frac{1+\sqrt{1+4n}}{2}\le c(G)\le \frac{2n}{3}, \] with both bounds attained by infinite families. The upper bound comes from the fact that each circle contains at least \(3\) vertices and each vertex lies on exactly \(2\) circles; the lower bound follows from \(n\le c(G)(c(G)-1)\) [1909.01721]. The principal positive realization theorem states that every \(3\)-connected simple \(4\)-regular planar graph admits a touching-circle representation. The proof uses the dual graph, a face \(2\)-coloring, an incidence-line graph \(IL(G)\), and Koebe’s circle-packing theorem. By contrast, the non-\(3\)-connected case contains explicit obstructions: the paper constructs an infinite family of simple connected and biconnected \(4\)-regular planar graphs that admit no circle-representation. It also leaves open the decision problem for arbitrary \(4\)-regular planar graphs [1909.01721]. A parallel but logically distinct program studies convex geometries represented by circles. For a finite set \(F\) of circles in the Euclidean plane, one defines \[ ch_c(Y)=\{z\in F:\tilde z\subseteq \Conv(\bigcup_{y\in Y}\tilde y)\}, \qquad Y\subseteq F, \] where \(\tilde y\) is the disk occupied by \(y\). Then \((F,ch_c)\) is a convex geometry, meaning a closure system satisfying the anti-exchange axiom. Such circle convex geometries obey the Weak \(2\times 3\)-Carousel rule: for every triple \(S=\{a,b,c\}\) and every \(x,y\in \varphi(S)\), there exist two of the three points, say \(\{u,v\}\subseteq\{a,b,c\}\), such that \[ x\in \varphi(\{y,u,v\}) \quad\text{or}\quad y\in \varphi(\{x,u,v\}). \] The rule is proved by reducing to the case of three point-circles, projecting two interior circles to the sides of a triangle, and eliminating nonrealizable overlap patterns by a detailed case analysis. Not every finite convex geometry satisfies this rule, so not every finite convex geometry is strongly representable by circles in the plane; the paper notes counterexamples already of convex dimension \(6\) and formulates further representation problems for circles and balls in higher dimension [1609.00092]. ## 5. Enumeration, separation, and topological classes The combinatorics of circles includes exact enumeration problems for separating circles. Let \(D\) be a set of \(n\) dots in general position in the plane or on the sphere. Two types of separating circles are distinguished: incident circles, which pass through exactly three dots, and avoidant circles, which pass through none of the dots, considered up to equivalence by the induced bipartition. For incident circles, the number of circles separating the remaining \(n-3\) dots into parts of sizes \(k\) and \(\ell\) with \(k+\ell=n-3\) is \[ I_{k,\ell}(n)= \begin{cases} 2(k+1)(\ell+1),&k\ne \ell,\\[4pt] (k+1)^2,&k=\ell. \end{cases} \] For avoidant circles, the number of equivalence classes separating the \(n\) dots into parts of sizes \(k\) and \(\ell\) with \(k+\ell=n\) is \[ A_{k,\ell}(n)= \begin{cases} 2k\ell-k-\ell+2,&k\ne \ell,\\[4pt] k^2-k+1,&k=\ell. \end{cases} \] Both counts are independent of the configuration. The avoidant-circle count is derived from the \(k\)th-order spherical Voronoi decomposition, whose \(2\)-cells correspond to oriented avoidant circles. As the dots move continuously and a cocircular quadruple appears, the Voronoi decomposition changes by one of three local moves, identified with Postnikov’s plabic-graph moves; hence the associated cluster algebra depends only on \((n,k)\), not on the configuration [2505.22851]. A different enumerative theory studies topologically distinct sets of circles in the plane. Well-formed parenthesis words, Dyck paths, and non-intersecting circles on a line are equivalent classical models, yielding the Catalan recurrence \[ P_n=\sum_{k=0}^{n-1}P_kP_{n-1-k} \] and generating function \[ P(x)=1+xP(x)^2. \] When the order of side-by-side factors is ignored, one counts topologically distinct plane packings of non-intersecting circles by the numbers \(C_n\), equivalently unlabeled rooted forests. Their generating function satisfies the Pólya-type equation \[ C(x)=\exp\Bigl(\sum_{k\ge 1}\frac{x^kC(x^k)}{k}\Bigr), \] with initial values \[ C_0=1,\;C_1=1,\;C_2=2,\;C_3=4,\;C_4=9,\;C_5=20,\dots \] The same species-theoretic framework extends to one intersecting pair of circles, arbitrary many disjoint intersecting pairs, and families allowing triple intersections, with corresponding implicit functional equations and asymptotic growth of the form \(\kappa \alpha^n n^{-3/2}\) [1603.00077]. These two enumeration programs are complementary. One counts circles that separate prescribed finite sets of points; the other counts ambient isotopy classes of circle configurations themselves. This suggests a useful distinction between incidence enumeration and topological enumeration. ## 6. Circle chains, closure, and periodicity Classical theorems about chains of tangent or intersecting circles have recently been recast in dynamical form. In the revisited Six Circles Theorem, one starts with a triangle \(P_1P_2P_3\) having angles \(2\alpha_1,2\alpha_2,2\alpha_3\), then constructs a sequence \(C_1,C_2,\dots\) where \(C_i\) is inscribed in the angle at \(P_{i\!\!\pmod 3}\), \(C_{i+1}\) is tangent to \(C_i\), and at each step the smaller tangent circle is chosen. If all circles touch the sides of the triangle rather than their extensions, the chain is \(6\)-periodic. More generally, if at least one tangency point of the initial circle lies on a side of the triangle, then the chain is eventually \(6\)-periodic, but the pre-period may be arbitrarily long [1312.5260]. The proof converts the tangency conditions into an explicit piecewise-linear iteration. With \[ u_i=\sqrt{r_i\cot\alpha_i}, \qquad e_3=\sqrt{\tan\alpha_1\tan\alpha_2}, \] the recurrence becomes a quadratic-root formula, which is then transformed by \[ \varphi_i=\arcsin(u_i/\sqrt p),\qquad \beta_i=\arcsin\sqrt{a_i/p}. \] After three steps one obtains the map \[ f(x)=\bigl|\;|\;|\;x-\beta_1\;|-\beta_2\;|-\beta_3\;\bigr|, \] and every orbit eventually enters a \(2\)-periodic interval. The geometric \(6\)-periodicity is therefore the dynamical shadow of eventual \(2\)-periodicity for \(f\) [1312.5260]. A broader closure theory applies to closed chains \(C_1,\dots,C_n,C_{n+1}=C_1\) in which each neighboring pair intersects or is tangent at a pivot \(A_i\). If \(\phi_{A_i}\) denotes the reversion map from \(C_i\) to \(C_{i+1}\), then for any starting point \(X_1\in C_1\) the polygonal chain \(X_1X_2\dots X_n\) has side \(X_iX_{i+1}\) passing through \(A_i\). The composite \[ \phi=\phi_{A_n}\circ\phi_{A_{n-1}}\circ\cdots\circ \phi_{A_1}:C_1\to C_1 \] is the identity if and only if the transfer angles satisfy \[ \sum_{i=1}^n\mu_i=2k\pi, \qquad \mu_i=\pi-(\delta_i+2\gamma_i), \] equivalently \[ \sum_{i=1}^n(\delta_i+2\gamma_i)=(n-2k)\pi. \] The same paper associates to every pair of indices \(i,j\) a circle \(C_{ij}\) through \(A_i,A_j\) traced by the intersection of the lines \(X_iX_{i+1}\) and \(X_jX_{j+1}\) as the starting point varies, and proves that for every triple \(i0}\Bigr\}, \] with \(\tau\) the product of all primes \(t\) such that \(S\) covers \(\mathcal T_t\) [2412.04662]. In constant-curvature geometry, generalized Apollonius circles coincide with equioptic curves of pairs of circles. If \(c_1,c_2\) have centers \(C_1,C_2\) and radii \(r_1,r_2\), then from an external point \(P\) the equal-angle condition for the tangent pairs is equivalent to \[ \frac{S(d(P,C_1))}{S(d(P,C_2))}=\frac{S(r_1)}{S(r_2)}. \] Thus the equioptic curve of two geodesic circles is exactly the generalized Apollonius curve of their centers [2605.15457]. Finally, in self-dual symmetric \(R\)-spaces, circles are characterized by transformation-theoretic and Riemannian properties. A diffeomorphism belongs to the big transformation group \(G\) if and only if it sends circles to circles. Moreover, if \(c\) is a circle, then there exists a maximal compact subgroup \(K\subset G\) such that \[ y(t)=c(\tan(\pi t/2)) \] is a diametrical unit-speed geodesic in the canonical \(K\)-invariant metric; equivalently, it is a diagonal geodesic in a maximal totally geodesic flat torus. This identifies an invariantly defined “circle” with a geodesic after projective reparametrization [1902.01467]. Taken together, these developments show that circles form not a single theory but a network of compatible theories: Euclidean incidence structures, separators and representers in combinatorics, dynamically constrained chains, arithmetic loci in \(\mathbb Z^2\), constant-curvature equioptic curves, and homogeneous-space trajectories preserved by large transformation groups. Source: https://www.emergentmind.com/topics/circles