Let M be a semifinite von Neumann algebra equipped with a semifinite normal faithful trace τ . Let d be an injective positive measurable operator with respect to (M, τ ) such that d is also measurable. Define Lp(d) = {x ∈ L0(M) : dx+ xd ∈ Lp(M)} and ‖x‖Lp(d) = ‖dx+ xd‖p . We show that for 1 6 p0 < p1 6 ∞, 0 < θ < 1 and α0 > 0, α1 > 0 the interpolation equality (Lp0(d 0), Lp1(d α))θ = Lp(d ) hol...

A process algebra is defined where parallel composition is structured around synchronous communication. Its essential difference with CCS is the hypothesis that internal actions must be observable for the clock; consequently, in our formalism (strong) bisimulation will be the basis for information flow analysis, instead of equivalences based on trace or weak bisimulation. Bisimulation reduces i...

The aim of this work is to investigate mechanical support for process algebra, both for concrete applications and theoretical properties. Two approaches are presented using the verification system PVS. One approach declares process terms as an uninterpreted type and specifies equality on terms by axioms. This is convenient for concrete applications where the rewrite mechanisms of PVS can be exp...

A package for the Sage computer algebra system is developed for checking feasibility of a given intersection array for a distance-regular graph. We use this tool to show that there is no distance-regular graph with intersection array {(2r + 1)(4r + 1)(4t− 1), 8r(4rt− r + 2t), (r + t)(4r + 1); 1, (r + t)(4r + 1), 4r(2r + 1)(4t− 1)} (r, t ≥ 1), {135,128,16; 1,16,120}, {234,165,12; 1,30,198} or {5...

We present a strategy for restricting the application of the inference rule paramodulation. The strategy applies to problems in first-order logic with equality and is designed to prevent paramodulation into subterms of Skolem expressions. A weak completeness result is presented (the functional reflexive axioms are assumed). Experimental results on problems in set theory, combinatory logic, Tars...

This paper describes a software implementation of Byrd and Omojokun’s trust region algorithm for solving nonlinear equality constrained optimization problems. The code is designed for the efficient solution of large problems and provides the user with a variety of linear algebra techniques for solving the subproblems occurring in the algorithm. Second derivative information can be used, but whe...

The aim of this paper is to relate initial algebra semantics and nal coalgebra semantics It is shown how these two approaches to the semantics of programming languages are each others dual and some conditions are given under which they coincide More precisely it is shown how to derive initial semantics from nal semantics using the initiality and nality to ensure their equality Moreover many fac...

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

The Schur polynomials s ? are essential in understanding the representation theory of general linear group. They also describe cohomology ring Grassmannians. For ?=(n,n-1,?,1) a staircase shape and ??? subpartition, Stembridge equality states that ?/? =s T . This provides information about symmetry ring. stable Grothendieck G , dual g developed by Buch, Lam, Pylyavskyy, variants K-theory Using ...

After introducing double derivations of $n$-Lie algebra $L$ we‎ ‎describe the relationship between the algebra $mathcal D(L)$ of double derivations and the usual‎ ‎derivation Lie algebra $mathcal Der(L)$‎. ‎In particular‎, ‎we prove that the inner derivation algebra $ad(L)$‎ ‎is an ideal of the double derivation algebra $mathcal D(L)$; we also show that if $L$ is a perfect $n$-Lie algebra‎ ‎wit...