A game is considered where the communication network of the first player is explicitly modeled. The second player may induce delays in this network, while the first player may counteract such actions. Costs are modeled through expectations over idempotent probability measures. The idempotent probabilities are conditioned by observational data, the arrival of which may have been delayed along th...

In this paper we investigate the atomic level in the lattice of subvarieties of residuated lattices. In particular, we give infinitely many commutative atoms and construct continuum many non-commutative, representable atoms that satisfy the idempotent law; this answers Problem 8.6 of [12]. Moreover, we show that there are only two commutative idempotent atoms and only two cancellative atoms. Fi...

Idempotent integration is an analogue of the Lebesgue integration where σ-additive measures are replaced by σ-maxitive measures. It has proved useful in many areas of mathematics such as fuzzy set theory, optimization, idempotent analysis, large deviation theory, or extreme value theory. Existence of Radon–Nikodym derivatives, which turns out to be crucial in all of these applications, was prov...

We consider subsemimodules and convex subsets of semimodules over semirings with an idempotent addition. We introduce a nonlinear projection on subsemimodules: the projection of a point is the maximal approximation from below of the point in the subsemimodule. We use this projection to separate a point from a convex set. We also show that the projection minimizes the analogue of Hilbert’s proje...

Theorem 1.1. Let A be a semisimple complex Banach algebra with the following properties: (i) for every closed right ideal R in A, there exists a closed left ideal L such that R∩L= {0} and R+ L= A (each a∈ A can be written in the form a= a1 + a2 with a1 ∈ R, a2 ∈ L); (ii) if a,b in A are such that ab = ba= 0, then ‖a+ b‖2 = ‖a‖2 +‖b‖2. Then A is a commutative proper H∗-algebra [1]. It is easy to...

Together with a characteristic function, idempotent permutations uniquely determine idempotent maps, as well as their linearly ordered arrangement simultaneously. Furthermore, in-place linear time transformations are possible between them. Hence, they may be important for succinct data structures, information storing, sorting and searching. In this study, their combinatorial interpretation is g...

It is shown that there a close relationship between ideal extensions of rings and trusses, is, sets with semigroup operation distributing over ternary abelian heap operation. Specifically, truss can be associated to every element an extension ring projects down idempotent in the extending ring; weak equivalence yields isomorphism corresponding trusses. Furthermore, classes by integers are one-t...