Results 21 to 30 of about 298 (187)

On groups generated by involutions of a semigroup

Journal 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

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

Journal 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., Mitchell, J.D., Schneider, Csaba   +2 more
openaire   +2 more sources

Nonlinear Markov semigroups and interacting Lévy type processes [PDF]

, 2007
Semigroups of positivity preserving linear operators on measures of a measurable space X describe the evolutions of probability distributions of Markov processes on X.
Kolokoltsov, V. N. (Vasiliĭ Nikitich)
core   +1 more source

Generalized $F$-semigroups [PDF]

, 2005
summary:A semigroup $S$ is called a generalized $F$-semigroup if there exists a group congruence on $S$ such that the identity class contains a greatest element with respect to the natural partial order $\le _{S}$ of $S$. Using the concept of an anticone,
Giraldes, E., Mitsch, H., Marques-Smith, P.   +2 more
core   +1 more source

Computing in permutation groups without memory [PDF]

, 2013
Funding: UK Engineering and Physical Sciences Research Council (EP/K033956/1)Memoryless computation is a new technique to compute any function of a set of registers by updating one register at a time while using no memory.
Maximilien Gadouleau, Cameron, P., Gadouleau, Maximilien, Cameron, Peter Jephson, Gadouleau, M., Cameron, Peter, Fairbairn, Ben, Cameron, P.J., Peter J. Cameron, Ben Fairbairn, Gadoleau, M.   +10 more
core   +1 more source

Smarandache Fuzzy Algebra [PDF]

, 2003
groupoid semi group semigroup group loop group groupoid semigroup loop semi group group ...
Vasantha, Kandasamy, W. B. Vasantha Kandasamy, Kandasamy, Vasantha   +2 more
core   +1 more source

Two generalizations of homogeneity in groups with applications to regular semigroups

Transactions 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

The Concentration Function Problem for Locally Compact Groups Revisited: Nondissipating Space-Time Random Walks, -Decomposable Laws, and Their Continuous Time Analogues

Journal of Mathematics, 2013
The concentration function problem for locally compact groups is concerned with the structure of groups admitting adapted nondissipating random walks.
Wilfried Hazod
doaj   +1 more source

Optimization Problems with Cone Constraints in Groups and Semigroups: An Approach Based on Image Space Analysis

, 2023
In this paper, a class of optimization problems with cone constraints in groups and semigroups is investigated by exploiting the image space analysis.
Mastroeni G., Li J.
core   +1 more source

On semigroups generated by subelliptic operators on homogeneous groups [PDF]

Colloquium Mathematicum, 1993
Let \(L\) be a positive Rockland operator on a homogeneous Lie group \(G\), i.e., a positive symmetric left-invariant hypoelliptic homogeneous differential operator. Let \(p_z\), \(\text{Re } z> 0\), be the kernel of the holomorphic semigroup \(T_z\), \(\text{Re }z> 0\), generated by \(\overline L\). Then \(p_z\) belongs to the Schwartz space according
openaire   +1 more source