Related papers: On equivalence of vector-valued maps
A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely $n$ simplexes in $n-1$ dimensions - is applied to the graph equivalence problem. It is shown to solve this long standing…
Vectors fields defined on surfaces constitute relevant and useful representations but are rarely used. One reason might be that comparing vector fields across two surfaces of the same genus is not trivial: it requires to transport the…
Maps from links in thickened surfaces to flat-virtual links help to construct invariants of links using invariants of flat-virtual links. This work is dedicated to investigation of equivalence and invariants of flat-virtual diagrams…
The vector field problem is an important and classical problem in differential topology. In this survey we shall consider the vector field problem focusing mainly on the class of compact homogeneous spaces.
This paper deals with the comparison of two common types of equivalence groups of differential equations, and this gives rise to a number of results presented in the form of theorems. It is shown in particular that one type can be…
We determine the most general group of equivalence transformations for a family of differential equations defined by an arbitrary vector field on a manifold. We also find all invariants and differential invariants for this group up to the…
In this paper we focus on the map matching problem where the goal is to find a path through a planar graph such that the path through the vertices closely matches a given polygonal curve. The map matching problem is usually approached with…
The equivalence test is a main part in any classification problem. It helps to prove bounds for the main parameters of the considered combinatorial structures and to study their properties. In this paper, we present algorithms for…
The equivalence problem for linear differential operators of the second order, acting in vector bundles, is discussed. The field of rational invariants of symbols is described and connections, naturally accosiated with differential…
A proper coloring of vertices of a graph is equitable if the sizes of any two color classes differ by at most 1. Such colorings have many applications and are interesting by themselves. In this paper, we discuss the state of art and…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
Vertex similarity is a major problem in network science with a wide range of applications. In this work we provide novel perspectives on finding (dis)similar vertices within a network and across two networks with the same number of vertices…
Multivariance of geometry means that at the point $P_{0}$ there exist many vectors $P_{0}P_{1}$, $\P_{0}P_{2}$,... which are equivalent (equal) to the vector $\Q_{0}Q_{1}$ at the point $Q_{0}$, but they are not equivalent between…
We consider equivalence relations among smooth map germs with respect to geometry of G-structures on the target space germ. These equivalence relations are natural generalization of right-left equivalence (i.e., A-equivalence) in the sense…
We discuss sharp Sobolev inequalities for vector valued maps.
Let $\mathbb{F}$ be a field of characteristic different from $2$ and $3$, and let $V$ be a vector space of dimension $2$ over $\mathbb{F}$. The generic classification of homogeneous quadratic maps $f\colon V\to V$ under the action of the…
As neural networks (NNs) are increasingly introduced into safety-critical domains, there is a growing need to formally verify NNs before deployment. In this work we focus on the formal verification problem of NN equivalence which aims to…
Data are often represented as graphs. Many common tasks in data science are based on distances between entities. While some data science methodologies natively take graphs as their input, there are many more that take their input in…
The computation of short paths in graphs with arc lengths is a pillar of graph algorithmics and network science. In a more diverse world, however, not every short path is equally valuable. For the setting where each vertex is assigned to a…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…