Tensor products of coherent configurations

05/22/2021
by   Gang Chen, et al.
0

A Cartesian decomposition of a coherent configuration X is defined as a special set of its parabolics that form a Cartesian decomposition of the underlying set. It turns out that every tensor decomposition of X comes from a certain Cartesian decomposition. It is proved that if the coherent configuration X is thick, then there is a unique maximal Cartesian decomposition of X, i.e., there is exactly one internal tensor decomposition of X into indecomposable components. In particular, this implies an analog of the Krull–Schmidt theorem for the thick coherent configurations. A polynomial-time algorithm for finding the maximal Cartesian decomposition of a thick coherent configuration is constructed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/02/2023

An algebraic algorithm for rank-2 ParaTuck-2 decomposition

In this note we consider the problem of ParaTuck-2 decomposition of a co...
research
03/04/2016

Identifiability of an X-rank decomposition of polynomial maps

In this paper, we study a polynomial decomposition model that arises in ...
research
02/13/2018

Legendre Tensor Decomposition

We present a novel nonnegative tensor decomposition method, called Legen...
research
10/29/2021

Landscape analysis of an improved power method for tensor decomposition

In this work, we consider the optimization formulation for symmetric ten...
research
10/06/2021

Lattice paths with a first return decomposition constrained by the maximal height of a pattern

We consider the system of equations A_k(x)=p(x)A_k-1(x)(q(x)+∑_i=0^k A_i...
research
08/13/2018

Motifs, Coherent Configurations and Second Order Network Generation

In this paper we illuminate some algebraic-combinatorial structure under...
research
09/16/2019

Multitype Integer Monoid Optimization and Applications

Configuration integer programs (IP) have been key in the design of algor...

Please sign up or login with your details

Forgot password? Click here to reset