{"title":"32点平面集合中最大减半线数下界的改进","authors":"Javier Rodrigo, Ma Dolores López","doi":"10.1016/j.endm.2018.06.052","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper we give a recursive lower bound on the maximum number of halving lines for sets in the plane and as a consequence we improve the current best lower bound on the maximum number of halving lines for sets in the plane with 32 points.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.052","citationCount":"1","resultStr":"{\"title\":\"An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points\",\"authors\":\"Javier Rodrigo, Ma Dolores López\",\"doi\":\"10.1016/j.endm.2018.06.052\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper we give a recursive lower bound on the maximum number of halving lines for sets in the plane and as a consequence we improve the current best lower bound on the maximum number of halving lines for sets in the plane with 32 points.</p></div>\",\"PeriodicalId\":35408,\"journal\":{\"name\":\"Electronic Notes in Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.052\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571065318301434\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318301434","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points
In this paper we give a recursive lower bound on the maximum number of halving lines for sets in the plane and as a consequence we improve the current best lower bound on the maximum number of halving lines for sets in the plane with 32 points.
期刊介绍：
Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
