{"title":"无线电数字和SAT计算","authors":"Yuan Chang, J. D. Loera, W. J. Wesley","doi":"10.1145/3476446.3535494","DOIUrl":null,"url":null,"abstract":"Given a linear equation E, the k-color Rado number Rk(E) is the smallest integer n such that every k-coloring of {1,2,3,...,n} contains a monochromatic solution to E. The degree of regularity of E, denoted dor(E), is the largest value k such that Rk(E) is finite. In this article we present new theoretical and computational results about the Rado numbers R3(E) and the degree of regularity of three-variable equations E.","PeriodicalId":130499,"journal":{"name":"Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation","volume":"1088 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Rado Numbers and SAT Computations\",\"authors\":\"Yuan Chang, J. D. Loera, W. J. Wesley\",\"doi\":\"10.1145/3476446.3535494\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given a linear equation E, the k-color Rado number Rk(E) is the smallest integer n such that every k-coloring of {1,2,3,...,n} contains a monochromatic solution to E. The degree of regularity of E, denoted dor(E), is the largest value k such that Rk(E) is finite. In this article we present new theoretical and computational results about the Rado numbers R3(E) and the degree of regularity of three-variable equations E.\",\"PeriodicalId\":130499,\"journal\":{\"name\":\"Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation\",\"volume\":\"1088 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3476446.3535494\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3476446.3535494","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Given a linear equation E, the k-color Rado number Rk(E) is the smallest integer n such that every k-coloring of {1,2,3,...,n} contains a monochromatic solution to E. The degree of regularity of E, denoted dor(E), is the largest value k such that Rk(E) is finite. In this article we present new theoretical and computational results about the Rado numbers R3(E) and the degree of regularity of three-variable equations E.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
