Results 41 to 50 of about 23,472 (227)

Cayley automaton semigroups [PDF]

open access: yes, 2015
Let S be a semigroup, C(S) the automaton constructed from the right Cayley graph of S with respect to all of S as the generating set and ∑(C(S)) the automaton semigroup constructed from C(S). Such semigroups are termed Cayley automaton semigroups. For
McLeman, Alexander Lewis Andrew
core   +2 more sources

On transformation semigroups which are ℬ𝒬-semigroups

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2006
A semigroup whose bi-ideals and quasi-ideals coincide is called a ℬ𝒬-semigroup. The full transformation semigroup on a set X and the semigroup of all linear transformations of a vector space V over a field F into itself are denoted, respectively, by T(X)
S. Nenthein, Y. Kemprasit
doaj   +1 more source

On the closure of the extended bicyclic semigroup

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2013
In the paper we study the semigroup $\mathcal{C}_{\mathbb{Z}}$ which is a generalization of the bicyclic semigroup. We describe main algebraic properties of the semigroup $\mathcal{C}_{\mathbb{Z}}$ and prove that every non-trivial congruence $\mathbb{C}$
I. R. Fihel, O. V. Gutik
doaj   +1 more source

Frequently Hypercyclic and Chaotic Behavior of Some First-Order Partial Differential Equation

open access: yesAbstract and Applied Analysis, 2013
We study a particular first-order partial differential equation which arisen from a biologic model. We found that the solution semigroup of this partial differential equation is a frequently hypercyclic semigroup.
Cheng-Hung Hung, Yu-Hsien Chang
doaj   +1 more source

NEUTROSOPHIC RINGS [PDF]

open access: yes, 2006
In this book we define the new notion of neutrosophic rings. The motivation for this study is two-fold. Firstly, the classes of neutrosophic rings defined in this book are generalization of the two well-known classes of rings: group rings and semigroup ...
Vasantha, Kandasamy   +2 more
core   +1 more source

Maximal subgroups of free idempotent-generated semigroups over the full transformation monoid [PDF]

open access: yes, 2011
Let Tn be the full transformation semigroup of all mappings from the set {1, . . . , n} to itself under composition. Let E = E(Tn) denote the set of idempotents of Tn and let e ∈ E be an arbitrary idempotent satisfying |im (e)| = r ≤ n − 2. We prove that
Ruskuc, N.   +3 more
core   +1 more source

On Characterization of Relatively Commutative Semigroups

open access: yesCommunications in Advanced Mathematical Sciences
This paper defines a novel semigroup construction, called a relatively commutative semigroup. A semigroup is called relatively commutative if there exist $k,r,t,s\in \mathbb{Z^{+}}$ and $x,y\in S$ such that $(ab)^{k}=b^{r}ax$ and $(ab)^{t}=yba^{s}$ for ...
Rasie Mekera, Didem Yeşil
doaj   +1 more source

F-semigroups

open access: yesAlgebra and discrete mathematics, 2007
A semigroup S is called F- semigroup if there exists a group-congruence ?? on S such that every ??-class contains a greatest element with respect to the natural partial order ???S of S (see [8]). This generalizes the concept of F-inverse semigroups introduced by V. Wagner [12] and investigated in [7].
Giraldes, E.   +2 more
openaire   +4 more sources

Reductive compactifications of semitopological semigroups

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2003
We consider the enveloping semigroup of a flow generated by the action of a semitopological semigroup on any of its semigroup compactifications and explore the possibility of its being one of the known semigroup compactifications again.
Abdolmajid Fattahi   +2 more
doaj   +1 more source

On the algebraic invariants of certain affine semigroup rings

open access: yes, 2023
Let a and d be two linearly independent vectors in N2, over the field of rational numbers. For a positive integer k≥ 2 , consider the sequence a, a+ d, … , a+ kd such that the affine semigroup Sa,d,k= ⟨ a, a+ d, … , a+ kd⟩ is minimally generated.
Sengupta, Indranath   +1 more
core   +1 more source

Home - About - Disclaimer - Privacy