Results 11 to 20 of about 109 (62)
Some array polynomials over special monoid presentations [PDF]
In a recent joint paper (Cevik et al. in Hacet. J. Math. Stat., acceptted), the authors have investigated the p-Cockcroft property (or, equivalently, efficiency) for a presentation, say PE, of the semi-direct product of a free abelian monoid rank two by ...
A. Cevik +3 more
semanticscholar +3 more sources
A new monoid construction under crossed products
In this paper we define a new monoid construction under crossed products for given monoids. We also present a generating set and a relator set for this product.
A. Emin +3 more
semanticscholar +2 more sources
Strong conciseness in profinite groups
Abstract A group word w is said to be strongly concise in a class C of profinite groups if, for every group G in C such that w takes less than 2ℵ0 values in G, the verbal subgroup w(G) is finite. Detomi, Morigi and Shumyatsky established that multilinear commutator words — and the particular words x2 and [x2,y] — have the property that the ...
Eloisa Detomi +2 more
wiley +1 more source
Growth alternative for Hecke-Kiselman monoids
The Gelfand–Kirillov dimension of Hecke–Kiselman algebras defined by oriented graphs is studied. It is shown that the dimension is infinite if and only if the underlying graph contains two cycles connected by an (oriented) path.
Arkadiusz Mȩcel, J. Okniński
semanticscholar +1 more source
A new graph based on the semi-direct product of some monoids
In this paper, firstly, we define a new graph based on the semi-direct product of a free abelian monoid of rank n by a finite cyclic monoid, and then discuss some graph properties on this new graph, namely diameter, maximum and minimum degrees, girth ...
E. G. Karpuz +3 more
semanticscholar +2 more sources
The graph based on Gröbner-Shirshov bases of groups
Let us consider groups G1=Zk∗(Zm∗Zn), G2=Zk×(Zm∗Zn), G3=Zk∗(Zm×Zn), G4=(Zk∗Zl)∗(Zm∗Zn) and G5=(Zk∗Zl)×(Zm∗Zn), where k,l,m,n≥2. In this paper, by defining a new graph Γ(Gi) based on the Gröbner-Shirshov bases over groups Gi, where 1≤i≤5, we calculate the
Eylem G. Karpuz +3 more
semanticscholar +2 more sources
Non-commutative finite monoids of a given order n ≥ 4
For a given integer n=p1α1p2α2⋯pkαk$n = p_1^{\alpha _1 } p_2^{\alpha _2 } \cdots p_k^{\alpha _k }$ (k ≥ 2), we give here a class of finitely presented finite monoids of order n. Indeed the monoids Mon(π), where π=〈a1,a2,…,ak|aipiαi=ai, (i=1,2,…,k),aiai+
Ahmadi B., Campbell C.M., Doostie H.
doaj +1 more source
Notes on a semigroup related to the dicyclic group Qn
We consider certain properties of the semigroup S defined by the Presentation S = 〈a,b : a2ⁿ⁻¹ = 1,b2 = a2ⁿ⁻², ba = ab2ⁿ⁻¹-1〉, (n ≥ 3).
Sorouhesh Mohammad R., Campbell Colin M.
doaj +1 more source
Background– Pseudomonas aeruginosa (PA) may cause suppurative otitis externa with severe inflammation and ulceration in dogs. Multidrug resistance is commonly reported for this organism, creating a difficult therapeutic challenge. Objective– The aim of this study was to evaluate the in vitro antimicrobial activity of a gel containing 0.5 µg/mL of ...
Giovanni Ghibaudo +6 more
wiley +1 more source
Detection whether a monoid of the form N^n/~M is affine or not
In this study,we consider some types of monoids M such as R − trivial monoid, Brauer type monoid, Bicyclic monoid and matrix monoids called special linear semigroups, SLS(2, 2) and general linear semigroups, GLS(2, 2). We decide whether these monoids Nn/
Belgin Ozer, E. Yilmaz
semanticscholar +1 more source

