Related papers: Algebraic invariants of graphs; a study based on c…
This is an improved version of the talk of the author given at the Antalya Algebra Days VII on May 21, 2005. We present an introduction to the theory of the invariants under the action of GL(n,C) by simultaneous conjugation of d matrices of…
We define invariants of words in arbitrary groups, measuring how letters in a word are interleaving, perfectly detecting the dimension series of a group. These are the letter-braiding invariants. On free groups, braiding invariants coincide…
We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…
It is possible to construct distinct polyfolds which model a given moduli space problem in subtly different ways. These distinct polyfolds yield invariants which, a priori, we cannot assume are equivalent. We provide a general framework for…
The present work develops certain analytical tools required to construct and compute invariant kernels on the space of complex covariance matrices. The main result is the $\mathrm{L}^1$--Godement theorem, which states that any invariant…
In order to study certain algebraic objects, and notably algebraic groups, Serre introduced the notion on invariants, in particular cohomological invariants. The construction of non-trivial cohomological invariants of algebraic groups is an…
For every finite simple connected graph $G = (V,E)$, we introduce an invariant, its blowup-polynomial $p_G(\{ n_v : v \in V \})$. This is obtained by dividing the determinant of the distance matrix of its blowup graph $G[{\bf n}]$…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…
Given a graph G, an incidence matrix N(G) is defined for the set of distinct isomorphism types of induced subgraphs of G. If Ulam's conjecture is true, then every graph invariant must be reconstructible from this matrix, even when the…
Let $G$ be a finite simple graph and let $I_G$ denote its associated toric ideal in the polynomial ring $R$. For each integer $n\geq 2$, we completely determine all the possible values for the tuple $({\rm reg}(R/I_G), {\rm…
Graph Isomorphism is such an important problem in computer science, that it has been widely studied over the last decades. It is well known that it belongs to NP class, but is not NP-complete. It is thought to be of comparable difficulty to…
Loop invariants are properties of a program loop that hold both before and after each iteration of the loop. They are often used to verify programs and ensure that algorithms consistently produce correct results during execution.…
Let $K$ be an algebraically closed field of characteristic zero. Algebraic structures of a specific type (e.g. algebras or coalgebras) on a given vector space $W$ over $K$ can be encoded as points in an affine space $U(W)$. This space is…
We reconfigure the Milnor invariant of links in terms of central group extensions and unipotent Magnus embeddings. We also develop a diagrammatic computation of the invariant and compute the first non-vanishing invariants of the Milnor link…
In this paper we consider self-dual NRT-codes, that is, self-dual codes in the metric space endowed with the Niederreiter-Rosenbloom-Tsfasman (NRT-metric). We use polynomial invariant theory to describe the shape enumerator of a binary…
This paper studies the form and complexity of inference in graphical models using the abstraction offered by algebraic structures. In particular, we broadly formalize inference problems in graphical models by viewing them as a sequence of…
We introduce new polynomial invariants of a finite-dimensional semisimple and cosemisimple Hopf algebra A over a field by using the braiding structures of A. We investigate basic properties of the polynomial invariants including stability…
We give a procedure that can be used to automatically satisfy invariants of a certain shape. These invariants may be written with the operations intersection, composition and converse over binary relations, and equality over these…
We define ruling invariants for even-valence Legendrian graphs in standard contact three-space. We prove that rulings exist if and only if the DGA of the graph, introduced by the first two authors, has an augmentation. We set up the usual…
An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial…