Related papers: The Graphs of Planar Soap Bubbles
We present synthetic Doppler maps of gaseous flows in semidetached binaries based on the results of 3D gas dynamical simulations. Using of gas dynamical calculations alongside with Doppler tomography technique permits to identify main…
The minimal surfaces meeting in triples with equal angles along a common boundary naturally arise from soap films and other physical phenomenon. They are also the natural extension of the usual minimal surface. In this paper, we consider…
In this work we consider a generalization of graph flows. A graph flow is, in its simplest formulation, a labeling of the directed edges with real numbers subject to various constraints. A common constraint is conservation in a vertex,…
We classify topologically trivial Legendrian $\Theta$-graphs and identify the complete family of nondestabilizeable Legendrian realizations in this topological class. In contrast to all known results for Legendrian knots, this is an…
Woess \cite{Woess98} introduced a curvature notion on the set of edges of a planar graph, called $\Psi$-curvature in our paper, which is stable under the planar duality. We study geometric and combinatorial properties for the class of…
A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the graph in question is $3$-edge-colourable, the rest of cubic…
A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…
A permutation graph is a graph that can be derived from a permutation, where the vertices correspond to letters of the permutation, and the edges represent inversions. We provide a construction to show that there are infinitely many…
We construct real analytic flat Moebius strips of arbitrary isotopy types, whose centerlines are geodesics or lines of curvature.
We derive boundary conditions at interfaces (contact discontinuities) for a class of Lagrangian models describing, in particular, bubbly flows. We use these conditions to study Kelvin-Helmholtz' instability which develops in the flow of two…
We prove that any graph of multicurves satisfying certain natural properties is either hyperbolic, relatively hyperbolic, or thick. Further, this geometric characterization is determined by the set of subsurfaces that intersect every vertex…
Hamiltonian flows on compact surfaces are characterized, and the topological invariants of such flows with finitely many singular points are constructed from the viewpoints of integrable systems, fluid mechanics, and dynamical systems.…
Motivated by the moduli theory of taut contact circles on spherical 3-manifolds, we relate taut contact circles to transversely holomorphic flows. We give an elementary survey of such 1-dimensional foliations from a topological viewpoint.…
We identify incompressible planar linear flows that are generalizations of the well known one-parameter family characterized by the ratio of in-plane extension to (out-of-plane) vorticity. The latter `canonical' family is classified into…
We classify cylindrical surfaces in the Euclidean space whose mean curvature is a $n$th-power of the distance to a reference plane. The generating curves of these surfaces, called $n$-elastic curves, have a variational characterization as…
A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…
We develop a full characterization of abelian quantum statistics on graphs. We explain how the number of anyon phases is related to connectivity. For 2-connected graphs the independence of quantum statistics with respect to the number of…
In this brief paper, a simple and fast computational method, the Planar Visibility Graph Networks Algorithm was proposed based on the famous Visibility Graph Algorithm, which can fulfill converting two dimensional timeseries into a planar…
We introduce a novel definition of curvature for hypergraphs, a natural generalization of graphs, by introducing a multi-marginal optimal transport problem for a naturally defined random walk on the hypergraph. This curvature, termed…
Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…