{"title":"测量关联性：无向图的图代数","authors":"Kamilla Kátai-Urbán, Tamás Waldhauser","doi":"10.1007/s00012-024-00854-8","DOIUrl":null,"url":null,"abstract":"<div><p>We study two measures of associativity for graph algebras of finite undirected graphs: the index of nonassociativity and (a variant of) the semigroup distance. We determine “almost associative” and “antiassociative” graphs with respect to both measures. It turns out that the antiassociative graphs are exactly the balanced complete bipartite graphs, no matter which of the two measures we consider. In the class of connected graphs the two notions of almost associativity are also equivalent.</p></div>","PeriodicalId":50827,"journal":{"name":"Algebra Universalis","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00012-024-00854-8.pdf","citationCount":"0","resultStr":"{\"title\":\"Measuring associativity: graph algebras of undirected graphs\",\"authors\":\"Kamilla Kátai-Urbán, Tamás Waldhauser\",\"doi\":\"10.1007/s00012-024-00854-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We study two measures of associativity for graph algebras of finite undirected graphs: the index of nonassociativity and (a variant of) the semigroup distance. We determine “almost associative” and “antiassociative” graphs with respect to both measures. It turns out that the antiassociative graphs are exactly the balanced complete bipartite graphs, no matter which of the two measures we consider. In the class of connected graphs the two notions of almost associativity are also equivalent.</p></div>\",\"PeriodicalId\":50827,\"journal\":{\"name\":\"Algebra Universalis\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-05-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s00012-024-00854-8.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Algebra Universalis\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00012-024-00854-8\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algebra Universalis","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00012-024-00854-8","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
Measuring associativity: graph algebras of undirected graphs
We study two measures of associativity for graph algebras of finite undirected graphs: the index of nonassociativity and (a variant of) the semigroup distance. We determine “almost associative” and “antiassociative” graphs with respect to both measures. It turns out that the antiassociative graphs are exactly the balanced complete bipartite graphs, no matter which of the two measures we consider. In the class of connected graphs the two notions of almost associativity are also equivalent.
期刊介绍：
Algebra Universalis publishes papers in universal algebra, lattice theory, and related fields. In a pragmatic way, one could define the areas of interest of the journal as the union of the areas of interest of the members of the Editorial Board. In addition to research papers, we are also interested in publishing high quality survey articles.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
