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...

Based on a study of the 2-category of weak distributive laws, we describe a method of iterating Street’s weak wreath product construction. That is, for any 2-category K and for any non-negative integer n, we introduce 2-categories Wdl(K), of (n + 1)-tuples of monads in K pairwise related by weak distributive laws obeying the Yang-Baxter equation. The first instance Wdl(K) coincides with Mnd(K),...

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...

begin{abstract} the relations between the spectrum of the matrix $q+r$ and the spectra of the matrices $(gamma + delta)q+(alpha + beta)r-qr-rq$, $qr-rq$, $alpha beta r-qrq$, $alpha rqr-(qr)^{2}$, and $beta r-qr$ have been given on condition that the matrix $q+r$ is diagonalizable, where $q$, $r$ are ${alpha, beta}$-quadratic matrix and ${gamma, delta}$-quadratic matrix, respectively, of order $...

Because they play a role in our understanding of the symmetric group algebra, Lie idempotents have received considerable attention. The Klyachko idempotent has attracted interest from combinatorialists, partly because its definition involves the major index of permutations. For the symmetric group Sn, we look at the symmetric group algebra with coefficients from the field of rational functions ...

One-parameter semigroups of antitriangle idempotent supermatrices and corresponding superoperator semigroups are introduced and investigated. It is shown that t-linear idempotent superoperators and exponential superoperators are mutually dual in some sense, and the first gives additional to exponential solution to the initial Cauchy problem. The corresponding functional equation and analog of r...