Related papers: Properness for circle packings and Delaunay circle…

The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…

One can associate to many of the well known algebraically integrable systems of Jacobians (generalized Hitchin systems, Sklyanin) a ruled surface which encodes much of its geometry. If one looks at the classification of such surfaces, there…

We consider the quasiconformal dilatation of projective transformations of the real projective plane. For non-affine transformations, the contour lines of dilatation form a hyperbolic pencil of circles, and these are the only circles that…

We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…

Deep neural networks (DNNs), especially deep convolutional neural networks (CNNs), have emerged as the powerful technique in various machine learning applications. However, the large model sizes of DNNs yield high demands on computation…

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a…

Bowers and Stephenson introduced the notion of inversive distance circle packings as a natural generalization of Thurston's circle packings. They further conjectured that discrete conformal maps induced by inversive distance circle packings…

Given a locally presentable category together with a suitable functorial cylinder object, we construct model structures which are sensitive to the `direction' of the cylinder. We show that the Covariant and Contravariant model structures on…

Peter Doyle conjectured that locally univalent circle packings on the hexagonal lattice only consist of regular hexagonal packings and Doyle spirals, which is called the Doyle conjecture. In this paper, we prove a rigidity theorem for Doyle…

It has been shown that univalent circle packings filling in the complex plane $\bold C$ are unique up to similarities of $\bold C$. Here we prove that bounded degree branched circle packings properly covering $\bold C$ are uniquely…

In this paper we prove that any Riemannian surface, with no restriction of curvature at all, can be decomposed into blocks belonging just to some of these types: generalized Y-pieces, generalized funnels and halfplanes.

Brunella's classification implies that every smooth foliation on a compact complex surface admits a singular transversely projective structure. However, Biswas and Dumitrescu's recent work shows that certain foliations on compact complex…

Let $V$ be a finite dimensional complex vector space and $W\subset \GL(V)$ be a finite complex reflection group. Let $V^{\reg}$ be the complement in $V$ of the reflecting hyperplanes. A classical conjecture predicts that $V^{\reg}$ is a…

The motivation of this paper is to recognize a geometric shape from a noisy sample in the form of a point cloud. Inspired by the HDBSCAN clustering algorithm, we introduce the core dissimilarity, from which we construct the core…

We introduce orthogonal ring patterns in the 2-sphere and in the hyperbolic plane, consisting of pairs of concentric circles, which generalize circle patterns. We show that their radii are described by a discrete integrable system. This is…

An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure of arrangements on closed orientable surfaces, in (Linhart,…

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…

Using a recently developed method to simulate percolation on large clusters of distributed machines [N. R. Moloney and G. Pruessner, Phys. Rev. E 67, 037701 (2003)], we have numerically calculated crossing, spanning and wrapping…

Ordinary maps satisfy topological recursion for a certain spectral curve $(x, y)$. We solve a conjecture from arXiv:1710.07851 that claims that fully simple maps, which are maps with non self-intersecting disjoint boundaries, satisfy…

In this paper we study linearly repetitive Delone sets and prove, following the work of Bellissard, Benedetti and Gambaudo, that the hull of a linearly repetitive Delone set admits a properly nested sequence of box decompositions (tower…