Related papers: Packing Disks by Flipping and Flowing
We consider a one-parameter family of invertible maps of a two-dimensional lattice, obtained by applying round-off to planar rotations. All orbits of these maps are conjectured to be periodic. We let the angle of rotation approach pi/2, and…
Motivated by biological questions, we study configurations of equal-sized disks in the Euclidean plane that neither pack nor cover. Measuring the quality by the probability that a random point lies in exactly one disk, we show that the…
Can a disk orbiting a central body be eccentric, when the disk feels its own self-gravity and is pressureless? Contradictory answers appear in the literature. We show that such a disk can be eccentric, but only if it has a sharply truncated…
Let $r \ge 3$ be fixed and $G$ be an $n$-vertex graph. A long-standing conjecture of Gy\H{o}ri states that if $e(G) = t_{r-1}(n) + k$, where $t_{r-1}(n)$ denotes the number of edges of the Tur\'{a}n graph on $n$ vertices and $r - 1$ parts,…
We present an individual-based model describing disk-like self-propelled particles moving inside parallel planes. The disk directions of motion follow alignment rules inside each layer. Additionally, the disks are subject to interactions…
The book embedding of a graph $G$ is to place the vertices of $G$ on the spine and draw the edges to the pages so that the edges in the same page do not cross with each other. A book embedding is matching if the vertices in the same page…
It is known that planar disks and small spherical caps are the only constant mean curvature graphs whose boundary is a round circle. Usually, the proof invokes the Maximum Principle for elliptic equations. This paper presents a new proof of…
We formulate a finite-particle method of mass transport that accounts for general mixed boundary conditions. The particle method couples a geometrically-exact treatment of advection; Wasserstein gradient-flow dynamics; and a…
Felsner introduced a cycle reversal, namely the `flip' reversal, for \alpha-orientations (i.e., each vertex admits a prescribed out-degree) of a graph G embedded on the plane and further proved that the set of all the \alpha-orientations of…
Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in…
For integers $a\ge 2b>0$, a \emph{circular $a/b$-flow} is a flow that takes values from $\{\pm b, \pm(b+1), \dots, \pm(a-b)\}$. The Planar Circular Flow Conjecture states that every $2k$-edge-connected planar graph admits a circular…
The following problem, which stems from the ``flux phase'' problem in condensed matter physics, is analyzed and extended here: One is given a planar graph (or lattice) with prescribed vertices, edges and a weight $\vert t_{xy}\vert$ on each…
A Sierpi\'nski packing in the $2$-sphere is a countable collection of disjoint, non-separating continua with diameters shrinking to zero. We show that any Sierpi\'nski packing by continua whose diameters are square-summable can be…
Planar bicolored (plabic) graphs are combinatorial objects introduced by Postnikov to give parameterizations of the positroid cells of the totally nonnegative Grassmannian $\text{Gr}^{\geq 0}(n,k)$. Any two plabic graphs for the same…
We consider the $Q_k$ flow on complete non-compact graphs. We prove that a complete graph evolves by the $Q_k$ curvature up to some time $T$ depending on the radius of a sphere enclosed by the initial graph.
The thermodynamic properties of disks moving in a channel sufficiently narrow that they can collide only with their nearest neighbors can be solved exactly by determining the eigenvalues and eigenfunctions of an integral equation. Using it…
We consider the Gaussian curvature conjecture of a minimal graph $S$ over the unit disk. First of all we reduce the general conjecture to the estimating the Gaussian curvature of some Scherk's type minimal surfaces over a quadrilateral…
In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given. The evidence of our…
We make rigorous an old idea of using mean curvature flow to prove a theorem of Richard Hamilton on the compactness of proper hypersurfaces with pinched, bounded curvature.
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…