{"title":"关于多项式和指数和的实根的期望个数","authors":"Gregorio Malajovich","doi":"10.1016/j.jco.2022.101720","DOIUrl":null,"url":null,"abstract":"<div><p><span>The expected number of real projective roots of orthogonally invariant random homogeneous real polynomial systems is known to be equal to the square root of the Bézout number. A similar result is known for random multi-homogeneous systems, invariant through a product of </span>orthogonal groups. In this note, those results are generalized to certain families of sparse polynomial systems, with no orthogonal invariance assumed.</p></div>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"On the expected number of real roots of polynomials and exponential sums\",\"authors\":\"Gregorio Malajovich\",\"doi\":\"10.1016/j.jco.2022.101720\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span>The expected number of real projective roots of orthogonally invariant random homogeneous real polynomial systems is known to be equal to the square root of the Bézout number. A similar result is known for random multi-homogeneous systems, invariant through a product of </span>orthogonal groups. In this note, those results are generalized to certain families of sparse polynomial systems, with no orthogonal invariance assumed.</p></div>\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2023-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0885064X22000851\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0885064X22000851","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
On the expected number of real roots of polynomials and exponential sums
The expected number of real projective roots of orthogonally invariant random homogeneous real polynomial systems is known to be equal to the square root of the Bézout number. A similar result is known for random multi-homogeneous systems, invariant through a product of orthogonal groups. In this note, those results are generalized to certain families of sparse polynomial systems, with no orthogonal invariance assumed.
期刊介绍:
Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance.
Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.