Related papers: Packing Disks by Flipping and Flowing
Theoretically and experimentally, we study electroviscous phenomena resulting from charge-flow coupling in a nanoscale capillary. Our theoretical approach relies on Poisson-Boltzmann mean-field theory and on coupled linear relations for…
A beer bottle or soda can on a table, when slightly tipped and released, falls to an upright position and then rocks up to a somewhat opposite tilt. Superficially this rocking motion involves a collision when the flat circular base of the…
Given a polygon $P$, for two points $s$ and $t$ contained in the polygon, their \emph{geodesic distance} is the length of the shortest $st$-path within $P$. A \emph{geodesic disk} of radius $r$ centered at a point $v \in P$ is the set of…
In this paper, we consider the Cycle Packing problem on unit disk graphs defined as follows. Given a unit disk graph G with n vertices and an integer k, the goal is to find a set of $k$ vertex-disjoint cycles of G if it exists. Our…
A disc packing in the plane is compact if its contact graph is a triangulation. There are $9$ values of $r$ such that a compact packing by discs of radii $1$ and $r$ exists. We prove, for each of these $9$ values, that the maximal density…
Using the well-known ``displace, cut and reflect'' method used to generate disks from given solutions of Einstein field equations, we construct static disks made of perfect fluid based on vacuum Schwarzschild's solution in isotropic…
The famous flow decomposition theorem of Gallai (1985) states that any static edge $s$,$d$-flow in a directed graph can be decomposed into a nonnegative linear combination of incidence vectors of paths and cycles. In this paper, we study…
We provide a geometric representation of the Poisson and Martin boundaries of a transient, bounded degree triangulation of the plane in terms of its circle packing in the unit disc. (This packing is unique up to M\"obius transformations.)…
For any configuration of pebbles on the nodes of a graph, a pebbling move replaces two pebbles on one node by one pebble on an adjacent node. A cover pebbling is a move sequence ending with no empty nodes. The number of pebbles needed for a…
Swimmers caught in a rip current flowing away from the shore are advised to swim orthogonally to the current to escape it. We describe a mathematical principle in a similar spirit. More precisely, we consider flows $\gamma$ in the plane…
We present an effective method for recovering the topology of a bordered oriented surface with marked points from its cluster algebra. The information is extracted from the maximal triangulations of the surface, those that have exchange…
For accurately obtaining the relationship between the carrier mobility and the applied electric field, a new multi-layer sample has been designed. Polyvinyl fluoride (PVF) films were hot pressed on both sides of linear low density…
Excess pore pressure in granular--fluid mixtures can transiently suppress frictional contacts and dramatically enhance flow mobility, yet its evolution is commonly modeled using constant effective diffusivities. Here we show that the…
The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, and an edge when two triangulations differ by one flip that replaces one triangulation edge by another. The flip graph is known to have some…
We study photon diffusion in a two-dimensional random packing of monodisperse disks as a simple model of granular media and wet foams. We assume that the intensity reflectance of disks is a constant. We present an analytic expression for…
A circle packing is a collection of disks with disjoint interiors in the plane. It naturally defines a graph by tangency. It is shown that there exists $p>0$ such that the following holds for every circle packing: If each disk is retained…
For an integer $b \ge 1$, a $b$-matching (resp. $b$-edge cover) of a graph $G=(V,E)$ is a subset $S\subseteq E$ of edges such that every vertex is incident with at most (resp. at least) $b$ edges from $S$. We prove that for any $b \ge 1$…
Given any smooth plane curve {\alpha}(s)representing a mirror that reflects light the usual way and any radiant light source at a point in the plane, the reflected light will produce a caustic envelope. For such an envelope, we show that…
We consider the two-dimensional motion of the coupled system of a viscous incompressible fluid and a rigid disc moving with the fluid, in the whole plane. The fluid motion is described by the Navier-Stokes equations and the motion of the…
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…