Related papers: Closing Theorems for Circle Chains

We show that every semialgebraic set admits a semialgebraic triangulation such that each closed simplex is $C^1$ differentiable. As an application, we give a straightforward definition of the integration $\int_X \omega$ over a compact…

We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity…

In this article, we prove the existence of common fixed points for a pair of maps on a $q$-spherically complete $T_0$-ultra-quasi-metric space. The present article is a generalization, in the assymmetric setting of the paper of Rao et…

A low-dimensional version of our main result is the following `converse' of the Conway-Gordon-Sachs Theorem on intrinsic linking of the graph $K_6$ in 3-space: For any integer $z$ there are 6 points $1,2,3,4,5,6$ in 3-space, of which every…

In this paper, we develop the theory of Jacobian rings of open complete intersections, which mean a pair $(X,Z)$ where $X$ is a smooth complete intersection in the projective space and and $Z$ is a simple normal crossing divisor in $X$…

Thurston's Circle Pattern Theorem studies existence and rigidity of circle patterns of a given combinatorial type and the given non-obtuse exterior intersection angles. Using topological degree theory, variational principle, Teichmuller…

We analyze loci of triangle centers over variants of two-well known triangle porisms: the bicentric and confocal families. Specifically, we evoke the general version of Poncelet's closure theorem whereby individual sides can be made tangent…

Let A_1,...,A_k be a collection of families of subsets of an n-element set. We say that this collection is cross-intersecting if for any i,j in [k] with i not equal to j, A in A_i and B in A_j implies that the intersection of A and B is…

By a classical result of Roitman, a complete intersection $X$ of sufficiently small degree admits a rational decomposition of the diagonal. This means that some multiple of the diagonal by a positive integer $N$, when viewed as a cycle in…

We prove that every pointed closed convex set in $\mathbb{R}^n$ is the intersection of all the rational closed halfspaces that contain it. This generalizes a previous result by the authors for compact convex sets.

We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed…

Paul Erdos asked if, among sufficiently many points in general position, there are always $k$ points such that all the circles through $3$ of these $k$ points have different radii. He later proved that this is indeed the case. However, he…

We study the Coulomb chain where particles are restricted to one dimension and experience three-dimensional Coulomb interactions with their nearest and next-to-nearest neighbours. The distances between consecutive particles are treated as…

Meyerson's Theorem says that all but at most 2 points of any Jordan loop are vertices of inscribed equilateral triangles. We show that for any Jordan loop there are uncountable many other triangle shapes for which this same result is true.…

We investigate completed interlacing of zeros for pairs of polynomial sequences that fail to interlace by exactly two points. Using a general mixed recurrence relation, we identify a quadratic polynomial whose zeros serve as the two extra…

Chasles' Quadrilateral Theorem is a classical statement about four tangents to a conic that simultaneously circumscribe a circle. In its various formulations, it relates the concurrence of certain lines to the existence of confocal conics…

Suppose we are given a graph and want to show a property for all its cycles (closed chains). Induction on the length of cycles does not work since sub-chains of a cycle are not necessarily closed. This paper derives a principle reminiscent…

A complete first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition.…

Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…

We exhibit two instances of the cyclic sieving phenomenon - one on dissections of a polygon of a fixed type and one on triangulations of a once-punctured polygon. We use these results to give refined enumerations of certain families of…