Alperen A. Ergür, Jesus Rebollo Bueno, Petros Valettas
{"title":"近似实对称张量秩","authors":"Alperen A. Ergür, Jesus Rebollo Bueno, Petros Valettas","doi":"10.1007/s40598-023-00235-4","DOIUrl":null,"url":null,"abstract":"<div><p>We investigate the effect of an <span>\\(\\varepsilon \\)</span>-room of perturbation tolerance on symmetric tensor decomposition. To be more precise, suppose a real symmetric <i>d</i>-tensor <i>f</i>, a norm <span>\\(\\left\\Vert \\cdot \\right\\Vert \\)</span> on the space of symmetric <i>d</i>-tensors, and <span>\\(\\varepsilon >0\\)</span> are given. What is the smallest symmetric tensor rank in the <span>\\(\\varepsilon \\)</span>-neighborhood of <i>f</i>? In other words, what is the symmetric tensor rank of <i>f</i> after a clever <span>\\(\\varepsilon \\)</span>-perturbation? We prove two theorems and develop three corresponding algorithms that give constructive upper bounds for this question. With expository goals in mind, we present probabilistic and convex geometric ideas behind our results, reproduce some known results, and point out open problems.</p></div>","PeriodicalId":37546,"journal":{"name":"Arnold Mathematical Journal","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Approximate Real Symmetric Tensor Rank\",\"authors\":\"Alperen A. Ergür, Jesus Rebollo Bueno, Petros Valettas\",\"doi\":\"10.1007/s40598-023-00235-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We investigate the effect of an <span>\\\\(\\\\varepsilon \\\\)</span>-room of perturbation tolerance on symmetric tensor decomposition. To be more precise, suppose a real symmetric <i>d</i>-tensor <i>f</i>, a norm <span>\\\\(\\\\left\\\\Vert \\\\cdot \\\\right\\\\Vert \\\\)</span> on the space of symmetric <i>d</i>-tensors, and <span>\\\\(\\\\varepsilon >0\\\\)</span> are given. What is the smallest symmetric tensor rank in the <span>\\\\(\\\\varepsilon \\\\)</span>-neighborhood of <i>f</i>? In other words, what is the symmetric tensor rank of <i>f</i> after a clever <span>\\\\(\\\\varepsilon \\\\)</span>-perturbation? We prove two theorems and develop three corresponding algorithms that give constructive upper bounds for this question. With expository goals in mind, we present probabilistic and convex geometric ideas behind our results, reproduce some known results, and point out open problems.</p></div>\",\"PeriodicalId\":37546,\"journal\":{\"name\":\"Arnold Mathematical Journal\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Arnold Mathematical Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s40598-023-00235-4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Arnold Mathematical Journal","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s40598-023-00235-4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
We investigate the effect of an \(\varepsilon \)-room of perturbation tolerance on symmetric tensor decomposition. To be more precise, suppose a real symmetric d-tensor f, a norm \(\left\Vert \cdot \right\Vert \) on the space of symmetric d-tensors, and \(\varepsilon >0\) are given. What is the smallest symmetric tensor rank in the \(\varepsilon \)-neighborhood of f? In other words, what is the symmetric tensor rank of f after a clever \(\varepsilon \)-perturbation? We prove two theorems and develop three corresponding algorithms that give constructive upper bounds for this question. With expository goals in mind, we present probabilistic and convex geometric ideas behind our results, reproduce some known results, and point out open problems.
期刊介绍：
The Arnold Mathematical Journal publishes interesting and understandable results in all areas of mathematics. The name of the journal is not only a dedication to the memory of Vladimir Arnold (1937 – 2010), one of the most influential mathematicians of the 20th century, but also a declaration that the journal should serve to maintain and promote the scientific style characteristic for Arnold''s best mathematical works. Features of AMJ publications include: Popularity. The journal articles should be accessible to a very wide community of mathematicians. Not only formal definitions necessary for the understanding must be provided but also informal motivations even if the latter are well-known to the experts in the field. Interdisciplinary and multidisciplinary mathematics. AMJ publishes research expositions that connect different mathematical subjects. Connections that are useful in both ways are of particular importance. Multidisciplinary research (even if the disciplines all belong to pure mathematics) is generally hard to evaluate, for this reason, this kind of research is often under-represented in specialized mathematical journals. AMJ will try to compensate for this.Problems, objectives, work in progress. Most scholarly publications present results of a research project in their “final'' form, in which all posed questions are answered. Some open questions and conjectures may be even mentioned, but the very process of mathematical discovery remains hidden. Following Arnold, publications in AMJ will try to unhide this process and made it public by encouraging the authors to include informal discussion of their motivation, possibly unsuccessful lines of attack, experimental data and close by research directions. AMJ publishes well-motivated research problems on a regular basis. Problems do not need to be original; an old problem with a new and exciting motivation is worth re-stating. Following Arnold''s principle, a general formulation is less desirable than the simplest partial case that is still unknown.Being interesting. The most important requirement is that the article be interesting. It does not have to be limited by original research contributions of the author; however, the author''s responsibility is to carefully acknowledge the authorship of all results. Neither does the article need to consist entirely of formal and rigorous arguments. It can contain parts, in which an informal author''s understanding of the overall picture is presented; however, these parts must be clearly indicated.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
