Related papers: Topological properties of generalized Markoff mod …
Local properties of the fundamental group of a path-connected topological space can pose obstructions to the applicability of covering space theory. A generalized covering map is a generalization of the classical notion of covering map…
From a graph $G$ with constant valency $v$ and a (non-compact) manifold $C$ with $v$ boundary components, we build a $G$-periodic manifold $M$. This process gives a class of topologically infinite manifolds which generalizes periodic…
Topological features based on persistent homology capture high-order structural information so as to augment graph neural network methods. However, computing extended persistent homology summaries remains slow for large and dense graphs and…
Defining distances over finite fields formally by $||x-y||:=(x_1-y_1)^2+\cdots + (x_d-y_d)^2$ for $x,y\in \mathbb{F}_q^d$, distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a…
Let $\Theta_{k_1,\cdots,k_\ell}$ denote the generalized theta graph, which consists of $\ell$ internally disjoint paths with lengths $k_1,\cdots, k_{\ell}$, connecting two fixed vertices. We estimate the corresponding extremal number…
We compactify the classical moduli variety of compact Riemann surfaces by attaching moduli of (metrized) graphs as boundary. The compactifications do not admit the structure of varieties and patch together to form a big connected moduli…
Graph theory has provided a very useful tool, called topological indices which are a number obtained from the graph $G$ with the property that every graph $H$ isomorphic to $G$, value of a topological index must be same for both $G$ and…
A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…
The definition of a holomorphic function over a general measurable space $S$ endowed with a Markov process is defined by Zeghib and Barre. In this article we consider holomorphic functions over graphs whose ranges are a given finite field…
Let M be a module over a commutative ring and let Spec(M) (resp. Max(M)) be the collection of all prime (resp. maximal) submodules of M. We topologize Spec(M) with Zariski topology, which is analogous to that for Spec(R), and consider…
We organize a table of regular graphs with minimal diameters and minimal mean path lengths, large bisection widths and high degrees of symmetries, obtained by enumerations on supercomputers. These optimal graphs, many of which are newly…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…
The cohomology theory known as Tmf, for "topological modular forms," is a universal object mapping out to elliptic cohomology theories, and its coefficient ring is closely connected to the classical ring of modular forms. We extend this to…
Let k be an algebraically closed field of characteristic p. Let X(p^e;N) be the curve parameterizing elliptic curves with full level N structure (where p does not divide N) and full level p^e Igusa structure. By modular curve, we mean a…
We study when the mapping class group of an infinite-type surface $S$ admits an action with unbounded orbits on a connected graph whose vertices are simple closed curves on $S$. We introduce a topological invariant for infinite-type…
Several types of graphs with different conditional independence interpretations --- also known as Markov properties --- have been proposed and used in graphical models. In this paper we unify these Markov properties by introducing a class…
For $k \geqslant 0$, we define a simple topological graph $G$ (that is, a graph drawn in the plane such that every pair of edges intersect at most once, including endpoints) to be $k$-matching-planar if for every edge $e \in E(G)$, every…
A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…
Consider a finite connected graph denoted as $G=(V, E)$. This study explores a generalized Chern-Simons Higgs model, characterized by the equation: $$ \Delta u = \lambda e^u (e^u - 1)^{2p+1} + f,$$ where $\Delta$ denotes the graph…
We present a graph theory-based method to characterise flow defects and structural shifts in condensed matter. We explore the connection between dynamical properties, particularly the recently introduced concept of ''softness'', and…