Shao's polynomial bound conjecture for the primitive degree of tensors
Shao's polynomial bound conjecture for the primitive degree of tensors
Let be a nonnegative primitive tensor of fixed order and dimension . Its primitive degree is the smallest positive integer such that is essentially positive, equivalently such that the majorization matrix is positive, where . Shao's conjecture. When is fixed, there exists a polynomial such that
for every nonnegative primitive tensor of order and dimension . The conjecture asks for a polynomial upper bound, in the dimension, on the primitive degree of tensors of each fixed order; the supplied text gives no resolution, so its status remains open.
Equivalent formulations 1
Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.
Shao's polynomial bound conjecture for the primitive degree of tensors
Let be a nonnegative primitive tensor of fixed order and dimension , and let denote its primitive degree. Shao's conjecture. When is fixed, there exists a polynomial in such that
for all nonnegative primitive tensors of order and dimension . The conjecture asks for a polynomial upper bound on the primitive degree when the tensor order is fixed; the supplied source does not establish its resolution.
source: Pingzhi Yuany, Zilong He and Lihua You, “A conjecture on the primitive degree of Tensors”, arXiv:1310.8461 (2013).
Sources & referencesView supporting material
Primary source
Lihua You, Yafei Chen and Pingzhi Yuan, “Some results of strongly primitive tensors”, arXiv:1705.04554 (2017).
Additional references
3 papers in this index state this conjecture (2013–2017). The statement above is taken from the most recent of them; the others are arXiv:1408.3457, arXiv:1310.8461.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.