Related papers: Translating graphs by mean curvature flow
This work is a survey of the most relevant background material to motivate and understand the construction and classification of translating solutions to mean curvature flow on a family of solvmanifolds. We introduce the mean curvature flow…
We study 3-plane drawings, that is, drawings of graphs in which every edge has at most three crossings. We show how the recently developed Density Formula for topological drawings of graphs (KKKRSU GD 2024) can be used to count the…
We completely characterize circulant graphs with valency up to $4$ that admit perfect state transfer. Those of valency $3$ do not admit it. On the other hand, circulant graphs with valency $4$ admit perfect state transfer only in two…
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations.…
We introduce in this paper new and very effective numerical methods based on neural networks for the approximation of the mean curvature flow of either oriented or non-orientable surfaces. To learn the correct interface evolution law, our…
We develop a theory of surfaces with boundary moving by mean curvature flow. In particular, we prove a general existence theorem by elliptic regularization, and we prove boundary regularity at all positive times under very mild hypotheses.
Let $G$ be a simple topological graph and let $\Gamma$ be a polyline drawing of $G$. We say that $\Gamma$ \emph{partially preserves the topology} of $G$ if it has the same external boundary, the same rotation system, and the same set of…
For the right-angled Artin group action on the extension graph, it is known that the minimal asymptotic translation length is bounded above by 2 provided that the defining graph has diameter at least 3. In this paper, we show that the same…
Random matrix models generalize to Group Field Theories (GFT) whose Feynman graphs are dual to gluings of higher dimensional simplices. It is generally assumed that GFT graphs are always dual to pseudo manifolds. In this paper we prove that…
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…
Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…
A translation surface of Euclidean space $\r^3$ is the sum of two regular curves $\alpha$ and $\beta$, called the generating curves. In this paper we classify the minimal translation surfaces of $\r^3$ and we give a method of construction…
We prove that the curvature flow of an embedded planar network of three curves connected through a triple junction, with fixed endpoints on the boundary of a given strictly convex domain, exists smooth until the lengths of the three curves…
The aim of this paper is to obtain an asymptotic expansion for ergodic integrals of translation flows on flat surfaces of higher genus (Theorem 1) and to give a limit theorem for these flows (Theorem 2).
We propose a generalization of transformer neural network architecture for arbitrary graphs. The original transformer was designed for Natural Language Processing (NLP), which operates on fully connected graphs representing all connections…
We introduce the triple crossing number, a variation of crossing number, of a graph, which is the minimal number of crossing points in all drawings with only triple crossings of the graph. It is defined to be zero for a planar graph, and to…
It is shown that a simple graph which is embeddable in the real projective plane is minimally 3-rigid if and only if it is (3,6)-tight. Moreover the topologically uncontractible embedded graphs of this type are constructible from one of 8…
We prove the existence and uniqueness of radial graphs over a given domain of $\mathbb{S}^{n}$ having boundary on the sphere $\mathbb{S}^{n}$ and whose mean curvature at every point equals a prescribed positive function satisfying suitable…
We consider the evolution of hypersurfaces in $\mathbb{R}^{n+1}$ with normal velocity given by a positive power of the mean curvature. The hypersurfaces under consideration are assumed to be strictly mean convex (positive mean curvature),…
A graph is beyond-planar if it can be drawn in the plane with a specific restriction on crossings. Several types of beyond-planar graphs have been investigated, such as k-planar if every edge is crossed at most k times and RAC if edges can…