Related papers: A Frobenius-Schreier-Sims Algorithm to tensor deco…
Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to $n^{\lfloor p/2 \rfloor}$ for a $p$-th order tensor in…
Derived equivalences for Artin algebras (and almost $\nu$-stable derived equivalences for finite-dimensional algebras) are constructed from Milnor squares of algebras. Particularly, three operations of gluing vertices, unifying arrows and…
The purpose of this paper is to answer a question raised by Gennady Lyubeznik and Karen Smith. This question involves the finite generation of the following non-commutative algebra. Let $S$ be any commutative algebra of prime characteristic…
We investigate and review how Fourier transform is involved in the analysis of a twisted group algebra $L^1(G, \sigma)$ for $G=\widehat{\Gamma}\times \Gamma$ and $\sigma:G\times G \to \mathbb{T}$ 2- cocycle where $\Gamma$ is a locally…
We consider trace-zero subgroups of elliptic curves over a degree three field extension. The elements of these groups can be represented in compressed coordinates, i.e. via the two coefficients of the line that passes through the point and…
We give a new approach to the dictionary learning (also known as "sparse coding") problem of recovering an unknown $n\times m$ matrix $A$ (for $m \geq n$) from examples of the form \[ y = Ax + e, \] where $x$ is a random vector in $\mathbb…
We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…
We use graded Specht modules to calculate the graded decomposition numbers for the Iwahori-Hecke algebra of the symmetric group over a field of characteristic zero at a root of unity. The algorithm arrived at is the Lascoux-Leclerc-Thibon…
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…
We compute the Frobenius number for numerical semigroups generated by the squares of three consecutive Fibonacci numbers. We achieve this by using and comparing three distinct algorithmic approaches: those developed by Ram\'irez Alfons\'in…
Computational Group Theory is applied to indexed objects (tensors, spinors, and so on) with dummy indices. There are two groups to consider: one describes the intrinsic symmetries of the object and the other describes the interchange of…
We propose Riemannian preconditioned algorithms for the tensor completion problem via tensor ring decomposition. A new Riemannian metric is developed on the product space of the mode-2 unfolding matrices of the core tensors in tensor ring…
In this paper we propose a general spectral theory for tensors. Our proposed factorization decomposes a tensor into a product of orthogonal and scaling tensors. At the same time, our factorization yields an expansion of a tensor as a…
The popular Alternating Least Squares (ALS) algorithm for tensor decomposition is efficient and easy to implement, but often converges to poor local optima---particularly when the weights of the factors are non-uniform. We propose a…
In this thesis, a new class of algorithms based on Sums of Squares Programming is developed. These allow to reduce a degree-$d$ homogeneous polynomial $T = \sum_{i = 1}^m \langle a_i, X \rangle^d $ to a quadratic form being close to a…
For a matrix *-algebra B, consider the matrix *-algebra A consisting of the symmetric tensors in the n-fold tensor product of B. Examples of such algebras in coding theory include the Bose-Mesner algebra and Terwilliger algebra of the…
We calculate Frobenius-Schur indicator values for some fusion categories obtained from inclusions of finite groups $H\subset G$, where more concretely $G$ is symmetric or alternating, and $H$ is a symmetric, alternating or cyclic group. Our…
The Frobenius-Schwinger-Dyson equations are a rather high-brow abstract nonsense type of equations describing n-point functions of arbitrarily high composite insertions. It is not clear how to solve or even find approximate solutions of…
We define and study dense Frechet subalgebras of compact quantum groups consisting of elements rapidly decreasing with respect to an unbounded sequence of real numbers. Further, this sequence can be viewed as the eigenvalues of a Dirac-like…
For the general linear group $GL_n(k)$ over an algebraically closed field $k$ of characteristic $p$, there are two types of "twisting" operations that arise naturally on partitions. These are of the form $\lambda \rightarrow p\lambda$ and…