Related papers: The Graphs of Planar Soap Bubbles
We prove that every planar graph with maximum degree three has a planar drawing in which the edges are drawn as circular arcs that meet at equal angles around every vertex. Our construction is based on the Koebe-Thurston-Andreev circle…
In this paper, we consider topological featurizations of data defined over simplicial complexes, like images and labeled graphs, obtained by convolving this data with various filters before computing persistence. Viewing a convolution…
We investigate multidimensional nowhere-zero flows of bridgeless graphs. By extending the established use of the Euclidean norm, this paper considers the Manhattan and Chebyshev norms, leading to the definition of the flow numbers…
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…
The present study aims to investigate the motion of buoyant rings in vertical soap films. Thickness differences and related bi-dimensional densities are considered as the motor leading to bi-dimensional buoyancy. We show how this effect can…
We investigate under which assumptions the flow associated to autonomous planar vector fields inherits the Sobolev or BV regularity of the vector field. We consider nearly incompressible and divergence-free vector fields, taking advantage…
Multilevel modeling extends traditional modeling techniques with a potentially unlimited number of abstraction levels. Multilevel models can be formally represented by multilevel typed graphs whose manipulation and transformation are…
We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…
Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…
We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…
We investigate crystalline order on a two-dimensional paraboloid of revolution by assembling a single layer of millimeter-sized soap bubbles on the surface of a rotating liquid, thus extending the classic work of Bragg and Nye on planar…
We construct steady non-spherical bubbles and drops, which are traveling wave solutions to the axisymmetric two-phase Euler equations with surface tension, whose inner phase is a bounded connected domain. The solutions have a uniform…
A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…
We develop a basic theory for divisible design graphs with possible selfloops (LDDG's), and describe two infinite families of such graphs, some members of which are also classical examples of divisible design graphs without loops (DDG's).…
We prove that, in a two-dimensional strip, a steady flow of an ideal incompressible fluid with no stationary point and tangential boundary conditions is a shear flow. The same conclusion holds for a bounded steady flow in a half-plane. The…
The Reeb space of a smooth function is a topological and combinatoric object and fundamental and important in understanding topological and geometric properties of the manifold of the domain. It is the graph and a topological space endowed…
We utilize total-internal reflection to isolate the two-dimensional `surface foam' formed at the planar boundary of a three-dimensional sample. The resulting images of surface Plateau borders are consistent with Plateau's laws for a truly…
We summarize different approaches to the theory of quantum graphs and provide several ways to construct concrete examples. First, we classify all undirected quantum graphs on the quantum space $M_2$. Secondly, we apply the theory of…
Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks. This chapter provides an overview of graph…
Building on recently established enumerative connections between lambda calculus and the theory of embedded graphs (or "maps"), this paper develops an analogy between typing (of lambda terms) and coloring (of maps). Our starting point is…