Related papers: The arithmetic complexity of tensor contractions
Let U be the quantised enveloping algebra associated to a Cartan matrix of finite type. Let W be the tensor product of a finite list of highest weight representations of U. Then the centraliser algebra of W has a basis called the dual…
A tensor is a multidimensional array of numbers that can be used to store data, encode a computational relation and represent quantum entanglement. In this sense a tensor can be viewed as valuable resource whose transformation can lead to…
Given a commutative noetherian ring $R$ and a finite acyclic quiver $Q$, we study the tensor triangulated category $\mathcal{D}(RQ)$ endowed with the vertexwise tensor product. We find a description of the internal hom functor and show that…
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
By an {\em isotropy group} of a tensor $t\in V_1 \otimes V_2\otimes V_3=\widetilde V$ we mean the group of all invertible linear transformations of $\widetilde V$ that leave $t$ invariant and are compatible (in an obvious sense) with the…
We derive a formula for the the modular class of a Lie algebroid with a regular twisted Poisson structure in terms of a canonical Lie algebroid representation of the image of the Poisson map. We use this formula to compute the modular…
We study a vertex operator algebra containing a tensor product of Ising models. It is a direct sum of code vertex operator algebra and its irreducible modules. Therefore, we classify all irreducible modules of code vertex operator algebras…
Accurate contraction of tensor networks beyond one dimension is essential in various fields including quantum many-body physics. Existing approaches typically rely on approximate contraction schemes and do not provide certified error bars.…
Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…
Though algebraic geometry over $\mathbb C$ is often used to describe the closure of the tensors of a given size and complex rank, this variety includes tensors of both smaller and larger rank. Here we focus on the $n\times n\times n$…
Although Shapley additive explanations (SHAP) can be computed in polynomial time for simple models like decision trees, they unfortunately become NP-hard to compute for more expressive black-box models like neural networks - where…
We study the decomposition of the Coulomb integrals of periodic systems into a tensor contraction of six matrices of which only two are distinct. We find that the Coulomb integrals can be well approximated in this form already with small…
Natural linear and coalgebra transformations of tensor algebras are studied. The representations of certain combinatorial groups are given. These representations are connected to natural transformations of tensor algebras and to the groups…
Computing derivatives of tensor expressions, also known as tensor calculus, is a fundamental task in machine learning. A key concern is the efficiency of evaluating the expressions and their derivatives that hinges on the representation of…
We first study birational mappings generated by the composition of the matrix inversion and of a permutation of the entries of $ 3 \times 3 $ matrices. We introduce a semi-numerical analysis which enables to compute the Arnold complexities…
Matrix permanents arise naturally in the context of linear optical networks fed with nonclassical states of light. In this letter we tie the computational complexity of a class of multi-dimensional integrals to the permanents of large…
This is the third part in a series of papers developing a tensor product theory for modules for a vertex operator algebra. The goal of this theory is to construct a ``vertex tensor category'' structure on the category of modules for a…
An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circuits can also be viewed as the elements of the smallest…
In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…
A graded tensor category over a group $G$ will be called a crossed product tensor category if every homogeneous component has at least one multiplicatively invertible object. Our main result is a description of the crossed product tensor…