Related papers: Packing Disks by Flipping and Flowing
Consider a collection of finitely many polygons in $\mathbb C$, such that for each side of each polygon, there exists another side of some polygon in the collection (possibly the same) that is parallel and of equal length. A translation…
A packing of a graph G with Hamilton cycles is a set of edge-disjoint Hamilton cycles in G. Such packings have been studied intensively and recent results imply that a largest packing of Hamilton cycles in G_n,p a.a.s. has size \lfloor…
The Sample Compression Conjecture of Littlestone & Warmuth has remained unsolved for over two decades. This paper presents a systematic geometric investigation of the compression of finite maximum concept classes. Simple arrangements of…
A well known Euler's formula consequence's corollary in graph theory states that: For a connected simple planar graph with $n$ vertices and $m$ edges, and girth $g$, we have $m \leq \frac{g}{g-2}(n-2)$. We show that a connected simple plane…
We propose a novel framework for simulating ink as a particle-laden flow using particle flow maps. Our method addresses the limitations of existing flow-map techniques, which struggle with dissipative forces like viscosity and drag, thereby…
We demonstrate that edge currents develop in active chiral matter -- composed of spinning disk-shaped grains with chirally arranged tilted legs confined in a circular vibrating chamber -- due to boundary shielding over a wide range of…
The description of free surface flows can often be simplified to thin film (or lubrication) equations, when the slopes of the liquid-gas interface are small. Here we present a long wavelength theory that remains fully quantitative for steep…
A graph is called pseudo-outerplanar if each block has an embedding on the plane in such a way that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. In this…
We are interested in the following problem of covering the plane by a sequence of congruent circular disks with a constraint on the distance between consecutive disks. Let $(\mathcal{D}_n)_{n \in \mathbb N}$ be a sequence of closed unit…
This paper corresponds to Section 8 of arXiv:1912.05774v3 [math.GT]. The contents until Section 7 are published in Annali di Matematica Pura ed Applicata as a separate paper. In that paper, it is proved that for any positive flow-spine P of…
We experimentally investigate spin-polarized electron transport between two ferromagnetic contacts, placed at the edge of a two-dimensional electron system with band inversion. The system is realized in a narrow (8~nm) HgTe quantum well,…
{ An edge $e$ in a matching covered graph $G$ is {\em removable} if $G-e$ is matching covered, which was introduced by Lov\'asz and Plummer in connection with ear decompositions of matching covered graphs. A {\it brick}} is a non-bipartite…
This paper presents a new reformulated theorem for fields embedded on a sphere or a disk. We focus in particular on the associated sphere of a disk when closing its only one boundary. We call this the disk-sphere duality theorem for the…
Describing the phenomena of the surrounding world is an interesting task that has long attracted the attention of scientists. However, even in seemingly simple phenomena, complex dynamics can be revealed. In particular, leaves on the…
We model collective disk flow though a square array of obstacles as the flow direction is changed relative to the symmetry directions of the array. At lower disk densities there is no clogging for any driving direction, but as the disk…
In hyperbolic background geometry, we investigate a generalized circle packing (including circles, horocycles and hypercycles) with conical singularities on a surface with boundary, which has a total geodesic curvature on each generalized…
In this paper, we generalize our results in \cite{GX3} to triangulated surfaces in hyperbolic background geometry, which means that all triangles can be embedded in the standard hyperbolic space. We introduce a new discrete Gaussian…
By an integral equation approach to the time-harmonic classical Maxwell equations, we describe the dispersion in the nonretarded frequency regime of the edge plasmon-polariton (EPP) on a semi-infinite flat sheet. The sheet has an arbitrary,…
Evaluating Ollivier-Ricci (OR) curvature on large-scale graphs is computationally prohibitive due to the necessity of solving an optimal transport problem for every edge. We bypass this computational bottleneck by deriving explicit,…
We prove that every 2k-edge-connected graph with countably many edge-ends admits a k-arc-connected orientation, extending the previous result by Assem, Koloschin and Pitz that also assumed the hypothesis of the graph being locally finite.…