Related papers: Approximating stable translation lengths on fine c…
Given a graph $F$, the expansion $F^{(r)}$ of $F$ is defined as the $r$-uniform hypergraph obtained from $F$ by adding a set of $(r-2)$ distinct new vertices to each edge of $F$. In this paper, we investigate spectral stability results for…
The natural automorphism group of a translation surface is its group of translations. For finite translation surfaces of genus g > 1 the order of this group is naturally bounded in terms of g due to a Riemann-Hurwitz formula argument. In…
In this paper, we study Homeo$^1(S)$, the group of homeomorphisms of a surface that preserve the set of one-dimensional $C^1$ submanifolds of that surface. The group Homeo$^1(S)$ belongs to a family of similarly defined groups Homeo$^k(S)$…
In this paper we study the following problem. Let $A$ be a fixed graph, and let $\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\mathcal{G}_d$…
Let $M$ be a hyperbolic fibered 3-manifold. We study properties of sequences $(S_{\alpha_n}, \psi_{\alpha_n})$ of fibers and monodromies for primitive integral classes in the fibered cone of $M$. The main tool is the asymptotic translation…
We present a method which provides a unified framework for most stability theorems that have been proved in graph and hypergraph theory. Our main result reduces stability for a large class of hypergraph problems to the simpler question of…
We prove analogues of classical results for higher homotopy groups and singular homology groups of pseudotopological spaces. Pseudotopological spaces are a generalization of (\v{C}ech) closure spaces which are in turn a generalization of…
Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including…
In this paper, we construct cw-expansive homeomorphisms on compact surfaces of genus greater than or equal to zero with a fixed point whose local stable set is connected but not locally connected. This provides an affirmative answer to…
Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of planar graphs, very little is known about the existence of…
We study the stable pairs theory of local curves in 3-folds with descendent insertions. The rationality of the partition function of descendent invariants is established for the full local curve geometry (equivariant with respect to the…
In this paper, we give a complete topological and smooth classification of non-invertible Anosov maps on torus. We show that two non-invertible Anosov maps on torus are topologically conjugate if and only if their corresponding periodic…
A dynamical system of points moving along the edges of a graph could be considered as a geometrical discrete dynamical system or as a discrete version of a quantum graph with localized wave packets. We study the set of such systems over…
For graphs $G$ and $H$, a {\em homomorphism} from $G$ to $H$, or {\em $H$-coloring} of $G$, is an adjacency preserving map from the vertex set of $G$ to the vertex set of $H$. Writing ${\rm hom}(G,H)$ for the number of $H$-colorings…
We define a new finite type invariant for stably homeomorphic class of curves on compact oriented surfaces without boundaries and extend to a regular homotopy invariant for spherical curves.
In this paper we describe the tangent vectors of the stable and unstable manifold of a class of Anosov diffeomorphisms on the torus $\mathbb{T}^2$ using the method of formal series and derivative trees. We start with linear automorphism…
It is confirmed in this work that the graph isomorphism can be tested in polynomial time, which resolves a longstanding problem in the theory of computation. The contributions are in three phases as follows. 1. A description graph…
We introduce a crossed module of piecewise linear surfaces and study the signature homomorphism, defined as the surface holonomy of a universal translation invariant $2$-connection. This provides a transform whereby surfaces are represented…
Graph-level representations are crucial tools for characterising structural differences between graphs. However, comparing graphs with different cardinalities, even when sampled from the same underlying distribution, remains challenging.…
Graphs are fundamental tools for modeling pairwise interactions in complex systems. However, many real-world systems involve multi-way interactions that cannot be fully captured by standard graphs. Hypergraphs, which generalize graphs by…