We show that idempotent states on finite quantum groups correspond to pre-subgroups in the sense of Baaj, Blanchard, and Skandalis. It follows that the lattices formed by the idempotent states on a finite quantum group and by its coidalgebras are isomorphic. We show furthermore that these lattices are also isomorphic for compact quantum groups, if one restricts to expected coidalgebras.

Let A be a nonnegative idempotent matrix. It is shown that the Schur complement of a submatrix, using the Moore-Penrose inverse, is a nonnegative idempotent matrix if the submatrix has a positive diagonal. Similar results for the Schur complement of any submatrix of A are no longer true in general.

A categorical equivalence between algebraic contexts with relational morphisms and join-semilattices with homomorphisms is presented and extended to idempotent semirings and domain semirings. These contexts are the Kripke structures for idempotent semirings and allow more efficient computations on finite models because they can be logarithmically smaller than the original semiring. Some example...

Let A be a nonnegative idempotent matrix. It is shown that the Schur complement of a submatrix, using the Moore-Penrose inverse, is a nonnegative idempotent matrix if the submatrix has a positive diagonal. Similar results for the Schur complement of any submatrix of A are no longer true in general.

We show that AI–matching (AI denotes the theory of an associative and idempotent function symbol), which is solving matching word equations in free idempotent semigroups, is NP-complete. Note: this is a full version of the paper [9] and a revision of [8].

This article answers three questions of J. Almeida. Using combinatorial, algebraic and topological methods, we compute joins involving the pseudovariety of finite groups, the pseudovariety of semigroups in which each idempotent is a right zero and the pseudovariety generated by monoids M such that each idempotent of M\{1} is a left zero.

In this paper we establish the existance of S-idempotents in case of loop rings ZtLn(m) for a special class of loops Ln(m); over the ring of modulo integers Zt for a specific value of t.These loops satisfy the conditions g 2 i = 1 for every gi ∈ Ln(m). We prove ZtLn(m) has an S-idempotent when t is a perfect number or when t is of the form 2p or 3p (where p is an odd prime) or in general when t...

Considering probability theory in which the semifield of positive real numbers is replaced by the idempotent semifield of real numbers (union infinity) endowed with the min and plus laws leads to a new formalism for optimization. Probability measures correspond to minimums of functions that we call cost measures, whereas random variables correspond to constraints on these optimization problems ...

Valuation based systems verifying an idem-potent property are studied. A partial order is deened between the valuations giving them a lattice structure. Then, two diierent strategies are introduced to represent valuations: as innmum of the most informative valuations or as supremum of the least informative ones. It is studied how to carry out computations with both representations in an eecient...

In this paper we provide two axiomatizations of the class of idempotent discrete uninorms as conservative binary operations, where an operation is conservative if it always outputs one of its input values. More precisely we first show that the idempotent discrete uninorms are exactly those operations that are conservative, symmetric, and nondecreasing in each variable. Then we show that, in thi...