Related papers: Counter Examples to Invariant Circle Packing
The traditional Riemann Mapping Theorem can be proved with circle packing techniques. We prove the Combinatorial Riemann Mapping Theorem for tilings of bounded size using circle packings.
In this note we show that a bounded degree planar triangulation is recurrent if and only if the set of accumulation points of some/any circle packing of it is polar (that is, planar Brownian motion avoids it with probability 1). This…
In this paper, we study two types of strong subgraph packing problems in digraphs, including internally disjoint strong subgraph packing problem and arc-disjoint strong subgraph packing problem. These problems can be viewed as…
A 4-regular planar graph $G$ is said to be circle representable if there exists a collection of circles drawn on the plane such that the touching and crossing points correspond to the vertices of $G$, and the circular arcs between those…
Let $S$ be a set of $n$ points in the unit square $[0,1]^2$, one of which is the origin. We construct $n$ pairwise interior-disjoint axis-aligned empty rectangles such that the lower left corner of each rectangle is a point in $S$, and the…
The Discrete Schwarz-Pick Lemma is a discrete analogue of the classical result from complex analysis, arising from the connection between circle packings and conformal maps established by Thurston. Previous works by Beardon-Stephanson and…
We consider each of the three classes of representations of cyclic groups that arise in the study of rational sphere maps. We study the possible number of terms for invariant polynomials with non-negative coefficients that are constant on…
Random planar maps are considered in the physics literature as the discrete counterpart of random surfaces. It is conjectured that properly rescaled random planar maps, when conditioned to have a large number of faces, should converge to a…
The population model of Busenberg and Travis is a paradigmatic model in ecology and tumour modelling due to its ability to capture interesting phenomena like the segregation of populations. Its singular mathematical structure enforces the…
We consider a notion of uniform thinning for a finite sequence of random variables $(X_1,...,X_n)$ obtained by removing one random variable, uniformly at random. If a triangular array of random variables $(X_{n,k} : n \in \mathbb{N}_+, 1…
We study global scale invariance along with the unimodular gravity in the vacuum. The global scale invariant gravitational action which follows the unimodular general coordinate transformations is considered without invoking any scalar…
We study the set of image tuples arising from fixed cameras observing varying planar 3-dimensional point configurations. We derive a formula for the number of complex critical points of the triangulation problem, which seeks to reconstruct…
This article is concerned with the representation of curves by means of integral invariants. In contrast to the classical differential invariants they have the advantage of being less sensitive with respect to noise. The integral invariant…
In this paper we analyse the selection problem for weak solutions of the transport equation with rough vector field. We answer in the negative the question whether solutions of the equation with a regularized vector field converge to a…
We introduce notions of stationarily ordered types and theories; the latter generalizes weak o-minimality and the first is a relaxed version of weak o-minimality localized at the locus of a single type. We show that forking, as a binary…
Packings of macroscopic granular chains capture some of the essential aspects of molecular polymer systems and have been suggested as a paradigm to understand the physics on a molecular scale. However, here we demonstrate that the…
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…
We introduce a new variant of the weak optimal transport problem where mass is distributed from one space to the other through unnormalized kernels. We give sufficient conditions for primal attainment and prove a dual formula for this…
A folklore result due to M.W. Hirsch states that most competitive maps admit a carrying simplex, i.e., an invariant hypersurface which attracts all nontrivial orbits. The common approach in the study of these maps is to focus on the…
Cycle packing is a fundamental problem in optimization, graph theory, and algorithms. Motivated by recent advancements in finding vertex-disjoint paths between a specified set of vertices that either minimize the total length of the paths…