A tensor rank theory and maximum full rank subtensors

نویسندگان

چکیده

A matrix always has a full rank submatrix such that the of this is equal to submatrix. This property one corner stones theory. We call max-full-rank-submatrix property. Tensor ranks play crucial role in low tensor approximation, completion and recovery. However, their theory still not matured yet. Can we set an axiom system for ranks? extend tensors? explore these paper. first propose some axioms functions. Then introduce proper The CP function, but proper. There are two functions, max-Tucker submax-Tucker rank, which associated with Tucker decomposition. define partial order among functions show there exists unique smallest function. concept, max-full-rank-subtensor function have closure arbitrary it An application also presented.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low-rank Tensor Approximation

Approximating a tensor by another of lower rank is in general an ill posed problem. Yet, this kind of approximation is mandatory in the presence of measurement errors or noise. We show how tools recently developed in compressed sensing can be used to solve this problem. More precisely, a minimal angle between the columns of loading matrices allows to restore both existence and uniqueness of the...

متن کامل

Exploring Tensor Rank

We consider the problem of tensor rank. We define tensor rank, discuss the motivations behind exploring the topic, and give some examples of the difficulties we face when trying to compute tensor rank. Some simpler lower and upper bounds for tensor rank are proven, and two techniques for giving lower bounds are explored. Finally we give one explicit example of a construction of an n×n×n tensors...

متن کامل

Geometric Complexity Theory, Tensor Rank, and Littlewood-Richardson Coefficients

We provide a thorough introduction to Geometric Complexity Theory, an approach towards computational complexity lower bounds via methods from algebraic geometry and representation theory. Then we focus on the relevant representation theoretic multiplicities, namely plethysm coefficients, Kronecker coefficients, and Littlewood-Richardson coefficients. These multiplicities can be described as dim...

متن کامل

Characterization of $2times 2$ full diversity space-time codes and inequivalent full rank spaces

‎In wireless communication systems‎, ‎space-time codes are applied to encode data when multiple antennas are used in the receiver and transmitter‎. ‎The concept of diversity is very crucial in designing space-time codes‎. ‎In this paper‎, ‎using the equivalent definition of full diversity space-time codes‎, ‎we first characterize all real and complex $2times 2$ rate one linear dispersion space-...

متن کامل

The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor∗

The ability to approximate a multivariate function/tensor as a sum of separable functions/tensors is quite useful. Unfortunately, algorithms to do so are not robust and regularly exhibit unpleasantly interesting behavior. A variety of different algorithms have been proposed with different features, but the state of the art is still unsatisfactory. In this work we step back from the algorithms a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Mathematical Sciences

سال: 2021

ISSN: ['1539-6746', '1945-0796']

DOI: https://doi.org/10.4310/cms.2021.v19.n1.a11