This thesis introduces a novel way of writing polynomial invariants as network graphs, and applies this diagrammatic notation scheme, in conjunction with graph theory, to derive algorithms for constructing relationships (syzygies) between different invariants. These algorithms give rise to a constructive solution of a longstanding classical problem in invariant theory
We report on the systematic listing of polynomial relations among the algebraic invariants of a Riem...
A topological index of graph G is a numerical parameter related to G, which characterizes its topolo...
The invariant polynomials of discrete systems such as graphs, matroids, hyperplane arrangements, and...
Invariants for complicated objects such as those arising in phylogenetics, whether they are invarian...
AbstractThis paper presents a simple graphical method, closely related to the “algebrochemical metho...
In this paper, we shall consider all pure Ricci and pure Weyl scalar invariants of any degree, in a ...
This report documents the programme and outcomes of Dagstuhl Seminar 19401 ``Comparative Theory for ...
AbstractThe method of invariants is an important approach in biology for determining phylogenetic in...
summary:We describe a correspondence between $\mbox {GL}_n$-invariant tensors and graphs. We then sh...
AbstractWe introduce a graph diagram which can be regarded as a generalized link diagram. By using i...
ABSTRACT Let G be a graph and let 1,,) ( jiGijm, be the number of edges uv of G such that},{)}(,)( {...
AbstractMany polynomials have been defined associated to graphs, like the characteristic, matchings,...
A topological index is a number that is connected to a chemical composition in order to correlate a ...
Abstract. We describe a correspondence between GLn-invariant tensors and graphs. We then show how th...
In this paper we introduce, and characterize, a class of graph parameters obtained from tensor invar...
We report on the systematic listing of polynomial relations among the algebraic invariants of a Riem...
A topological index of graph G is a numerical parameter related to G, which characterizes its topolo...
The invariant polynomials of discrete systems such as graphs, matroids, hyperplane arrangements, and...
Invariants for complicated objects such as those arising in phylogenetics, whether they are invarian...
AbstractThis paper presents a simple graphical method, closely related to the “algebrochemical metho...
In this paper, we shall consider all pure Ricci and pure Weyl scalar invariants of any degree, in a ...
This report documents the programme and outcomes of Dagstuhl Seminar 19401 ``Comparative Theory for ...
AbstractThe method of invariants is an important approach in biology for determining phylogenetic in...
summary:We describe a correspondence between $\mbox {GL}_n$-invariant tensors and graphs. We then sh...
AbstractWe introduce a graph diagram which can be regarded as a generalized link diagram. By using i...
ABSTRACT Let G be a graph and let 1,,) ( jiGijm, be the number of edges uv of G such that},{)}(,)( {...
AbstractMany polynomials have been defined associated to graphs, like the characteristic, matchings,...
A topological index is a number that is connected to a chemical composition in order to correlate a ...
Abstract. We describe a correspondence between GLn-invariant tensors and graphs. We then show how th...
In this paper we introduce, and characterize, a class of graph parameters obtained from tensor invar...
We report on the systematic listing of polynomial relations among the algebraic invariants of a Riem...
A topological index of graph G is a numerical parameter related to G, which characterizes its topolo...
The invariant polynomials of discrete systems such as graphs, matroids, hyperplane arrangements, and...