High-rank subtensors of high-rank tensors
Abstract
Let d 2 be a positive integer. We show that for a class of notions R of rank for order-d tensors, which includes in particular the tensor rank, the slice rank and the partition rank, there exist functions Fd,R and Gd,R such that if an order-d tensor has R-rank at least Gd,R(l) then we can restrict its entries to a product of sets X1 × … × Xd such that the restriction has R-rank at least l and the sets X1, …, Xd each have size at most Fd,R(l). Furthermore, our proof methods allow us to show that under a very natural condition we can require the sets X1, …, Xd to be pairwise disjoint.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.