Thang Pham, Steven Senger, Michael Tait, Vu Thi Huong Thu
{"title":"伪随机图中的几何结构","authors":"Thang Pham, Steven Senger, Michael Tait, Vu Thi Huong Thu","doi":"10.4153/s0008414x24000245","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the continuous setting. The results present interactions between discrete geometry, geometric measure theory, and graph theory.</p>","PeriodicalId":501820,"journal":{"name":"Canadian Journal of Mathematics","volume":"25 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Geometric structures in pseudo-random graphs\",\"authors\":\"Thang Pham, Steven Senger, Michael Tait, Vu Thi Huong Thu\",\"doi\":\"10.4153/s0008414x24000245\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the continuous setting. The results present interactions between discrete geometry, geometric measure theory, and graph theory.</p>\",\"PeriodicalId\":501820,\"journal\":{\"name\":\"Canadian Journal of Mathematics\",\"volume\":\"25 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Canadian Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4153/s0008414x24000245\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Canadian Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4153/s0008414x24000245","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the continuous setting. The results present interactions between discrete geometry, geometric measure theory, and graph theory.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
