Related papers: Rigidity of Circle Packings with Crosscuts
Motivated by automated junction recognition in tracking data, we study a problem of placing a square or disc of fixed size in an arrangement of lines or line segments in the plane. We let distances among the intersection points of the lines…
We prove some rigidity theorems for configurations of closed disks. First, fix two collections $\mathcal{C}$ and $\tilde{\mathcal{C}}$ of closed disks in the Riemann sphere $\hat{\mathbb{C}}$, sharing a contact graph which…
We define a new category of non-archimedean analytic spaces over a complete discretely valued field, which we call uniformly rigid. It extends the category of rigid spaces, and it can be described in terms of bounded functions on products…
In this paper, we prove various results for circle actions on compact unitary manifolds with discrete fixed point sets, generalizing results for almost complex manifolds. For a circle action on a compact unitary manifold with a discrete…
The notion of a pseudoknot is defined as an equivalence class of knot diagrams that may be missing some crossing information. We provide here a topological invariant schema for pseudoknots and their relatives, 4-valent rigid vertex spatial…
We study the combinatorial and rigidity properties of disk packings with generic radii. We show that a packing of $n$ disks in the plane with generic radii cannot have more than $2n-3$ pairs of disks in contact. The allowed motions of a…
Inspired by a question of Ferrari in the physics context of JT gravity, we introduce and enumerate a combinatorial family of quadrangulations of the disk, called rigid quadrangulations. These form a subclass of the flat quadrangulations in…
In the classic circle packing problem, one asks whether a given set of circles can be packed into a given container. Packing problems like this have been shown to be $\mathsf{NP}$-hard. In this paper, we present new sufficient conditions…
Tangencies correspond to singularities of impact systems, separating between impacting and non-impacting trajectory segments. The closure of their orbits constitute the singularity set, which, even in the simpler billiard limit, is known to…
Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…
For a graph $G$ and partition $\mathcal{U}$ of its vertex set, an independent transversal of $(G, \mathcal{U})$ is an independent set of $G$ that contains one vertex from each block of $\mathcal{U}$. Buys, Kang, and Ozeki studied when a…
We introduce a notion of embedding codimension of an arbitrary local ring, establish some general properties, and study in detail the case of arc spaces of schemes of finite type over a field. Viewing the embedding codimension as a measure…
Packing problems have been a source of fascination for millenia and their study has produced a rich literature that spans numerous disciplines. Investigations of hard-particle packing models have provided basic insights into the structure…
We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…
The paper deals with Henselian valued field with analytic structure. Actually, we are focused on separated analytic structures, but the results remain valid for strictly convergent analytic ones as well. A classical example of the latter is…
Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model…
In this paper, we introduce and investigate a novel class of analytic and univalent functions of negative coefficients in the open unit disk. For this function class, we obtain characterization and distortion theorems as well as the radii…
Rigidity, arising in discrete geometry, is the property of a structure that does not flex. Laman provides a combinatorial characterization of rigid graphs in the Euclidean plane, and thus rigid graphs in the Euclidean plane have…
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
The Andreev-Thurston Circle Packing Theorem is generalized to packings of convex bodies in planar simply connected domains. This turns out to be a useful tool for constructing conformal and quasiconformal mappings with interesting geometric…