defined on n-tuples of commuting elements of G and invariant under simultaneous conjugation. Thus, in [HKR00] the study of nth Morava E-theory at a prime p leads to χ(g1, ..., gn) defined on gi of p-power order. On the other hand, the construction of equivariant elliptic cohomology in [Dev96] (which corresponds to n = 2) uses functions χ(g1, g2) as above but without restrictions on the order. T...

We introduce a family of MDP reduced models characterized by two parameters: the maximum number of primary outcomes per action that are fully accounted for and the maximum number of occurrences of the remaining exceptional outcomes that are planned for in advance. Reduced models can be solved much faster using heuristic search algorithms such as LAO*, benefiting from the dramatic reduction in t...

In this paper, we state some results on product of operators with closed ranges and we solve the operator equation $TXS^*-SX^*T^*= A$ in the general setting of the adjointable operators between Hilbert $C^*$-modules, when $TS = 1$. Furthermore, by using some block operator matrix techniques, we nd explicit solution of the operator equation $TXS^*-SX^*T^*= A$.

‎in this paper we try to extend geometric concepts in the context of operator valued tensors‎. ‎to this end‎, ‎we aim to replace the field of scalars $ mathbb{r} $ by self-adjoint elements of a commutative $ c^star $-algebra‎, ‎and reach an appropriate generalization of geometrical concepts on manifolds‎. ‎first‎, ‎we put forward the concept of operator-valued tensors and extend semi-riemannian...

The work investigates the powerlocales (lower, upper, Vietoris) of localic completions of generalized metric spaces. The main result is that all three are localic completions of generalized metric powerspaces, on the Kuratowski finite powerset. Applications: (1) A localic completion is always open, and is compact iff its generalized metric space is totally bounded. (2) The Heine-Borel Theorem i...

We present a coalgebraic approach to trace equivalence semantics based on lifting behaviour endofunctors for deterministic action to Kleisli categories of monads for non-deterministic choice. In Set , this gives a category with ordinary transition systems as objects and with morphisms characterised in terms of a linear notion of bisimulation. The final object in this category is the canonical a...

Cantor’s proof that the powerset of the set of all natural numbers is uncountable yields a version of Richard’s paradox when restricted to the full definable universe, that is, to the universe containing all objects that can be defined not just in one formal language but by means of the full expressive power of natural language: this universe seems to be countable on one account and uncountable...

Composing various powerset functors with the term monad gives rise to the concept of generalised terms. This in turn provides a technique for handling many-valued sets of terms in a framework of variable substitutions, thus being the prerequisite for categorical unification in many-valued logic programming using an extended notion of terms. As constructions of monads involve complicated calcula...

In an earlier paper, the author used derivatives to construct a deterministic automaton recognizing the language defined by an ω-regular expression. The construction was related to a determinization method invented by Safra. This paper describes a new construction, inspired by Piterman’s improvement to Safra’s method. It produces an automaton with fewer states. In addition, the presentation and...

A coalgebraic definition of finite and infinite trace semantics for probabilistic transition systems has recently been given using a certain Kleisli category. In this paper this semantics is developed using a coalgebraic method which is an instance of general determinization. Once applied to discrete systems, this point of view allows the exploitation of the determinized structure by up-to tech...