Related papers: Comparing Teichm\"uller and curve graph translatio…
Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with vertex set $X$ and diameter $D$. Let $A$ denote the adjacency matrix of $\Gamma$. For a vertex $x\in X$ and for $0 \leq i \leq D$, let $E^*_i(x)$ denote the projection matrix…
For a knot diagram we introduce an operation which does not increase the genus of the diagram and does not change its representing knot type. We also describe a condition for this operation to certainly decrease the genus. The proof…
Let $S$ be a boundaryless infinite-type surface with finitely many ends and consider an end-periodic homeomorphism $f$ of S. The end-periodicity of $f$ ensures that $M_f$, its associated mapping torus, has a compactification as a…
Using particle-scale simulations of non-suspended sediment transport for a large range of Newtonian fluids driving transport, including air and water, we determine the bulk transport cessation threshold $\Theta^r_t$ by extrapolating the…
Graph node clustering is a fundamental unsupervised task. Existing methods typically train an encoder through selfsupervised learning and then apply K-means to the encoder output. Some methods use this clustering result directly as the…
We show that for any periodic mapping class, there is some power which maps a nonseparating, simple closed curve to a distinct, disjoint nonseparating curve. As an application of this result, we introduce the notion of stable specific…
Graph signal processing deals with algorithms and signal representations that leverage graph structures for multivariate data analysis. Often said graph topology is not readily available and may be time-varying, hence (dynamic) graph…
Let $L$ be a hyperbolic automorphism of $\mathbb T^d$, $d\ge3$. We study the smooth conjugacy problem in a small $C^1$-neighborhood $\mathcal U$ of $L$. The main result establishes $C^{1+\nu}$ regularity of the conjugacy between two Anosov…
We generalize theorems of Deligne-Mumford and de Jong on semi-stable modifications of families of proper curves. The main result states that after a generically \'etale alteration of the base any (not necessarily proper) family of…
The primary objective of this paper is to introduce Hyers-Ulam-type stability results for monotone, subadditive, and convex graphs. We consider their standard definitions in an approximate sense and demonstrate the existence of a…
Approximating the graph diameter is a basic task of both theoretical and practical interest. A simple folklore algorithm can output a 2-approximation to the diameter in linear time by running BFS from an arbitrary vertex. It has been open…
We obtain new lower bounds of the minimal genus of a locally flat surface representing a 2-dimensional homology class in a topological 4-manifold with boundary, using the von Neumann-Cheeger-Gromov $\rho$-invariant. As an application our…
Given a Riemannian surface, we consider a naturally embedded graph which captures part of the topology and geometry of the surface. By studying this graph, we obtain results in three different directions. First, we find bounds on the…
The famous Erd\H{o}s-Gallai Theorem on the Tur\'an number of paths states that every graph with $n$ vertices and $m$ edges contains a path with at least $\frac{2m}{n}$ edges. In this note, we first establish a simple but novel extension of…
We prove that nonlocal minimal graphs in the plane exhibit generically stickiness effects and boundary discontinuities. More precisely, we show that if a nonlocal minimal graph in a slab is continuous up to the boundary, then arbitrarily…
The detection of anomalous activity in graphs is a statistical problem that arises in many applications, such as network surveillance, disease outbreak detection, and activity monitoring in social networks. Beyond its wide applicability,…
Total five different types of translation surfaces, based upon planarity of translating curves and the absolute figure, arise in a Galilean 3-space. Excepting the type in which both of translating curves are non-planar we obtain these…
In the context of multi-view clustering, graph learning is recognized as a crucial technique, which generally involves constructing an adaptive neighbor graph based on probabilistic neighbors, and then learning a consensus graph for…
Computing the similarity of two point sets is a ubiquitous task in medical imaging, geometric shape comparison, trajectory analysis, and many more settings. Arguably the most basic distance measure for this task is the Hausdorff distance,…
We consider the nonlinear Schr\"{o}dinger (NLS) equation with the subcritical power nonlinearity on a star graph consisting of $N$ edges and a single vertex under generalized Kirchhoff boundary conditions. The stationary NLS equation may…