Results 11 to 20 of about 6,505,496 (165)

Beyond Regular Semigroups [PDF]

open access: yes, 2012
The topic of this thesis is the class of weakly U-abundant semigroups. This class is very wide, containing inverse, orthodox, regular, ample, adequate, quasi-adequate, concordant, abundant, restriction, Ehresmann and weakly abundant semigroups.
Wang, Yanhui
core   +6 more sources

Convolution semigroups of states. [PDF]

open access: yes, 2011
Convolution semigroups of states on a quantum group form the natural noncommutative analogue of convolution semigroups of probability measures on a locally compact group.
Lindsay, Martin, Skalski, Adam G.
core   +4 more sources

Automatic presentations for semigroups [PDF]

open access: yes, 2009
Special Issue: 2nd International Conference on Language and Automata Theory and Applications (LATA 2008)This paper applies the concept of FA-presentable structures to semigroups.
Oliver, Graham   +4 more
core   +2 more sources

On groups generated by involutions of a semigroup

open access: yesJournal of Algebra, 2016
An involution on a semigroup S (or any algebra with an underlying associative binary operation) is a function f:S->S that satisfies f(xy)=f(y)f(x) and f(f(x))=x for all x,y in S. The set I(S) of all such involutions on S generates a subgroup C(S)= of the symmetric group Sym(S) on the set S.
East, James (R16839), Nordahl, Thomas E.
openaire   +3 more sources

DIVISIBILITY TESTS FOR SMARANDACHE SEMIGROUPS [PDF]

open access: yes, 2002
Two Divisibility Tests for Smarandache semigroups are given. Further, the notion of divisibility of elements in a semigroup is applied to characterize the Smarandache semigroups.
Rao, Chandra Sekhar
core   +1 more source

Well-bounded semigroups in connected groups [PDF]

open access: yes, 1977
Poguntke D. Well-bounded semigroups in connected groups. Semigroup Forum.
Poguntke, Detlev, Detlev Poguntke
core   +1 more source

Groups that together with any transformation generate regular semigroups or idempotent generated semigroups

open access: yesJournal of Algebra, 2011
Let $a$ be a non-invertible transformation of a finite set and let $G$ be a group of permutations on that same set. Then $\genset{G, a}\setminus G$ is a subsemigroup, consisting of all non-invertible transformations, in the semigroup generated by $G$ and $a$.
Araújo, J.   +2 more
openaire   +2 more sources

A photon transport problem with a time-dependent point source [PDF]

open access: yes, 2009
We consider a time-dependent problem of photon transport in an interstellar cloud with a point photon source modeled by a Dirac δ functional. The existence of a unique distributional solution to this problem is established by using the theory of ...
McBride, A.C.   +2 more
core   +4 more sources

Two generalizations of homogeneity in groups with applications to regular semigroups

open access: yesTransactions of the American Mathematical Society, 2015
Let X X be a finite set such that
Araújo, João, Cameron, Peter J.
openaire   +2 more sources

A generic algorithm for the word problem in semigroups and groups

open access: yesJournal of Physics: Conference Series, 2020
Abstract Kapovich, Myasnikov, Schupp and Shpilrain in 2003 developed generic approach to algorithmic problems, which considers an algorithmic problem on “most” of the inputs instead of the entire domain and ignores it on the rest of inputs.
openaire   +1 more source

Home - About - Disclaimer - Privacy