Related papers: Graphical Translators for Mean Curvature Flow

In this report, we consider extended real-valued functions on some real vector space. Gerstewitz functionals are used to construct all translative functions. We derive formulas for translative functions which are lower semicontinuous,…

A connected graph of order $n$ admitting a semiregular automorphism of order $n/k$ is called a $k$-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for…

Given a smooth closed embedded self-shrinker $S$ with index $I$ in $\mathbb{R}^{n}$, we construct an $I$-dimensional family of complete translators polynomially asymptotic to $S\times\mathbb{R}$ at infinity, which answers a long-standing…

The general translator formalism and computing specific implementations are proposed. The implementation of specific elements necessary to process the source and destination information within the translators are presented. Some common…

Graph neural networks have emerged as a leading architecture for many graph-level tasks, such as graph classification and graph generation. As an essential component of the architecture, graph pooling is indispensable for obtaining a…

A spacelike surface in Minkowski space $\mathbb{R}_1^3$ is called a $K^\alpha$-translator of the flow by the powers of Gauss curvature if satisfies $K^\alpha= \langle N,\vec{v}\rangle$, $\alpha \neq 0$, where $K$ is the Gauss curvature, $N$…

In this paper, we consider the interpretability of the foundational Laplacian-based semi-supervised learning approaches on graphs. We introduce a novel flow-based learning framework that subsumes the foundational approaches and additionally…

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…

In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…

In this paper, for the Lorentz manifold $M^{2}\times\mathbb{R}$, with $M^{2}$ a $2$-dimensional complete surface with nonnegative Gaussian curvature, we investigate its space-like graphs over compact strictly convex domains in $M^{2}$,…

We prove some non-existence theorems for translating solutions to Lagrangian mean curvature flow. More precisely, we show that translating solutions with an $L^2$ bound on the mean curvature are planes and that almost-calibrated translating…

In this paper, inspired by the work of Spruck-Xiao [27] and based partly on a result of Derdzi\'nski [11], we prove the convexity of complete 2-convex translating and expanding solitons to the mean curvature flow in $\mathbb{R}^{n+1}$. More…

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…

In this paper, we can prove the existence of translating solutions to the nonparametric mean curvature flow with nonzero Neumann boundary data in a prescribed product manifold $M^{n}\times\mathbb{R}$, where $M^{n}$ is an $n$-dimensional…

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 show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first charac- terize some functions having linear translators, based on which several families of…

For a graph $\mathbb{Q}=(\mathbb{V},\mathbb{E})$, the transformation graphs are defined as graphs with vertex set being $\mathbb{V(Q)} \cup \mathbb{E(Q)}$ and edge set is described following certain conditions. In comparison to the…

In many ways, graphs are the main modality of data we receive from nature. This is due to the fact that most of the patterns we see, both in natural and artificial systems, are elegantly representable using the language of graph structures.…

In this paper, we give a complete description of all translation hypersurfaces with constant r-curvature Sr, in the Euclidean space.

We classify translation surfaces in isotropic geometry with arbitrary constant isotropic Gaussian and mean curvature under the condition that at least one of translating curves lies in a plane.