The interplay between bounded ranks of tensors arising from partitions
Combinatorics
2023-10-18 v1
Abstract
Let be integers. Using a fragmentation technique, we characterise -tuples of non-empty families of partitions of such that it suffices for an order- tensor to have bounded -rank for each for it to have bounded -rank. On the way, we prove power lower bounds on products of identity tensors that do not have rank , providing a qualitative answer to a question of Naslund.
Cite
@article{arxiv.2310.11356,
title = {The interplay between bounded ranks of tensors arising from partitions},
author = {Thomas Karam},
journal= {arXiv preprint arXiv:2310.11356},
year = {2023}
}
Comments
25 pages