谷歌浏览器插件
订阅小程序
在清言上使用

Quasi-linear relation between partition and analytic rank

arXiv (Cornell University)(2022)

引用 0|浏览4
暂无评分
摘要
An important conjecture in additive combinatorics posits that the partition rank and analytic rank of tensors are equal up to a constant, over any finite field. We prove the conjecture up to logarithmic factors. Our proof is largely independent of previous work, utilizing recursively constructed polynomial identities and random walks on zero sets of polynomials. We also introduce a new, vector-valued notion of tensor rank (``local rank''), which serves as a bridge between partition and analytic rank and which may be of independent interest.
更多
查看译文
关键词
rank,partition,quasi-linear
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要