Results 11 to 20 of about 7,471 (180)

Weakly Idempotent Lattices and Bilattices, Non-Idempotent Plonka Functions

open access: yesDemonstratio Mathematica, 2015
In this paper, we study weakly idempotent lattices with an additional interlaced operation. We characterize interlacity of a weakly idempotent semilattice operation, using the concept of hyperidentity and prove that a weakly idempotent bilattice with an ...
Davidova D. S., Movsisyan Yu. M.
doaj   +2 more sources

Abundant semigroups with medial idempotents [PDF]

open access: yesCategories and General Algebraic Structures with Applications, 2021
The effect of the existence of a medial or related idempotent in any abundant semigroup is the subject of this paper. The aim is to naturally order any abundant semigroup $S$ which contains an ample multiplicative medial idempotent $u$ in a way that ...
Abdulsalam El-Qallali
doaj   +1 more source

Characterization of pre-idempotent Copulas

open access: yesDependence Modeling, 2023
Copulas CC for which (CtC)2=CtC{({C}^{t}C)}^{2}={C}^{t}C are called pre-idempotent copulas, of which well-studied examples are idempotent copulas and complete dependence copulas.
Chamnan Wongtawan, Sumetkijakan Songkiat
doaj   +1 more source

On Idempotent Units in Commutative Group Rings

open access: yesSakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2020
Special elements as units, which are defined utilizing idempotent elements, have a very crucial place in a commutative group ring. As a remark, we note that an element is said to be idempotent if r^2=r in a ring. For a group ring RG, idempotent units are
Ömer Küsmüş
doaj   +1 more source

Idempotent linear relations [PDF]

open access: yes, 2022
A linear relation E acting on a Hilbert space is idempotent if E2=E. A triplet of subspaces is needed to characterize a given idempotent: (ranE,ran(I−E),domE), or equivalently, (ker⁡(I−E),ker⁡E,mulE).
Alejandra Maestripieri   +7 more
core   +1 more source

Idempotent structures in optimization [PDF]

open access: yes, 2001
Consider the set A = R ∪ {+∞} with the binary operations o1 = max and o2 = + and denote by An the set of vectors v = (v1,...,vn) with entries in A. Let the generalised sum u o1 v of two vectors denote the vector with entries uj o1 vj , and the product
Kolokoltsov, V. N. (Vasiliĭ Nikitich)
core   +1 more source

Invariant idempotent measures

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2018
The idempotent mathematics is a part of mathematics in which arithmetic operations in the reals are replaced by idempotent operations. In the idempotent mathematics, the notion of idempotent measure (Maslov measure) is a counterpart of the notion of ...
N. Mazurenko, M. Zarichnyi
doaj   +1 more source

On maximal subgroups of free idempotent generated semigroups [PDF]

open access: yes, 2011
We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite semigroup.
Ruskuc, N.   +6 more
core   +1 more source

Every group is a maximal subgroup of the free idempotent generated semigroup over a band [PDF]

open access: yes, 2013
Given an arbitrary group G we construct a semigroup of idempotents (band) BG with the property that the free idempotent generated semigroup over BG has a maximal subgroup isomorphic to G. If G is finitely presented then BG is finite. This answers several
Ruskuc, Nik   +6 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.   +4 more
core   +1 more source

Home - About - Disclaimer - Privacy