Related papers: A Generalisation of Isomorphisms with Applications
Evolution algebras are non-associative algebras inspired from biological phenomena, with applications to or connections with different mathematical fields. There are two natural ways to define an evolution algebra associated to a given…
We consider principal bundles as generalized morphisms between topological groupoids. In the category of these generalized morphisms two topological groupoids are isomorphic if and only if they are Morita equivalent. We show that the fibers…
In this paper we develop three characterizations for isomorphism of graphs. The first characterization is obtained by associating certain bitableaux with the graphs. We order these bitableaux by suitably defined lexicographic order and…
We implement the method developed in [1] to construct the most general parametrised action for linear cosmological perturbations of bimetric theories of gravity. Specifically, we consider perturbations around a homogeneous and isotropic…
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small tree-width, and applying dynamic…
Temporal information is increasingly available as part of large network data sets. This information reveals sequences of link activations between network entities, which can expose underlying processes in the data. Examples include the…
We extend the concept of graph isomorphisms to multilayer networks with any number of "aspects" (i.e., types of layering). In developing this generalization, we identify multiple types of isomorphisms. For example, in multilayer networks…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
In this article, we study the isomorphism problem for the algebras of $\Phi-$Pseudofunctions and $\Phi-$Pseudomeasures, denoted by $PF_\Phi(G)$ and $PM_\Phi(G),$ respectively. More precisely, for a certain class of Young functions $\Phi,$…
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given `far away' observations. Several theoretical results (and simple algorithms) are available when…
This work introduces topological regularization as a framework for handling ultraviolet divergences in quantum field theory, reinterpreting infinities as topological obstructions at spacetime boundaries. Through geometric compactification…
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…
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…
Homomorphism indistinguishability is a way of characterising many natural equivalence relations on graphs. Two graphs $G$ and $H$ are called homomorphism indistinguishable over a graph class $\mathcal{F}$ if for each $F \in \mathcal{F}$,…
Some sorts of generalized morphisms are defined from very basic mathematical objects such as sets, functions, and partial functions. A wide range of mathematical notions such as continuous functions between topological spaces, ring…
We consider a class $G(S^n)$ of orientation preserving Morse-Smale diffeomorphisms of the sphere $S^{n}$ of dimension $n>3$ in assumption that invariant manifolds of different saddle periodic points have no intersection. We put in a…
A graph $G$ is \emph{unstable} if its canonical double cover CDC$(G)$ has more automorphisms than Aut$(G)\times \mathbb{Z}_2$. A related problem asks when two non-isomorphic graphs share the same CDC. We unify both via \emph{lifting} and…
The graph isomorphism (GI) problem, which asks whether two graphs are structurally identical, occupies a unique position in computational complexity -- it is neither known to be solvable in polynomial time, nor proven to be NP-complete. We…
We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there are several ways for forbidding a graph, we observe that it is reasonable to focus on the minor relation since other well-known relations lead…
We prove two isomorphism-invariance theorems for groupoids associated with ultragraphs. These theorems characterize ultragraphs for which the topological full group of an associated groupoid is an isomorphism invariant. These results extend…