{"title":"Some nil-ai-semiring varieties","authors":"","doi":"10.1007/s00233-024-10411-3","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>We study some nil-ai-semiring varieties. We establish a model for the free object in the variety <span> <span>\\(\\textbf{FC}\\)</span> </span> generated by all commutative flat semirings. Also, we provide two sufficient conditions under which a finite ai-semiring is nonfinitely based. As a consequence, we show that the power semiring <span> <span>\\(P_{\\scriptstyle {\\dot{S}}_{c}(W)}\\)</span> </span> of the finite nil-semigroup <span> <span>\\({\\dot{S}}_{c}(W)\\)</span> </span> is nonfinitely based, where <em>W</em> is a finite set of words in the free commutative semigroup <span> <span>\\(X_{c}^{+}\\)</span> </span> over an alphabet <em>X</em>, whenever the maximum of lengths of words in <em>W</em> is <span> <span>\\(k\\ge 3\\)</span> </span> and <em>W</em> does not contain the <em>k</em>th power of a letter. This partially answers a problem raised by Jackson et al. (J Algebr 611: 211–245, 2022).</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00233-024-10411-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We study some nil-ai-semiring varieties. We establish a model for the free object in the variety \(\textbf{FC}\) generated by all commutative flat semirings. Also, we provide two sufficient conditions under which a finite ai-semiring is nonfinitely based. As a consequence, we show that the power semiring \(P_{\scriptstyle {\dot{S}}_{c}(W)}\) of the finite nil-semigroup \({\dot{S}}_{c}(W)\) is nonfinitely based, where W is a finite set of words in the free commutative semigroup \(X_{c}^{+}\) over an alphabet X, whenever the maximum of lengths of words in W is \(k\ge 3\) and W does not contain the kth power of a letter. This partially answers a problem raised by Jackson et al. (J Algebr 611: 211–245, 2022).