Related papers: A Generalisation of Isomorphisms with Applications
It is proved that isomorphisms between algebras of smooth functions on Hausdorff smooth manifolds are implemented by diffeomorphisms. It is not required that manifolds are second countable nor paracompact. This solves a problem stated by A.…
We study the automorphisms of a Cayley graph that preserve its natural edge-colouring. More precisely, we are interested in groups G, such that every such automorphism of every connected Cayley graph on G has a very simple form: the…
This paper looks at the task of network topology inference, where the goal is to learn an unknown graph from nodal observations. One of the novelties of the approach put forth is the consideration of prior information about the density of…
The graph isomorphism (GI) problem is the computational problem of finding a permutation of vertices of a given graph $G_1$ that transforms $G_1$ to another given graph $G_2$ and preserves the adjacency. In this work, we propose a quantum…
We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological…
In the Graph Isomorphism problem two N-vertex graphs G and G' are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G into G'. If yes, then G and G' are said…
An isomorphism between two graphs is a bijection between their vertices that preserves the edges. We consider the problem of determining whether two finite undirected weighted graphs are isomorphic, and finding an isomorphism relating them…
The study of cosmological perturbation theory in $f(T)$ gravity is a topic of great interest in teleparallel gravity since this is one of the simplest generalizations of the theory that modifies the teleparallel equivalent of general…
The isomorphism problem is known to be efficiently solvable for interval graphs, while for the larger class of circular-arc graphs its complexity status stays open. We consider the intermediate class of intersection graphs for families of…
Let $\mathbb{F}_q$ be a finite field. Given two irreducible polynomials $f,g$ over $\mathbb{F}_q$, with $\mathrm{deg} f$ dividing $\mathrm{deg} g$, the finite field embedding problem asks to compute an explicit description of a field…
We present norm criteria for the existence of anti-automorphisms, as well as explicit constructions of anti-automorphisms, both on cyclic and generalized cyclic algebras. Our approach describes anti-automorphisms as polynomial maps and…
By recourse to tempered ultradistributions, we show here that the effect of a q-Fourier transform (qFT) is to map {\it equivalence classes} of functions into other classes in a one-to-one fashion. This suggests that Tsallis' q-statistics…
Graphs constructed to translate some graph problem into another graph problem are usually called auxiliary graphs. Specifically total graphs of simple graphs are used to translate the total colouring problem of the original graph into a…
We address the following problem: given two smooth densities on a manifold, find an optimal diffeomorphism that transforms one density into the other. Our framework builds on connections between the Fisher-Rao information metric on the…
We solve a problem posed by Cardinali and Sastry [2] about factorization of $2$-covers of finite classical generalized quadrangles. To that end, we develop a general theory of cover factorization for generalized quadrangles, and in…
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…
We study renormalizations of piecewise smooth homeomorphisms on the circle, by considering such maps as generalized interval exchange maps of genus one. Suppose that $Df$ is absolutely continuous on each interval of continuity and…
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…
In Symmetric Teleparallel General Relativity, gravity is attributed to the non-metricity. The so-called "coincident gauge" is usually taken in this theory so that the affine connection vanishes and the metric is the only fundamental…
We consider the set of partition functions that result from the insertion of twist operators compatible with conformal invariance in a given 2D Conformal Field Theory (CFT). A consistency equation, which gives a classification of twists, is…