Related papers: The isotropy group of the matrix multiplication te…
We introduce a notion of $n$-commutativity ($0\le n\le \infty$) for cosimplicial monoids in a symmetric monoidal category ${\bf V}$, where $n=0$ corresponds to just cosimplicial monoids in ${\bf V,}$ while $n=\infty$ corresponds to…
We propose a new tensor renormalization group algorithm, Anisotropic Tensor Renormalization Group (ATRG), for lattice models in arbitrary dimensions. The proposed method shares the same versatility with the Higher-Order Tensor…
One of prospective ways to find new fast algorithms of matrix multiplication is to study algorithms admitting nontrivial symmetries. In the work possible algorithms for multiplication of $3\times3$ matrices, admitting a certain group $G$…
The tensor-tensor product (t-product) [M. E. Kilmer and C. D. Martin, 2011] is a natural generalization of matrix multiplication. Based on t-product, many operations on matrix can be extended to tensor cases, including tensor SVD, tensor…
Matrix-vector multiplication is one of the most fundamental computing primitives. Given a matrix $A\in\mathbb{F}^{N\times N}$ and a vector $b$, it is known that in the worst case $\Theta(N^2)$ operations over $\mathbb{F}$ are needed to…
In this paper we have considered a finite unitary matrix group with exact elements being unknown and only approximate elements available. Such a group becomes inconsistent with its own multiplication table. We found simple correction…
A method of fast linear transform algorithm synthesis for an arbitrary tensor, matrix, or vector is proposed. The method is based on factorization of a tensor and using the factors for building computational structures performing fast…
Algebraic matrix multiplication algorithms are designed by bounding the rank of matrix multiplication tensors, and then using a recursive method. However, designing algorithms in this way quickly leads to large constant factors: if one…
Studying algorithms admitting nontrivial symmetries is a prospective way of constructing new short algorithms of matrix multiplication. The main result of the article is that if there exists an algorithm of multiplicative length $l\leq22$…
In 2005 J.L. Waldspurger proved the following theorem: given a finite real reflection group $W$, the closed positive root cone is tiled by the images of the open weight cone under the action of the linear transformations $id-w$. Shortly…
Let G be a group and V a finite dimensional representation of G over an algebraically closed field k of characteristic p>0. Let $d_n(V)$ be the number of indecomposable summands of $V^{\otimes n}$ of nonzero dimension mod p. It is easy to…
Given a root system $\mathsf{R}$, the vector system $\tilde{\mathsf{R}}$ is obtained by taking a representative $v$ in each antipodal pair $\{v, -v\}$. The matroid $M(\mathsf{R})$ is formed by all independent subsets of…
Observables in random tensor theory are polynomials in the entries of a tensor of rank $d$ which are invariant under $U(N)^d$. It is notoriously difficult to evaluate the expectations of such polynomials, even in the Gaussian distribution.…
The aim of this paper is to study the group of isomorphism classes of torsors of finite flat group schemes of rank 2 over a commutative ring $R$. This, in particular, generalises the group of quadratic algebras (free or projective), which…
Tensor network decompositions offer an efficient description of certain many-body states of a lattice system and are the basis of a wealth of numerical simulation algorithms. We discuss how to incorporate a global symmetry, given by a…
Let G be a semisimple, simply-connected algebraic group over an algebraically closed field of characteristic p > 0. We observe that the tensor product of the Steinberg module with a minuscule module is always indecomposable tilting.…
We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There are two components to this approach: (1) identifying groups G that admit a certain type of embedding of matrix multiplication into the group…
The concept of symmetry breaking has been a propelling force in understanding phases of matter. While rotational symmetry breaking is one of the most prevalent examples, the rich landscape of orientational orders breaking the rotational…
The group algebra of the permutation group is spanned by a set of elements called projectors. The coordinates of permutations expanded in projectors are matrix elements of irreducible representations. The projectors of the permutation group…
Since the seminal works of Strassen and Valiant it has been a central theme in algebraic complexity theory to understand the relative complexity of algebraic problems, that is, to understand which algebraic problems (be it bilinear maps…