in this paper, we introduce the notion of multiplier in -algebra and study relationships between multipliers and some special mappings, likeness closure operators, homomorphisms and ( -derivations in -algebras. we introduce the concept of idempotent multipliers in bl-algebra and weak congruence and obtain an interconnection between idempotent multipliers and weak congruences. also, we introduce...

We propose a secret sharing scheme based on rings or modules that admit a decomposition given by orthogonal idempotents of the ring. The secret is decomposed into partial secrets that belong to the projections induced by every idempotent. These projections are indeed ideal codes and thus the subsecrets are distributed among a group of users using the generator matrix of these ideal codes.

In this paper, we describe finite, additively commutative, congruence simple semirings. The main result is that the only such semirings are those of order 2, zeromultiplication rings of prime order, matrix rings over finite fields, and those that are additively idempotent.

In this paper, we describe finite, additively commutative, congruence simple semirings. The main result is that the only such semirings are those of order 2, zeromultiplication rings of prime order, matrix rings over finite fields, ones with trivial addition and those that are additively idempotent.

Let K be an arbitrary field and X a square matrix over K. Then X is sum of two square nilpotent matrices over K if and only if, for every algebraic extension L of K and arbitrary nonzero α ∈ L, there exist idempotent matrices P 1 and P 2 over L such that X = αP 1 - αP 2.

A dynamical system which is described in terms of an idempotent algebra by means of a vector equation with random irreducible matrix is considered. An approach based on approximation of the matrix of the system by means of matrices of simple structure is applied to evaluate bounds on the mean rate of growth of the state vector of the system. The process of constructing the approximations is red...

In this paper we consider Idempotent Functional Analysis, an 'abstract' version of Idempotent Analysis developed by V. P. Maslov and his collaborators. We give a review of the basic ideas of Idempotent Analysis. The correspondence between concepts and theorems of the traditional Functional Analysis and its idempotent version is discussed; this correspondence is similar to N. Bohr's corresponden...

Let S be a double occurrence word, and let MS be the word’s interlacement matrix, regarded as a matrix over GF (2). Gauss addressed the question of which double occurrence words are realizable by generic closed curves in the plane. We reformulate answers given by Rosenstiehl and by de Fraysseix and Ossona de Mendez to give new graph-theoretic and algebraic characterizations of realizable words....

A linear relation E acting on a Hilbert space is idempotent if E2=E. triplet of subspaces needed to characterize given idempotent: (ranE,ran(I−E),domE), or equivalently, (ker⁡(I−E),ker⁡E,mulE). The relations satisfying the inclusions E2⊆E (sub-idempotent) E⊆E2 (super-idempotent) play an important role. Lastly, adjoint and closure are studied.