English
Related papers

Related papers: Tensor products of coherent configurations

200 papers

The Cartan scheme $\cal X$ of a finite group $G$ with a $(B,N)$-pair is defined to be the coherent configuration associated with the action of $G$ on the right cosets of the Cartan subgroup $B\cap N$ by the right multiplications. It is…

Combinatorics · Mathematics 2019-02-01 Ilia Ponomarenko , Andrey Vasil'ev

We develop a framework to analyse invariant decompositions of elements of tensor product spaces. Namely, we define an invariant decomposition with indices arranged on a simplicial complex, and which is explicitly invariant under a group…

Combinatorics · Mathematics 2024-03-05 Gemma De las Cuevas , Matt Hoogsteder Riera , Tim Netzer

One of the main issues in computing a tensor decomposition is how to choose the number of rank-one components, since there is no finite algorithms for determining the rank of a tensor. A commonly used approach for this purpose is to find a…

Computer Vision and Pattern Recognition · Computer Science 2023-09-15 Claudio Turchetti

Accurately evaluating configurational integrals for dense solids remains a central and difficult challenge in the statistical mechanics of condensed systems. Here, we present a novel tensor network approach that reformulates the…

A Hadamard-Hitchcock decomposition of a multidimensional array is a decomposition that expresses the latter as a Hadamard product of several tensor rank decompositions. Such decompositions can encode probability distributions that arise…

Algebraic Geometry · Mathematics 2025-10-30 Alessandro Oneto , Nick Vannieuwenhoven

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful…

Information Theory · Computer Science 2017-04-07 Pierre Comon , Yang Qi , Konstantin Usevich

This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…

Numerical Analysis · Mathematics 2015-10-06 Jiawang Nie

We obtain several rigidity results regarding tensor product decompositions of factors. First, we show that any full factor with separable predual has at most countably many tensor product decompositions up to stable unitary conjugacy. We…

Operator Algebras · Mathematics 2019-05-27 Yusuke Isono , Amine Marrakchi

Let $A$ be a, not necessarily closed, linear relation in a Hilbert space $\sH$ with a multivalued part $\mul A$. An operator $B$ in $\sH$ with $\ran B\perp\mul A^{**}$ is said to be an operator part of $A$ when $A=B \hplus (\{0\}\times \mul…

Functional Analysis · Mathematics 2009-07-01 S. Hassi , H. S. V. de Snoo , F. H. Szafraniec

Tensor decomposition is an important technique for capturing the high-order interactions among multiway data. Multi-linear tensor composition methods, such as the Tucker decomposition and the CANDECOMP/PARAFAC (CP), assume that the complex…

Machine Learning · Statistics 2016-11-04 Bin Liu , Zenglin Xu , Yingming Li

In this paper we study the set of tensors that admit a special type of decomposition called an orthogonal tensor train decomposition. Finding equations defining varieties of low-rank tensors is generally a hard problem, however, the set of…

Algebraic Geometry · Mathematics 2021-11-01 Pardis Semnani , Elina Robeva

Kruskal's theorem states that a sum of product tensors constitutes a unique tensor rank decomposition if the so-called k-ranks of the product tensors are large. We prove a "splitting theorem" for sets of product tensors, in which the k-rank…

Combinatorics · Mathematics 2023-05-09 Benjamin Lovitz , Fedor Petrov

Tensor networks have in recent years emerged as the powerful tools for solving the large-scale optimization problems. One of the most popular tensor network is tensor train (TT) decomposition that acts as the building blocks for the…

Numerical Analysis · Computer Science 2016-06-20 Qibin Zhao , Guoxu Zhou , Shengli Xie , Liqing Zhang , Andrzej Cichocki

A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. We consider the completely positive tensor decomposition problem. A semidefinite algorithm is presented for checking whether a…

Optimization and Control · Mathematics 2014-11-20 Jinyan Fan , Anwa Zhou

Tensor decompositions are promising tools for big data analytics as they bring multiple modes and aspects of data to a unified framework, which allows us to discover complex internal structures and correlations of data. Unfortunately most…

Numerical Analysis · Computer Science 2014-12-30 Guoxu Zhou , Andrzej Cichocki , Shengli Xie

Configuration-space matrix elements of N-body potentials arise naturally and ubiquitously in the Ritz-Galerkin solution of many-body quantum problems. For the common specialization of local, finite-range potentials, we develop the eXact…

The Tucker decomposition expresses a given tensor as the product of a small core tensor and a set of factor matrices. Apart from providing data compression, the construction is useful in performing analysis such as principal component…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-07-19 Venkatesan T Chakaravarthy , Jee W Choi , Douglas J Joseph , Xing Liu , Prakash Murali , Yogish Sabharwal , Dheeraj Sreedhar

In the perspective of homogenization theory, strain-gradient elasticity is a strategy to describe the overall behaviour of materials with coarse mesostructure. In this approach, the effect of the mesostructure is described by the use of…

Mathematical Physics · Physics 2021-02-03 Nicolas Auffray , Houssam Andoul-Anziz , Boris Desmorat

Kruskal's theorem states that a sum of product tensors constitutes a unique tensor rank decomposition if the so-called k-ranks of the product tensors are large. In this work, we propose a conjecture in which the k-rank condition of…

Combinatorics · Mathematics 2020-08-21 Benjamin Lovitz

Let $T$ be a maximal torus of a semisimple complex algebraic group, $\mathrm{BS}(s)$ be the Bott-Samelson variety for a sequence of simple reflections $s$ and $\mathrm{BS}(s)^T$ be the set of $T$-fixed points of $\mathrm{BS}(s)$. We prove…

Representation Theory · Mathematics 2020-06-11 Vladimir Shchigolev
‹ Prev 1 2 3 10 Next ›