首页 > 最新文献

Int. J. Algebra Comput.最新文献

英文 中文
Failure of the finitely generated intersection property for ascending HNN extensions of free groups 自由群的HNN升序扩展有限生成交性质失效
Pub Date : 2022-01-29 DOI: 10.1142/s0218196722500370
Jacob Bamberger, D. Wise
The main result in this paper is the failure of the finitely generated intersection property (FGIP) of ascending HNN extensions of non-cyclic finite rank free groups. This class of groups consists of free-by-cyclic groups and properly ascending HNN extensions of free groups. We also give a sufficient condition for the failure of the FGIP in the context of relative hyperbolicity, we apply this to free-by-cyclic groups of exponential growth.
本文的主要结果是非循环有限秩自由群的HNN升序扩展的有限生成交性质失效。这类群由自由环群和自由群的适当升序HNN扩展组成。在相对双曲的情况下,给出了FGIP失效的充分条件,并将其应用于指数增长的自由环群。
{"title":"Failure of the finitely generated intersection property for ascending HNN extensions of free groups","authors":"Jacob Bamberger, D. Wise","doi":"10.1142/s0218196722500370","DOIUrl":"https://doi.org/10.1142/s0218196722500370","url":null,"abstract":"The main result in this paper is the failure of the finitely generated intersection property (FGIP) of ascending HNN extensions of non-cyclic finite rank free groups. This class of groups consists of free-by-cyclic groups and properly ascending HNN extensions of free groups. We also give a sufficient condition for the failure of the FGIP in the context of relative hyperbolicity, we apply this to free-by-cyclic groups of exponential growth.","PeriodicalId":13615,"journal":{"name":"Int. J. Algebra Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77557265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On complete Leibniz algebras 关于完全莱布尼兹代数
Pub Date : 2022-01-28 DOI: 10.1142/s0218196722500138
Sh. A. Ayupov, A. Khudoyberdiyev, Z. Shermatova
This paper is devoted to the so-called complete Leibniz algebras. We construct some complete Leibniz algebras with complete radical and prove that the direct sum of complete Leibniz algebras is also complete. It is known that a Lie algebra with a complete ideal is split. We discuss the analogs of this result for the Leibniz algebras and show that it is true for some special classes of Leibniz algebras. Finally, we consider derivations of Leibniz algebras and present some classes of Leibniz algebras which are not complete, since they admit outer derivation.
本文致力于研究所谓的完全莱布尼兹代数。构造了具有完全根的完全莱布尼兹代数,并证明了完全莱布尼兹代数的直和也是完全的。已知具有完全理想的李代数是分裂的。我们讨论了这一结果在莱布尼兹代数上的类似情形,并证明了它对某些特殊的莱布尼兹代数是成立的。最后,我们考虑了莱布尼兹代数的导数,并给出了一些不完备的莱布尼兹代数,因为它们允许外导。
{"title":"On complete Leibniz algebras","authors":"Sh. A. Ayupov, A. Khudoyberdiyev, Z. Shermatova","doi":"10.1142/s0218196722500138","DOIUrl":"https://doi.org/10.1142/s0218196722500138","url":null,"abstract":"This paper is devoted to the so-called complete Leibniz algebras. We construct some complete Leibniz algebras with complete radical and prove that the direct sum of complete Leibniz algebras is also complete. It is known that a Lie algebra with a complete ideal is split. We discuss the analogs of this result for the Leibniz algebras and show that it is true for some special classes of Leibniz algebras. Finally, we consider derivations of Leibniz algebras and present some classes of Leibniz algebras which are not complete, since they admit outer derivation.","PeriodicalId":13615,"journal":{"name":"Int. J. Algebra Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74805081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the primality and elasticity of algebraic valuations of cyclic free semirings 关于循环自由半环代数赋值的原性和弹性
Pub Date : 2022-01-04 DOI: 10.1142/s021819672350011x
Yanan Jiang, Bangzheng Li, So-Fan Zhu
A cancellative commutative monoid is atomic if every non-invertible element factors into irreducibles. Under certain mild conditions on a positive algebraic number $alpha$, the additive monoid $M_alpha$ of the evaluation semiring $mathbb{N}_0[alpha]$ is atomic. The atomic structure of both the additive and the multiplicative monoids of $mathbb{N}_0[alpha]$ has been the subject of several recent papers. Here we focus on the monoids $M_alpha$, and we study its omega-primality and elasticity, aiming to better understand some fundamental questions about their atomic decompositions. We prove that when $alpha$ is less than 1, the atoms of $M_alpha$ are as far from being prime as they can possibly be. Then we establish some results about the elasticity of $M_alpha$, including that when $alpha$ is rational, the elasticity of $M_alpha$ is full (this was previously conjectured by S. T. Chapman, F. Gotti, and M. Gotti).
如果每个不可逆的元素因子化为不可约的,则可消交换单群是原子的。在一定温和条件下,求值半环$mathbb{N}_0[alpha]$的加性单群$M_alpha$是原子的。$mathbb{N}_0[alpha]$的加性和乘性单群的原子结构是最近几篇论文的主题。本文主要研究一元群$M_ α $,并研究其ω -原数和弹性,旨在更好地理解它们的原子分解的一些基本问题。我们证明了当$ α $小于1时,$M_ α $的原子离素数的距离是尽可能远的。然后我们建立了关于$M_alpha$弹性的一些结果,包括当$alpha$是有理时,$M_alpha$的弹性是满的(这是S. T. Chapman, F. Gotti和M. Gotti先前推测的)。
{"title":"On the primality and elasticity of algebraic valuations of cyclic free semirings","authors":"Yanan Jiang, Bangzheng Li, So-Fan Zhu","doi":"10.1142/s021819672350011x","DOIUrl":"https://doi.org/10.1142/s021819672350011x","url":null,"abstract":"A cancellative commutative monoid is atomic if every non-invertible element factors into irreducibles. Under certain mild conditions on a positive algebraic number $alpha$, the additive monoid $M_alpha$ of the evaluation semiring $mathbb{N}_0[alpha]$ is atomic. The atomic structure of both the additive and the multiplicative monoids of $mathbb{N}_0[alpha]$ has been the subject of several recent papers. Here we focus on the monoids $M_alpha$, and we study its omega-primality and elasticity, aiming to better understand some fundamental questions about their atomic decompositions. We prove that when $alpha$ is less than 1, the atoms of $M_alpha$ are as far from being prime as they can possibly be. Then we establish some results about the elasticity of $M_alpha$, including that when $alpha$ is rational, the elasticity of $M_alpha$ is full (this was previously conjectured by S. T. Chapman, F. Gotti, and M. Gotti).","PeriodicalId":13615,"journal":{"name":"Int. J. Algebra Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77102125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Notes on join semidistributive lattices 关于连接半分配格的注意事项
Pub Date : 2022-01-01 DOI: 10.1142/S0218196722500175
K. Adaricheva, R. Freese, J. B. Nation
{"title":"Notes on join semidistributive lattices","authors":"K. Adaricheva, R. Freese, J. B. Nation","doi":"10.1142/S0218196722500175","DOIUrl":"https://doi.org/10.1142/S0218196722500175","url":null,"abstract":"","PeriodicalId":13615,"journal":{"name":"Int. J. Algebra Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77201563","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Identities of tropical matrix semigroups and the plactic monoid of rank 4 热带矩阵半群的恒等式与4阶的plactic单群
Pub Date : 2022-01-01 DOI: 10.1142/S0218196722500461
T. Aird
{"title":"Identities of tropical matrix semigroups and the plactic monoid of rank 4","authors":"T. Aird","doi":"10.1142/S0218196722500461","DOIUrl":"https://doi.org/10.1142/S0218196722500461","url":null,"abstract":"","PeriodicalId":13615,"journal":{"name":"Int. J. Algebra Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75326337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
On rings which are sums of subrings and additive subgroups 环是子群和可加子群的和
Pub Date : 2022-01-01 DOI: 10.1142/S0218196722500515
M. Kepczyk
{"title":"On rings which are sums of subrings and additive subgroups","authors":"M. Kepczyk","doi":"10.1142/S0218196722500515","DOIUrl":"https://doi.org/10.1142/S0218196722500515","url":null,"abstract":"","PeriodicalId":13615,"journal":{"name":"Int. J. Algebra Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73940827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Regular semigroups weakly generated by idempotents 幂等弱生成的正则半群
Pub Date : 2021-12-21 DOI: 10.1142/s0218196723500388
Lu'is Oliveira
A regular semigroup is weakly generated by a set X if it has no proper regular subsemigroups containing X. In this paper, we study the regular semigroups weakly generated by idempotents. We show there exists a regular semigroup FI(X) weakly generated by |X| idempotents such that all other regular semigroups weakly generated by |X| idempotents are homomorphic images of FI(X). The semigroup FI(X) is defined by a presentation $langle G(X),rho_ecuprho_srangle$ and its structure is studied. Although each of the sets $G(X)$, $rho_e$, and $rho_s$ is infinite for $|X|geq 2$, we show that the word problem is decidable as each congruence class has a canonical form. If $FI_n$ denotes FI(X) for $|X|=n$, we prove also that $FI_2$ contains copies of all $FI_n$ as subsemigroups. As a consequence, we conclude that (i) all regular semigroups weakly generated by a finite set of idempotents, which include all finitely idempotent generated regular semigroups, strongly divide $FI_2$; and (ii) all finite semigroups divide $FI_2$.
如果集合X不存在包含X的正则子群,则正则半群是由集合X弱生成的。本文研究了幂等函数弱生成的正则半群。证明了存在一个由|X|幂等幂弱生成的正则半群FI(X),使得其他所有由|X|幂等幂弱生成的正则半群都是FI(X)的同态像。给出了半群FI(X)的定义$langle G(X),rho_ecuprho_srangle$,并研究了它的结构。虽然对于$|X|geq 2$,每个集合$G(X)$、$rho_e$和$rho_s$都是无限的,但我们证明了字问题是可判定的,因为每个同余类都有一个规范形式。如果$FI_n$表示$|X|=n$的FI(X),我们也证明$FI_2$包含所有$FI_n$的副本作为子半群。因此,我们得到(i)由有限幂等生成的所有正则半群(包括所有有限幂等生成的正则半群)弱可除$FI_2$;(ii)所有有限半群可除$FI_2$。
{"title":"Regular semigroups weakly generated by idempotents","authors":"Lu'is Oliveira","doi":"10.1142/s0218196723500388","DOIUrl":"https://doi.org/10.1142/s0218196723500388","url":null,"abstract":"A regular semigroup is weakly generated by a set X if it has no proper regular subsemigroups containing X. In this paper, we study the regular semigroups weakly generated by idempotents. We show there exists a regular semigroup FI(X) weakly generated by |X| idempotents such that all other regular semigroups weakly generated by |X| idempotents are homomorphic images of FI(X). The semigroup FI(X) is defined by a presentation $langle G(X),rho_ecuprho_srangle$ and its structure is studied. Although each of the sets $G(X)$, $rho_e$, and $rho_s$ is infinite for $|X|geq 2$, we show that the word problem is decidable as each congruence class has a canonical form. If $FI_n$ denotes FI(X) for $|X|=n$, we prove also that $FI_2$ contains copies of all $FI_n$ as subsemigroups. As a consequence, we conclude that (i) all regular semigroups weakly generated by a finite set of idempotents, which include all finitely idempotent generated regular semigroups, strongly divide $FI_2$; and (ii) all finite semigroups divide $FI_2$.","PeriodicalId":13615,"journal":{"name":"Int. J. Algebra Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82238860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Evacuation schemes on Cayley graphs and non-amenability of groups Cayley图上的疏散方案和群体的不服从性
Pub Date : 2021-12-18 DOI: 10.1142/s0218196722500667
V. Guba
In this paper we introduce a concept of an evacuation scheme on the Cayley graph of an infinite finitely generated group. This is a collection of infinite simple paths bringing all vertices to infinity. We impose a restriction that every edge can be used a uniformly bounded number of times in this scheme. An easy observation shows that existing of such a scheme is equivalent to non-amenability of the group. A special case happens if every edge can be used only once. These scheme are called pure. We obtain a criterion for existing of such a scheme in terms of isoperimetric constant of the graph. We analyze R.,Thompson's group $F$, for which the amenability property is a famous open problem. We show that pure evacuation schemes do not exist for the set of generators ${x_0,x_1,bar{x}_1}$, where $bar{x}_1=x_1x_0^{-1}$. However, the question becomes open if edges with labels $x_0^{pm1}$ can be used twice. Existing of pure evacuation scheme for this version is implied by some natural conjectures.
本文在无限有限生成群的Cayley图上引入了疏散方案的概念。这是无限简单路径的集合,所有的顶点都是无穷大的。在该方案中,我们施加了一个限制,即每条边可以使用一致有界的次数。一个简单的观察表明,这种方案的存在等于群体的不服从。如果每条边只能使用一次,就会出现一种特殊情况。这些方案被称为纯方案。用图的等周常数给出了这种格式存在的判据。我们分析了r ,Thompson群$F$,其可服从性质是一个著名的开放问题。我们证明了对于${x_0,x_1,bar{x}_1}$,其中$bar{x}_1=x_1x_0^{-1}$的生成器集合不存在纯粹的疏散方案。然而,如果标签为$x_0^{pm1}$的边可以使用两次,问题就变得开放了。一些自然的猜想暗示了该版本的纯疏散方案的存在。
{"title":"Evacuation schemes on Cayley graphs and non-amenability of groups","authors":"V. Guba","doi":"10.1142/s0218196722500667","DOIUrl":"https://doi.org/10.1142/s0218196722500667","url":null,"abstract":"In this paper we introduce a concept of an evacuation scheme on the Cayley graph of an infinite finitely generated group. This is a collection of infinite simple paths bringing all vertices to infinity. We impose a restriction that every edge can be used a uniformly bounded number of times in this scheme. An easy observation shows that existing of such a scheme is equivalent to non-amenability of the group. A special case happens if every edge can be used only once. These scheme are called pure. We obtain a criterion for existing of such a scheme in terms of isoperimetric constant of the graph. We analyze R.,Thompson's group $F$, for which the amenability property is a famous open problem. We show that pure evacuation schemes do not exist for the set of generators ${x_0,x_1,bar{x}_1}$, where $bar{x}_1=x_1x_0^{-1}$. However, the question becomes open if edges with labels $x_0^{pm1}$ can be used twice. Existing of pure evacuation scheme for this version is implied by some natural conjectures.","PeriodicalId":13615,"journal":{"name":"Int. J. Algebra Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89589854","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
On one-relator groups and units of special one-relation inverse monoids 关于特殊单关系逆模群的单关系群和单位
Pub Date : 2021-11-30 DOI: 10.1142/s0218196722500618
Carl-Fredrik Nyberg Brodda
This note investigates and clarifies some connections between the theory of one-relator groups and special one-relation inverse monoids, i.e. those inverse monoids with a presentation of the form $operatorname{Inv}langle A mid w=1 rangle$. We show that every one-relator group admits a special one-relation inverse monoid presentation. We subsequently consider the classes ${rm {small ANY}}, {rm {small RED}}, {rm {small CRED}},$ and ${rm {small POS}}$ of one-relator groups which can be defined by special one-relation inverse monoid presentations in which the defining word is arbitrary; reduced; cyclically reduced; or positive, respectively. We show that the inclusions ${rm {small ANY}} supset {rm {small CRED}} supset {rm {small POS}}$ are all strict. Conditional on a natural conjecture, we prove ${rm {small ANY}} supset {rm {small RED}}$. Following this, we use the Benois algorithm recently devised by Gray&Ruskuc to produce an infinite family of special one-relation inverse monoids which exhibit similar pathological behaviour (which we term O'Haresque) to the O'Hare monoid with respect to computing the minimal invertible pieces of the defining word. Finally, we provide a counterexample to a conjecture by Gray&Ruskuc that the Benois algorithm always correctly computes the minimal invertible pieces of a special one-relation inverse monoid.
本文研究并阐明了单关系群理论与特殊的单关系逆模群,即具有$operatorname{Inv}langle a mid w=1 rangle$表示形式的逆模群之间的一些联系。我们证明了每一个单关系群都有一个特殊的单关系逆单群表示。我们随后考虑单相关群的${rm {small ANY}}、{rm {small RED}}、{rm {small CRED}}、$和${rm {small POS}}$类,它们可以由定义词为任意的特殊单相关逆单群表示来定义;减少;周期性减少;或者是正的。我们证明了包含项${rm {small ANY}} supset {rm {small CRED}} supset {rm {small POS}}$都是严格的。在一个自然猜想的条件下,我们证明了${rm {small ANY}} supset {rm {small RED}}$。在此之后,我们使用最近由Gray&Ruskuc设计的Benois算法来产生一个无限族的特殊单关系逆模群,它们在计算定义词的最小可逆块方面表现出与O'Hare模群相似的病态行为(我们称之为O'Haresque)。最后,我们给出了一个反例,证明了Gray&Ruskuc的一个猜想,即Benois算法总是正确地计算一个特殊的单关系逆单群的最小可逆块。
{"title":"On one-relator groups and units of special one-relation inverse monoids","authors":"Carl-Fredrik Nyberg Brodda","doi":"10.1142/s0218196722500618","DOIUrl":"https://doi.org/10.1142/s0218196722500618","url":null,"abstract":"This note investigates and clarifies some connections between the theory of one-relator groups and special one-relation inverse monoids, i.e. those inverse monoids with a presentation of the form $operatorname{Inv}langle A mid w=1 rangle$. We show that every one-relator group admits a special one-relation inverse monoid presentation. We subsequently consider the classes ${rm {small ANY}}, {rm {small RED}}, {rm {small CRED}},$ and ${rm {small POS}}$ of one-relator groups which can be defined by special one-relation inverse monoid presentations in which the defining word is arbitrary; reduced; cyclically reduced; or positive, respectively. We show that the inclusions ${rm {small ANY}} supset {rm {small CRED}} supset {rm {small POS}}$ are all strict. Conditional on a natural conjecture, we prove ${rm {small ANY}} supset {rm {small RED}}$. Following this, we use the Benois algorithm recently devised by Gray&Ruskuc to produce an infinite family of special one-relation inverse monoids which exhibit similar pathological behaviour (which we term O'Haresque) to the O'Hare monoid with respect to computing the minimal invertible pieces of the defining word. Finally, we provide a counterexample to a conjecture by Gray&Ruskuc that the Benois algorithm always correctly computes the minimal invertible pieces of a special one-relation inverse monoid.","PeriodicalId":13615,"journal":{"name":"Int. J. Algebra Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82870868","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
On the transition monoid of the Stallings automaton of a subgroup of a free group 关于自由群的子群的Stallings自动机的过渡单似子
Pub Date : 2021-11-26 DOI: 10.1142/s0218196723500224
I. F. Guimaraes
Birget, Margolis, Meakin and Weil proved that a finitely generated subgroup $K$ of a free group is pure if and only if the transition monoid $M(K)$ of its Stallings automaton is aperiodic. In this paper, we establish further connections between algebraic properties of $K$ and algebraic properties of $M(K)$. We mainly focus on the cases where $M(K)$ belongs to the pseudovariety $overline{boldsymbol{mathbf{{H}}}}$ of finite monoids all of whose subgroups lie in a given pseudovariety $overline{boldsymbol{mathbf{{H}}}}$ of finite groups. We also discuss normal, malnormal and cyclonormal subgroups of $F_A$ using the transition monoid of the corresponding Stallings automaton.
Birget, Margolis, Meakin和Weil证明了自由群的有限生成子群$K$是纯的,当且仅当其Stallings自动机的过渡单阵$M(K)$是非周期的。本文进一步建立了$K$的代数性质与$M(K)$的代数性质之间的联系。我们主要讨论$M(K)$属于有限一元群的伪变种$overline{boldsymbol{mathbf{{H}}}}$的情况,其所有子群都在有限群的给定伪变种$overline{boldsymbol{mathbf{{H}}}}$中。利用相应的Stallings自动机的过渡单阵讨论了$F_A$的正规子群、非正常子群和环正规子群。
{"title":"On the transition monoid of the Stallings automaton of a subgroup of a free group","authors":"I. F. Guimaraes","doi":"10.1142/s0218196723500224","DOIUrl":"https://doi.org/10.1142/s0218196723500224","url":null,"abstract":"Birget, Margolis, Meakin and Weil proved that a finitely generated subgroup $K$ of a free group is pure if and only if the transition monoid $M(K)$ of its Stallings automaton is aperiodic. In this paper, we establish further connections between algebraic properties of $K$ and algebraic properties of $M(K)$. We mainly focus on the cases where $M(K)$ belongs to the pseudovariety $overline{boldsymbol{mathbf{{H}}}}$ of finite monoids all of whose subgroups lie in a given pseudovariety $overline{boldsymbol{mathbf{{H}}}}$ of finite groups. We also discuss normal, malnormal and cyclonormal subgroups of $F_A$ using the transition monoid of the corresponding Stallings automaton.","PeriodicalId":13615,"journal":{"name":"Int. J. Algebra Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74274952","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Int. J. Algebra Comput.
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1