Results 181 to 190 of about 866 (222)

Constructing Number Field Isomorphisms from *-Isomorphisms of Certain Crossed Product C*-Algebras. [PDF]

Commun Math Phys
Bruce C, Takeishi T.
europepmc   +1 more source

Structured Dynamics in the Algorithmic Agent. [PDF]

Entropy (Basel)
Ruffini G, Castaldo F, Vohryzek J.
europepmc   +1 more source

Embedding of Markov matrices for d ⩽ 4. [PDF]

J Math Biol
Baake M, Sumner J.
europepmc   +1 more source

On the work performed by a transformation semigroup. [PDF]

Australas. J Comb., 2011
A (partial) transformation α on the finite set {1,...,n} moves an element i of its domain a distance of |i − iα| units. The work w(α) performed by α is the sum of all of these distances. We derive formulae for the total work w(S) = α∈S w(α) performed by various semigroups S of (partial) transformations.
East, James, McNamara, Peter J.
openaire   +3 more sources

On the skeleton of a finite transformation semigroup.

, 2010
Summary: There are many ways to construct hierarchical decompositions of transformation semigroups. The holonomy algorithm is especially suitable for computational implementations and it is used in our software package. The structure of the holonomy decomposition is determined by the action of the semigroup on certain subsets of the state set.
Egri-Nagy, Attila, Nehaniv, Chrystopher L.   +1 more
openaire   +3 more sources

A presentation for the singular part of the full transformation semigroup

Semigroup Forum, 2010
The (full) transformation semigroup Tn is the semigroup of all functions from the finite set {1, . . . , n} to itself, under the operation of composition. The symmetric group Sn ⊆ Tn is the group of all permutations on {1, . . .
James East
exaly   +2 more sources

The product of the idempotents and an $\mathcal{H}$ -class of the finite full transformation semigroup

Semigroup Forum, 2012
We investigate the set products S=EH, where E is the set of idempotents of a finite full transformation semigroup T X and H is an arbitrary H-class of T X. We show that S is a semigroup and is a union of H-classes of T X.
Higgins Peter M
exaly   +2 more sources

Involution matchings, the semigroup of orientation-preserving and orientation-reversing mappings, and inverse covers of the full transformation semigroup [PDF]

Semigroup Forum, 2019
We continue the study of permutations of a fi nite regular semigroup that map each element to one of its inverses, providing a complete description in the case of semigroups whose idempotent generated subsemigroup is a union of groups.
Higgins Peter M
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

On Factorisations and Generators in Transformation Semigroups

Semigroup Forum, 2004
A cycle-style notation is introduced for members of the full transformation semigroup similar to that used by Lipscomb for partial one-to-one maps. This approach is used to study generating sets of the submonoids \(T_{n,r}\) of \(T_n\) consisting of the union of the symmetric group and the ideal of all mappings with range of cardinality no greater than
Ayik G., Ayik H., Howie J.M.
openaire   +3 more sources

A property of transformation semigroups

Semigroup Forum, 2012
Let \(S\) be a semigroup. For \(a,b\in S\) we write \(a\leq b\) if \(a=xb=by\) and \(xa=a\) for some \(x,y\in S^1\). The author calls \(S\) right (left) quasiresiduated if for any \(a,b\in S\) there exists \(x\in S\) such that \(ax\leq b\) (resp. \(xa\leq b\)). If \(S\) has a zero element it makes sense to require that all \(a,b\) and \(x\) are nonzero.
openaire   +3 more sources