Results 11 to 20 of about 7,267 (222)
AxiomsThe explicit forms of idempotent and semicentral idempotent triangular matrices over an additively idempotent semiring are obtained. We define a diamond composition of idempotents and give a representation of an idempotent n×n matrix as an (n−1)th degree
Dimitrinka Vladeva
doaj +4 more sources
Idempotent Turing Machines [PDF]
, 2021 A function f is said to be idempotent if f(f(x)) = f(x) holds whenever f(x) is defined. This paper presents a computation model for idempotent functions, called an idempotent Turing machine.
Nakano, Keisuke
core +1 more source
On the Idempotents of Hecke Algebras [PDF]
Letters in Mathematical Physics, 2008 11 ...
Isaev, A. P. +2 more
openaire +2 more sources
Idempotent structures in optimization [PDF]
, 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
On maximal subgroups of free idempotent generated semigroups [PDF]
, 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. +5 more
core +1 more source
Every group is a maximal subgroup of the free idempotent generated semigroup over a band [PDF]
, 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 +3 more
core +1 more source
Maximal subgroups of free idempotent-generated semigroups over the full transformation monoid [PDF]
, 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. +3 more
core +1 more source
, 2022 In this paper is to introduce the notion of weak idempotent rings as a generalization of Boolean like rings. We obtain many formal properties of the class of weak idempotent rings and furnish certain examples of the class of weak idempotent rings ...
Abebaw, Tilahun +3 more
core +1 more source
Small idempotent clones. I [PDF]
, 1991 summary:G. Grätzer and A. Kisielewicz devoted one section of their survey paper concerning $p_n$-sequences and free spectra of algebras to the topic “Small idempotent clones” (see Section 6 of [18]). Many authors, e.g., [8], [14, 15], [22], [25] and [29,
Dudek, Józef, Józef Dudek
core +1 more source
Projective Essential Idempotents
IEEE Transactions on Information Theory, 2023 This paper introduces the concept of projective essential idempotents. These are primitive central idempotents in a twisted group algebra. The first main result provides conditions for the existence of them. In the second main result, we prove that every $q$-ary simplex code can be seen as an ideal of a twisted group algebra generated by a projective ...
openaire +1 more source