Related papers: A complete invariant for doodles on a 2-sphere

We consider embeddings of maximal outerplanar graphs whose vertices all lie on a cycle $\mathcal{C}$ bounding a face. Each edge of the graph that is not in $\mathcal{C}$, a chord, is assigned a length equal to the length of the shortest…

We consider edge colorings of a graph in such a way that each two different triangles have distinct colorings. It is an extension of the well-known idea of distinguishing all maximal stars in a graph. It was introduced in literature in 1985…

"An invariant of metric spaces under bornologous equivalences" gives an invariant and "A coarse invariant" extends the invariant to coarse equivalences. In both papers the invariant is defined for a class of metric spaces called sigma…

In this paper, we characterize the monoid of endomorphisms of the semigroup of all monotone full transformations of a finite chain, as well as the monoids of endomorphisms of the semigroup of all monotone partial transformations and of the…

We introduce four invariants of algebraic varieties over imperfect fields, each of which measures either geometric non-normality or geometric non-reducedness. The first objective of this article is to establish fundamental properties of…

This paper determines the group of continuous invariants corresponding to an inner function $ \Theta $ with finitely many singularities on the unit circle $T$; that is, the continuous mappings $g: T \to T$ such that $\Theta \circ g = \Theta…

Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide…

We introduce shadow structures for singular knot theory. Precisely, we define \emph{two} invariants of singular knots and links. First, we introduce a notion of action of a singquandle on a set to define a shadow counting invariant of…

An essential goal in the study of finite type invariants of some objects (knots, manifolds) is the construction of a universal finite type invariant, universal in the sense that it contains all finite type invariants of the given objects.…

By studying periodic points for rational maps on $\bm{C}^d$ with $p$ invariants, we show that they form an invariant variety of dimension $p$ if the periodicity conditions are `fully correlated', and a set of isolated points if the…

It is expected that a totally invariant divisor of a non-isomorphic endomorphism of the complex projective space is a union of hyperplanes. In this paper, we compute an upper bound for the degree of such a divisor. As a consequence, we…

The number of holes in a connected component in 2D images is a basic invariant. In this note, a simple formula was proven using our previous results in digital topology (Chen 2004, Chen and Rong (2010). The new is: $h =1+ (|C_4|-|C_2|)/4$,…

We define two invariants for (semiprime right Goldie) algebras, one for algebras graded by arbitrary abelian groups, which is unchanged under twists by $2$-cocycles on the grading group, and one for $\mathbb Z$-graded or $\mathbb Z_{\ge…

We study perfect multiple coverings in translation invariant graphs with vertex set $\mathbb{Z}^2$ using an algebraic approach. In this approach we consider any such covering as a two-dimensional binary configuration which we then express…

We prove that every (possibly infinite) graph of degree at most $d$ has a 4-dependent random proper $4^{d(d+1)/2}$-coloring, and one can construct it as a finitary factor of iid. For unimodular transitive (or unimodular random) graphs we…

In this note we study and compare three graph invariants related to the 'compactness' of graph drawing in the plane: the dilation coefficient, defined as the smallest possible quotient between the longest and the shortest edge length; the…

Let G = (V, E) be a finite simple connected graph. We say a graph G realizes a code of the type 0^s_1 1^t_1 0^s_2 1^t_2 ... 0^s_k1^t_k if and only if G can obtained from the code by some rule. Some classes of graphs such as threshold and…

Carter, Jelsovsky, Kamada, Langford and Saito have defined an invariant of classical links associated to each element of the second cohomology of a finite quandle. We study these invariants for Alexander quandles of the form Z[t,t^{-1}]/(p,…

In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the…

Let X be a smooth complex variety and Y be a closed subvariety of X, or more generally, a closed subscheme of X. We are interested in invariants attached to the singularities of the pair (X, Y). We discuss various methods to construct such…