{"title":"具有多数操作证人的集中一元群研究","authors":"Hajime Machida","doi":"10.7561/sacs.2023.1.79","DOIUrl":null,"url":null,"abstract":"A centralizing monoid M is a set of unary operations which commute with some set F of operations. Here, F is called a witness of M . On a 3-element set, a centralizing monoid is maximal if and only if it has a constant operation or a majority minimal operation as its witness. In this paper, we take one such majority operation, which corresponds to a maximal centralizing monoid, on a 3-element set and obtain its generalization, called mb , on a k-element set for any k >= 3. We explicitly describe the centralizing monoid M(mb ) with mb as its witness and then prove that it is not maximal if k > 3, contrary to the case for k = 3.","PeriodicalId":394919,"journal":{"name":"Sci. Ann. Comput. Sci.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Study on Centralizing Monoids with Majority Operation Witnesses\",\"authors\":\"Hajime Machida\",\"doi\":\"10.7561/sacs.2023.1.79\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A centralizing monoid M is a set of unary operations which commute with some set F of operations. Here, F is called a witness of M . On a 3-element set, a centralizing monoid is maximal if and only if it has a constant operation or a majority minimal operation as its witness. In this paper, we take one such majority operation, which corresponds to a maximal centralizing monoid, on a 3-element set and obtain its generalization, called mb , on a k-element set for any k >= 3. We explicitly describe the centralizing monoid M(mb ) with mb as its witness and then prove that it is not maximal if k > 3, contrary to the case for k = 3.\",\"PeriodicalId\":394919,\"journal\":{\"name\":\"Sci. Ann. Comput. Sci.\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sci. Ann. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7561/sacs.2023.1.79\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sci. Ann. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7561/sacs.2023.1.79","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Study on Centralizing Monoids with Majority Operation Witnesses
A centralizing monoid M is a set of unary operations which commute with some set F of operations. Here, F is called a witness of M . On a 3-element set, a centralizing monoid is maximal if and only if it has a constant operation or a majority minimal operation as its witness. In this paper, we take one such majority operation, which corresponds to a maximal centralizing monoid, on a 3-element set and obtain its generalization, called mb , on a k-element set for any k >= 3. We explicitly describe the centralizing monoid M(mb ) with mb as its witness and then prove that it is not maximal if k > 3, contrary to the case for k = 3.