Related papers: Packing Disks by Flipping and Flowing
We define a notion of (one-sided) edge shift spaces associated to ultragraphs. In the finite case our notion coincides with the edge shift space of a graph. In general, we show that our space is metrizable and has a countable basis of…
We give further considerations on the problem of the evolution of a coronal, force-free magnetic field which threads a differentially rotating, conducting Keplerian disk, extending the work of Li {\it et al.} (2001). This situation is…
The apparently intractable shape of a fold in a compressed elastic film lying on a fluid substrate is found to have an exact solution. Such systems buckle at a nonzero wavevector set by the bending stiffness of the film and the weight of…
We say that a (di)graph $G$ has a perfect $H$-packing if there exists a set of vertex-disjoint copies of $H$ which cover all the vertices in $G$. The seminal Hajnal--Szemer\'edi theorem characterises the minimum degree that ensures a graph…
We investigate vortex dipoles on surfaces of variable negative curvature, focusing on a catenoid of arbitrary throat radius as a concrete example. We construct the effective dynamical system including mutual and geometric self-interaction…
A unit disk graph $G$ on a given set $P$ of points in the plane is a geometric graph where an edge exists between two points $p,q \in P$ if and only if $|pq| \leq 1$. A spanning subgraph $G'$ of $G$ is a $k$-hop spanner if and only if for…
Motivated by the challenge of analyzing data sets with periodic boundary conditions to investigate transportation properties, we introduce a concept of circular max-flow for graphs mapped onto the circle. Unlike classical max-flow…
Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…
The study of the mapping class group of the plane minus a Cantor set uses a graph of loops, which is an analogous of the curve graph in the study of mapping class groups of compact surfaces. The Gromov boundary of this loop graph can be…
We study the following combinatorial problem. Given a planar graph $G=(V,E)$ and a set of simple cycles $\mathcal C$ in $G$, find a planar embedding $\mathcal E$ of $G$ such that the number of cycles in $\mathcal C$ that bound a face in…
The approximately flat outer parts of spiral galaxy rotation curves are commonly interpreted as evidence for a discrepancy between the observed baryonic mass and the dynamical mass inferred from the measured orbital velocities. In many…
We show that $O(n^2)$ exchanging flips suffice to transform any edge-labelled pointed pseudo-triangulation into any other with the same set of labels. By using insertion, deletion and exchanging flips, we can transform any edge-labelled…
We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…
A continuum version of the virial theorem is derived for a radiating self-gravitating accretion disc around a compact object. The central object is point-like, but we can avoid the regularization of its gravitational potential. This is…
The detour between two points u and v (on edges or vertices) of an embedded planar graph whose edges are curves is the ratio between the shortest path in in the graph between u and v and their Euclidean distance. The maximum detour over all…
Establishing the conditions under which orbital, spin and lattice-pseudospin degrees of freedom are mutually coupled in realistic nonequilibrium conditions is a major goal in the emergent field of graphene spintronics. Here, we use…
In this paper we have investigated a circular band formation of fluid-rigid particle mixtures in a fully filled cylinder horizontally rotating about its cylinder axis by direct numerical simulation. These phenomena are modeled by the…
A Bl-packing is a (branched) circle packing that ``properly covers'' the unit disc. We establish some fundamental properties of such packings. We give necessary and sufficient conditions for their existence, prove their uniqueness, and show…
We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of…
We consider the systems of diffusion-orthogonal polynomials, defined in the work [1] of D. Bakry, S. Orevkov and M. Zani and (particularly) explain why these systems with boundary of maximal possible degree should always come from the…