{"title":"关于在括号序列上定义的布尔函数","authors":"Norbert Hegyv´ari","doi":"10.47443/dml.2022.209","DOIUrl":null,"url":null,"abstract":"In the paper [B. Bakos, N. Hegyv´ari, M. P´alfy, X. H. Yan, Discrete Math. Lett. 4 (2020) 31–36], the authors introduced the so-called pseudo-recursive sequences which generalize bracket sequences. In the present article, Boolean functions are defined on hypergraphs with edges having big intersections induced by bracket sequences and hypergraphs that are thinly intersecting. These Boolean functions related to combinatorial number theory are new in this area.","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2023-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Boolean Functions Defined on Bracket Sequences\",\"authors\":\"Norbert Hegyv´ari\",\"doi\":\"10.47443/dml.2022.209\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the paper [B. Bakos, N. Hegyv´ari, M. P´alfy, X. H. Yan, Discrete Math. Lett. 4 (2020) 31–36], the authors introduced the so-called pseudo-recursive sequences which generalize bracket sequences. In the present article, Boolean functions are defined on hypergraphs with edges having big intersections induced by bracket sequences and hypergraphs that are thinly intersecting. These Boolean functions related to combinatorial number theory are new in this area.\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2022.209\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2022.209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
In the paper [B. Bakos, N. Hegyv´ari, M. P´alfy, X. H. Yan, Discrete Math. Lett. 4 (2020) 31–36], the authors introduced the so-called pseudo-recursive sequences which generalize bracket sequences. In the present article, Boolean functions are defined on hypergraphs with edges having big intersections induced by bracket sequences and hypergraphs that are thinly intersecting. These Boolean functions related to combinatorial number theory are new in this area.