首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 62 毫秒
1.
We introduce a ramified monoid, attached to each Brauer–type monoid, that is, to the symmetric group, to the Jones and Brauer monoids among others. Ramified monoids correspond to a class of tied monoids arising from knot theory and are interesting in themselves. The ramified monoid attached to the symmetric group is the Coxeter-like version of the so–called tied braid monoid. We give a presentation of the ramified monoid attached to the Brauer monoid. Also, we introduce and study two tied-like monoids that cannot be described as ramified monoids. However, these monoids can also be regarded as tied versions of the Jones and Brauer monoids.  相似文献   

2.
Noelle Antony 《代数通讯》2013,41(9):3329-3346
We explore some combinatorial properties of singular Artin monoids and invoke them to prove that a positive singular Artin monoid of arbitrary Coxeter type necessarily injects into the corresponding singular Artin monoid. This is an extension of L. Pari' result that positive Artin monoids embed in the correpsonding Artin groups: Adjoining inverses of the generators does not produce any new identities between words that do not involve those inverses.  相似文献   

3.
Free partially commutative inverse monoids are investigated. As in the case of free partially commutative monoids or groups (trace monoids or graph groups), free partially commutative inverse monoids are defined as quotients of free inverse monoids modulo a partially defined commutation relation on the generators. A quasi linear time algorithm for the word problem is presented. More precisely, we give an algorithm for a RAM. -completeness of the submonoid membership problem (also known as the generalized word problem) and the membership problem for rational sets is shown. Moreover, free partially commutative inverse monoids modulo a finite idempotent presentation are studied. It turns out that the word problem is decidable if and only if the complement of the partial commutation relation is transitive. The work on this paper has been supported by the DFG research project GELO (Graphen mit entscheidbaren Logiken).  相似文献   

4.
The endomorphism monoids of graphs have been actively investigated. They are convenient tools expressing asymmetries of the graphs. One of the most important classes of graphs considered in this framework is that of Cayley graphs. Our paper proposes a new method of using Cayley graphs for classification of data. We give a survey of recent results devoted to the Cayley graphs also involving their endomorphism monoids.  相似文献   

5.
6.
Kuratowski’s closure-complement problem gives rise to a monoid generated by the closure and complement operations. Consideration of this monoid yielded an interesting classification of topological spaces, and subsequent decades saw further exploration using other set operations. This article is an exploration of a natural analogue in ring theory: a monoid produced by “radical” and “annihilator” maps on the set of ideals of a ring. We succeed in characterizing semiprime rings and commutative dual rings by their radical-annihilator monoids, and we determine the monoids for commutative local zero-dimensional (in the sense of Krull dimension) rings.  相似文献   

7.
Using the formalism of module systems on a commutative cancellative monoid, we generalize the classical concept of Lorenzen monoids to obtain a multiplicative model for the semistar Kronecker function ring introduced by Fontana and Loper. We prove a universal mapping property and investigate the generalized Lorenzen monoid from a valuation-theoretic and an ideal-theoretic point of view.  相似文献   

8.
We generalize the constructions of layered domains? to layered semirings, in order to enrich the structure, and in particular to provide finite examples for applications in arithmetic. The layered category theory is extended accordingly, to cover noncancellative monoids, which are examined in their own right.  相似文献   

9.
The purpose of this paper is to give presentations for the monoids of orientation-preserving mappings on a finite chain of order n, and orientation-preserving or reversing mappings on such a chain. Both these monoids are natural extensions of the monoid of order-preserving mappings. The obtained presentations are on two and three generators, respectively, and have n + 2 and n + 6 relations, respectively.AMS Subject Classification (1991): 20M05 20M20 06A05  相似文献   

10.
We explore connections between elementary equivalence of categories of acts over monoids and second-order equivalence of monoids. __________ Translated from Algebrai Logika, Vol. 45, No. 6, pp. 687–709, November–December, 2006.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号