Related papers: An algorithm to calculate generalized Seifert matr…
Representing patterns as labeled graphs is becoming increasingly common in the broad field of computational intelligence. Accordingly, a wide repertoire of pattern recognition tools, such as classifiers and knowledge discovery procedures,…
A recursive algebraic method which allows to obtain the Feynman or Schwinger parametric representation of a generic L-loops and (E+1) external lines diagram, in a scalar $\phi ^{3}\oplus \phi ^{4}$ theory, is presented. The representation…
A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…
Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…
We consider the problem of factorizing a structured 3-way tensor into its constituent Canonical Polyadic (CP) factors. This decomposition, which can be viewed as a generalization of singular value decomposition (SVD) for tensors, reveals…
Several classical knot invariants, such as the Alexander polynomial, the Levine-Tristram signature and the Blanchfield pairing, admit natural extensions from knots to links, and more generally, from oriented links to so-called colored…
A virtual knot that has a homologically trivial representative $\mathscr{K}$ in a thickened surface $\Sigma \times [0,1]$ is said to be an almost classical (AC) knot. $\mathscr{K}$ then bounds a Seifert surface $F\subset \Sigma \times…
Cadabra is an open access program ideally suited to complex tensor commutations in General Relativity. Tensor expressions are written in LaTeX while an enhanced version of Python is used to control the computations. This tutorial assumes no…
We introduce new types of local algorithms, which we call "ASI Algorithms", and use them to demonstrate a link between descriptive and computable combinatorics. This allows us to unify arguments from the two fields, and also sometimes to…
In this paper, we generalize Spencer's hyperbolic cosine algorithm to the matrix-valued setting. We apply the proposed algorithm to several problems by analyzing its computational efficiency under two special cases of matrices; one in which…
Tensor calculation of suffix-contraction is carried out by a C-program. Tensors are represented graphically, and the algorithm makes use of the topology of graphs. Classical and quantum gravity, in the weak-field perturbative approach, is a…
Let $X$ be a finite set and let $\mathsf{Mat}_X(\mathbb{C})$ denote the algebra of matrices with rows and columns indexed by $X$ and entries from the complex numbers acting on $\mathbb{C}^X$ with standard basis $\{ \hat{x} \mid x\in X\}$.…
We focus on the algorithm underlying the main result of [A. Mestre, R. Oeckl, Generating loop graphs via Hopf algebra in quantum field theory. J. Math. Phys., 47, 122302, 2006]. This is an algebraic formula to generate all connected graphs…
Remarkable progress inspired by twistors has lead to very simple analytic expressions and to new recursive relations for multi-parton color-ordered amplitudes. We show how such relations can be extended to include color and present the…
Multi-attributed graph matching is a problem of finding correspondences between two sets of data while considering their complex properties described in multiple attributes. However, the information of multiple attributes is likely to be…
In this paper we compute the Reduced Fox Coloring Group of the diagrams of Wheel Graphs which can also be represented at the closure of the braids $(\sigma_1 \sigma_2^{-1})^n$. In doing so, we utilize Fibonacci numbers and their properties.…
Here, we show a method to reconstruct connectivity hypermatrices of a general hypergraph (without any self loop or multiple edge) using tensor. We also study the different spectral properties of these hypermatrices and find that these…
Tensor network methods are taking a central role in modern quantum physics and beyond. They can provide an efficient approximation to certain classes of quantum states, and the associated graphical language makes it easy to describe and…
We construct a quantum algorithm to approximate efficiently the colored Jones polynomial of the plat presentation of any oriented link L at a fixed root of unity q. Our construction is based on SU(2) Chern-Simons topological quantum field…
It is classical that given any Seifert structure on N, Reidemeister-Schreier's algorithm produces a presentation of all index 2 subgroups of the fundamental group of N, described as the fundamental group of some Seifert manifolds. The new…