相关论文: The isotropy group of the matrix multiplication te…
We study the category of wheeled PROPs using tools from Invariant Theory. A typical example of a wheeled PROP is the mixed tensor algebra ${\mathcal V}=T(V)\otimes T(V^\star)$, where $T(V)$ is the tensor algebra on an $n$-dimensional vector…
Moment polytopes of tensors, the study of which is deeply rooted in invariant theory, representation theory and symplectic geometry, have found relevance in numerous places, from quantum information (entanglement polytopes) and algebraic…
In a previous paper, the author and his collaborators studied the phenomenon of isotropy in the context of single-sorted equational theories, and showed that the isotropy group of the category of models of any such theory encodes a notion…
We introduce a combinatorial property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a canonical finite presentation. We also define…
We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix multiplication, Numer. Math. 36 (1980), 63--72]. As a…
We present a new algorithm for fast matrix multiplication using tensor decompositions which have special features. Thanks to these features we obtain exponents lower than what the rank of the tensor decomposition suggests. In particular for…
We consider an infinitesimal volume where there are many rigid molecules of the same kind, and discuss the description and classification of the local anisotropy in this volume by tensors. First, we examine the symmetry of a rigid molecule,…
We consider compact matrix quantum groups whose $N$-dimensional fundamental representation decomposes into an $(N-1)$-dimensional and a one-dimensional subrepresentation. Even if we know that the compact matrix quantum group associated to…
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix…
We study the multiplication operation of square matrices over lattices. If the underlying lattice is distributive, then matrices form a semigroup; we investigate idempotent and nilpotent elements and the maximal subgroups of this matrix…
Many isomorphism problems for tensors, groups, algebras, and polynomials were recently shown to be equivalent to one another under polynomial-time reductions, prompting the introduction of the complexity class TI (Grochow & Qiao, ITCS '21;…
Let V be a vertex operator algebra, and for k a positive integer, let g be a k-cycle permutation of the vertex operator algebra V^{\otimes k}. We prove that the categories of weak, weak admissible and ordinary g-twisted modules for the…
In this paper, the canonical polyadic (CP) decomposition of tensors that corresponds to matrix multiplications is studied. Finding the rank of these tensors and computing the decompositions is a fundamental problem of algebraic complexity…
The necessary and sufficient conditions for a spacetime with an invariant frame to admit a group of isometries of dimension $r$ are given in terms of the connection tensor $H$ associated with this frame. In Petrov-Bel types I, II and III,…
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…
The learnable, linear neural network layers between tensor power spaces of $\mathbb{R}^{n}$ that are equivariant to the orthogonal group, $O(n)$, the special orthogonal group, $SO(n)$, and the symplectic group, $Sp(n)$, were characterised…
Let V be a simple vertex operator algebra satisfying the following conditions: (i) The homogeneous subspaces of V of weights less than 0 are 0, the homogeneous subspace of V of weight 0 is spanned by the vacuum and V' is isomorphic to V as…
Fast matrix multiplication can be described as searching for low-rank decompositions of the matrix--multiplication tensor. We design a neural architecture, \textsc{StrassenNet}, which reproduces the Strassen algorithm for $2\times 2$…
We consider the famous Strassen algorithm for fast multiplication of matrices. We show that this algorithm has a nontrivial finite group of automorphisms of order 36 (namely the direct product of two copies of the symmetric group on 3…
Matrix models with continuous symmetry are powerful tools for studying quantum gravity and holography. Tensor models have also found applications in holographic quantum gravity. Matrix models with discrete permutation symmetry have been…