{"title":"连接凸多边形顶点的非自相交路径集","authors":"I. Kortezov","doi":"10.53656/math2022-6-4-set","DOIUrl":null,"url":null,"abstract":"The paper deals with counting the sets of non-self-intersecting paths whose nodes form a partitioning of the set of vertices of a given convex polygon. There turn to exist compact formulae when the magnitude of these sets is fixed. Some of these formulae provide new properties for some of the entries of the On-line Encyclopedia of Integer Sequences, while others generate new entries therein.","PeriodicalId":41818,"journal":{"name":"Mathematics and Informatics","volume":null,"pages":null},"PeriodicalIF":0.2000,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sets of Non-Self-Intersecting Paths Connecting the Vertices of a Convex Polygon\",\"authors\":\"I. Kortezov\",\"doi\":\"10.53656/math2022-6-4-set\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper deals with counting the sets of non-self-intersecting paths whose nodes form a partitioning of the set of vertices of a given convex polygon. There turn to exist compact formulae when the magnitude of these sets is fixed. Some of these formulae provide new properties for some of the entries of the On-line Encyclopedia of Integer Sequences, while others generate new entries therein.\",\"PeriodicalId\":41818,\"journal\":{\"name\":\"Mathematics and Informatics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.2000,\"publicationDate\":\"2022-12-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematics and Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.53656/math2022-6-4-set\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"EDUCATION & EDUCATIONAL RESEARCH\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.53656/math2022-6-4-set","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"EDUCATION & EDUCATIONAL RESEARCH","Score":null,"Total":0}
Sets of Non-Self-Intersecting Paths Connecting the Vertices of a Convex Polygon
The paper deals with counting the sets of non-self-intersecting paths whose nodes form a partitioning of the set of vertices of a given convex polygon. There turn to exist compact formulae when the magnitude of these sets is fixed. Some of these formulae provide new properties for some of the entries of the On-line Encyclopedia of Integer Sequences, while others generate new entries therein.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
