Results 191 to 200 of about 1,026,932 (240)
Some of the next articles are maybe not open access.
Maximal subgroups of amalgams of finite inverse semigroups
, 2013We use the description of the Schützenberger automata for amalgams of finite inverse semigroups given by Cherubini et al. (J. Algebra 285:706–725, 2005) to obtain structural results for such amalgams.
A. Cherubini, T. Jajcayová, E. Rodaro
semanticscholar +1 more source
1995
Abstract In planning the chapter on inverse semigroups the main problem has been one of selection. As long ago as 1961, Clifford and Preston offered the opinion that inverse semigroups were the most promising class of semigroups for future study, and the intervening years have amply justified their forecast.
openaire +1 more source
Abstract In planning the chapter on inverse semigroups the main problem has been one of selection. As long ago as 1961, Clifford and Preston offered the opinion that inverse semigroups were the most promising class of semigroups for future study, and the intervening years have amply justified their forecast.
openaire +1 more source
Normally Ordered Inverse Semigroups
Semigroup Forum, 1998Let \(S\) be an inverse semigroup and \(E\) the set of its idempotents. Suppose that there exists a partial order \(\ll\) on \(E\) such that two idempotents are \(\ll\)-comparable if and only if they belong to the same \(\mathcal J\)-class of \(S\) and, for all \(s\in S\) and \(e,f\in Ess^{-1}\), \(e\ll f\) implies \(s^{-1}es\ll s^{-1}fs\).
openaire +2 more sources
RELATIVELY FREE INVERSE SEMIGROUPS
The Quarterly Journal of Mathematics, 1986In [Trans. Am. Math. Soc. 294, 243--262 (1986; Zbl 0602.20052)] \textit{N. R. Reilly} and the author studied the semigroups in the title, with respect to such properties as being E-unitary, fundamental, combinatorial and completely semisimple. This paper continues that study. Let \(\mathcal V\) be a variety of inverse semigroups: then \(F\mathcal V_X\)
openaire +2 more sources
Inverse Near Permutation Semigroups
Semigroup Forum, 2004The symbol \({\mathcal T}_N\) denotes the semigroup, under composition, of all selfmaps of a set \(X\) with \(N\) elements. The `rank' of an element \(\alpha\in{\mathcal T}_N\) is defined to be \(|X\alpha|\). A subsemigroup of \({\mathcal T}_N\) is defined to be a `near permutation semigroup' if it is generated by a group \(G\) of permutations together
openaire +2 more sources
Proceedings of the London Mathematical Society, 1971
McFadden, R., O'Carroll, L.
openaire +1 more source
McFadden, R., O'Carroll, L.
openaire +1 more source
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly
Semigroups Admitting Relative Inverses
The Annals of Mathematics, 1941Not ...
openaire +1 more source

