Related papers: Invariant tensors and graphs

Let K be the product O(n_1) x O(n_2) x ... x O(n_r) of orthogonal groups. Let V the r-fold tensor product of defining representations of each orthogonal factor. We compute a stable formula for the dimension of the K-invariant algebra of…

We describe recent achievements in the theory of weight systems, which are functions on chord diagrams satisfying so-called $4$-term relations. Our main attention is devoted to constructions of weight systems. The two main sources of these…

Here, we suggest a method to represent general directed uniform and non-uniform hypergraphs by different connectivity tensors. We show many results on spectral properties of undirected hypergraphs also hold for general directed uniform…

We use planar 4-valent graphs and a graphical calculus involving such graphs to construct an invariant for balanced-oriented, knotted 4-valent graphs. Our invariant is an extension of the $sl(n)$ polynomial for classical knots and links. We…

We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…

We study invariant operators in general tensor models. We show that representation theory provides an efficient framework to count and classify invariants in tensor models. In continuation and completion of our earlier work, we present two…

We introduce topological invariants of knots and braid conjugacy classes, in the form of differential graded algebras, and present an explicit combinatorial formulation for these invariants. The algebras conjecturally give the relative…

Directed graphs are widely used in modelling of nonsymmetric relations in various sciences and engineering disciplines. We discuss invariants of strongly connected directed graphs - minimal number of vertices or edges necessary to remove to…

We give a survey on higher invariants in noncommutative geometry and their applications to differential geometry and topology.

We describe proper correspondences from graph C*-algebras to arbitrary C*-algebras by K-theoretic data. If the target C*-algebra is a graph C*-algebra as well, we may lift an isomorphism on a certain invariant to correspondences back and…

In this paper we completely characterize the graphs which have an edge weighted adjacency matrix belonging to the class of $n \times n$ involutions with spectrum equal to $\{ \lambda_1^{n-2}, \lambda_2^{2} \}$ for some $\lambda_1$ and some…

We study tensor network varieties associated with the triangular graph, with a focus on the case where one of the physical dimensions is 2. This allows us to interpret the tensors as pencils of matrices. We provide a complete…

A linear group G<GL(n) acts on d-tuples of n x n matrices by simultaneous conjugation. In [Adv. Math. 19 (1976), 306-381] Procesi established generators and relations between them for G-invariants, where G is GL(n), O(n), and Sp(n) and the…

In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…

The fundamental representations of the special linear group ${\rm SL}_n$ over the complex numbers are the exterior powers of $\mathbb{C}^n$. We consider the invariant rings of sums of arbitrary many copies of these ${\rm SL}_n$-modules. The…

Let V be a finite-dimensional superspace and G a simple (or a ``close'' to simple) matrix Lie superalgebra, i.e., a Lie subsuperalgebra in GL(V). Under the classical invariant theory for G we mean the description of G-invariant elements of…

Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting…

The $\Upsilon$ invariant is a concordance invariant defined by using knot Floer homology. F\"{o}ldv\'{a}ri gives a combinatorial restructure of it using grid homology. We extend the combinatorial $\Upsilon$ invariant for balanced spatial…

In the present paper we construct a one-to-one correspondence between the set of graph-knots and the set of homotopy classes of looped graphs. Moreover, the graph-knot and the homotopy class constructed from a given knot are related with…

In this paper we describe the algebra of differential invariants for GL(n,C)-structures. This leads to classification of almost complex structures of general positions. The invariants are applied to the existence problem of…