Related papers: Tensor products of coherent configurations
In many instances one has to deal with parametric models. Such models in vector spaces are connected to a linear map. The reproducing kernel Hilbert space and affine- / linear- representations in terms of tensor products are directly…
In general, algorithms for order-3 CANDECOMP/-PARAFAC (CP), also coined canonical polyadic decomposition (CPD), are easily to implement and can be extended to higher order CPD. Unfortunately, the algorithms become computationally demanding,…
We study the categorical framework for the computation of persistent homology, without reliance on a particular computational algorithm. The computation of persistent homology is commonly summarized as a matrix theorem, which we call the…
It is well known that the cohomology of a tensor product is essentially the tensor product of the cohomologies. We look at twisted tensor products, and investigate to which extend this is still true. We give an explicit description of the…
The aim is the theorems of the title and the corollary that the tensor product of two free crossed resolutions of groups or groupoids is also a free crossed resolution of the product group or groupoid. The route to this corollary is through…
We investigate the relation between Cartan decompositions of the unitary group and discrete quantum symmetries. To every Cartan decomposition there corresponds a quantum symmetry which is the identity when applied twice. As an application,…
Every ordered collection of sets in Euclidean space can be associated to a combinatorial code, which records the regions cut out by the sets in space. Given two ordered collections of sets, one can form a third collection in which the…
We introduce a new, quadratically convergent algorithm for finding maximum absolute value entries of tensors represented in the canonical format. The computational complexity of the algorithm is linear in the dimension of the tensor. We…
We describe how to obtain a global t-structure from a semiorthogonal decomposition with compatible t-structures on every component. This result is used to generalize a well-known theorem of Bondal on full strong exceptional sequences.
Most regularized tensor regression research focuses on tensors predictors with scalars responses or vectors predictors to tensors responses. We consider the sparse low rank tensor on tensor regression where predictors $\mathcal{X}$ and…
Canonical Polyadic (also known as Candecomp/Parafac) Decomposition (CPD) of a higher-order tensor is decomposition in a minimal number of rank-1 tensors. In Part I, we gave an overview of existing results concerning uniqueness and presented…
In this paper, we give a combinatorial rule to calculate the decomposition of the tensor product (Kronecker product) of two irreducible complex representations of the symmetric group ${\mathfrak S}_n$, when one of the representations…
Developed in a series of seminal papers in the early 2010s, the tubal tensor framework provides a clean and effective algebraic setting for tensor computations, supporting matrix-mimetic features such as a tensor Singular Value…
Coupled tensor decomposition reveals the joint data structure by incorporating priori knowledge that come from the latent coupled factors. The tensor ring (TR) decomposition is invariant under the permutation of tensors with different mode…
We solve a long-standing conjecture by Barker, proving that the minimal and maximal tensor products of two finite-dimensional proper cones coincide if and only if one of the two cones is generated by a linearly independent set. Here, given…
Differential geometries derived from tensor decompositions have been extensively studied and provided the foundations for a variety of efficient numerical methods. Despite the practical success of the tensor ring (TR) decomposition, its…
We give a systematic construction of semiorthogonal decompositions of derived categories of coherent sheaves on quasi-smooth derived algebraic stacks over $\mathbb{C}$, where the summands are subcategories defined by weight conditions, and…
The term fractal describes a class of complex structures exhibiting self-similarity across different scales. Fractal patterns can be created by using various techniques such as finite subdivision rules and iterated function systems. In this…
The (efficient and parsimonious) decomposition of higher-order tensors is a fundamental problem with numerous applications in a variety of fields. Several methods have been proposed in the literature to that end, with the Tucker and PARAFAC…
This paper is a sequel to "Localization of $\frak{u}$-modules. I", hep-th/9411050. We are starting here the geometric study of the tensor category $\cal{C}$ associated with a quantum group (corresponding to a Cartan matrix of finite type)…