Related papers: Geometric Structure and Ergodic Properties of Bony…
A finite set can be supplied with a group structure which can then be used to select (classes of) differential calculi on it via the notions of left-, right- and bicovariance. A corresponding framework has been developed by Woronowicz, more…
We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite…
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…
A graph $G$ is $k$-edge geodetic graph if every edge of $G$ lies in at least one geodesic of length $k$. We studied some basic properties of $k$-edge geodetic graphs. We investigated the $k$ edge-geodeticity of complete bipartite graph…
We show the existence of Lebesgue-equivalent conservative and ergodic $\sigma$-finite invariant measures for a wide class of one-dimensional random maps consisting of piecewise convex maps. We also estimate the size of invariant measures…
We consider skew product dynamical systems $f:\Theta\times\mathbb{R}\to\Theta\times\mathbb{R}, f(\theta,y)=(T\theta,f_\theta(y))$ with a (generalized) baker transformation $T$ at the base and uniformly bounded increasing $C^3$ fibre maps…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
We analyse the geometric instability of embeddings produced by graph neural networks (GNNs). Existing methods are only applicable for small graphs and lack context in the graph domain. We propose a simple, efficient and graph-native Graph…
Let $G$ be a group. The directed endomorphism graph, \dend of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex `$a$' to the vertex `$\, b$' $(a \neq b) $ if and only if there exists an endomorphism on…
A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of almost embeddings: winding number, cyclic and triodic Wu…
We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…
Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
In two-dimensional materials electronic band contacts often give non-trivial contribution to materials topological properties. Besides band contacts at high-symmetry points (HSP) in the Brillouin zone (BZ), like those in graphene, there are…
We study fractal properties of invariant graphs of hyperbolic and partially hyperbolic skew product diffeomorphisms in dimension three. We describe the critical (either Lipschitz or at all scales H\"older continuous) regularity of such…
In this paper, we introduce a method called graph fusion embedding, designed for multi-graph embedding with shared vertex sets. Under the framework of supervised learning, our method exhibits a remarkable and highly desirable synergistic…
We introduce a generalization of structured manifolds as the most general Riemannian metric g associated to an affinor (tensor field of (1,1)-type) F and initiate a study of their semi-invariant submanifolds. These submanifolds are…
We study the problem of persistence of attractors with smooth boundary for a class of set-valued dynamical systems that naturally arise in the context of random and control dynamical systems, as well as in systems modeling the dynamical…
We present a robust method to find region-level correspondences between shapes, which are invariant to changes in geometry and applicable across multiple shape representations. We generate simplified shape graphs by jointly decomposing the…
Multisymplectic geometry admits an operation that has no counterpart in symplectic geometry, namely, taking the product of two multisymplectic manifolds endowed with the wedge product of the multisymplectic forms. We show that there is an…