相关论文: Unique Parallel Decomposition for the Pi-calculus
We introduce a backward stable algorithm for computing the CS decomposition of a partitioned $2n \times n$ matrix with orthonormal columns, or a rank-deficient partial isometry. The algorithm computes two $n \times n$ polar decompositions…
Production-quality parallel applications are often a mixture of diverse operations, such as computation- and communication-intensive, regular and irregular, tightly coupled and loosely linked operations. In conventional construction of…
The Asynchronous pi-calculus, as recently proposed by Boudol and, independently, by Honda and Tokoro, is a subset of the pi-calculus which contains no explicit operators for choice and output-prefixing. The communication mechanism of this…
We apply the topology of convergence on compact sets to define unpredictable functions [5, 6]. The topology is metrizable and easy for applications with integral operators. To demonstrate the effectiveness of the approach, the existence and…
For a cellular algebra $\A$ with a cellular basis $\ZC$, we consider a decomposition of the unit element $1_\A$ into orthogonal idempotents (not necessary primitive) satisfying some conditions. By using this decomposition, the cellular…
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems,…
We give a generalization of the Jordan canonical form theorem for a class of bounded linear operators on complex separable Hilbert spaces in terms of direct integrals. Precisely, we study the uniqueness of strongly irreducible…
We develop a (co)algebraic framework to study a family of process calculi with monadic branching structures and recursion operators. Our framework features a uniform semantics of process terms and a complete axiomatisation of semantic…
In this note we give a precise statement and a detailed proof for reconstruction problem of weak bialgebra maps. As an application we characterize indecomposability of weak algebras in categorical setting.
The Cylindrical Algebraic Decomposition (CAD) algorithm is a comprehensive tool to perform quantifier elimination over real closed fields. CAD has doubly exponential running time, making it infeasible for practical purposes. We propose to…
We consider a large class of deformations of continuous and discrete biorthogonal ensembles and investigate their behavior in the limit of a large number of particles. We provide sufficient conditions to ensure that if a biorthogonal…
We show that the unit ball of a full Hilbert $C^*$-module is sequentially compact in a certain weak topology if and only if the underlying $C^*$-algebra is finite dimensional. This provides an answer to the question posed in J.…
We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the…
A famous result by Milner is that the lambda-calculus can be simulated inside the pi-calculus. This simulation, however, holds only modulo strong bisimilarity on processes, i.e. there is a slight mismatch between beta-reduction and how it…
We study positive subunital maps on ordered effect spaces and introduce the defect $d(T) = u - T(u)$, which satisfies a cocycle identity under composition. Using only this identity and elementary order-theoretic arguments -- requiring no…
We prove that unital graph C*-algebras often admit a convenient decomposition into amalgamated free products. We use this to give a complete characterization of when a unital graph C*-algebra is residually finite-dimensional and when it is…
The following numerical control over the topological equivalence is proved: two complex polynomials in $n\not= 3$ variables and with isolated singularities are topologically equivalent if one deforms into the other by a continuous family of…
In this paper, we test and extend a proposal of Gu, Pei, and Zhang for an application of decomposition to three-dimensional theories with one-form symmetries and to quantum K theory. The theories themselves do not decompose, but, OPEs of…
This article investigates the phenomenon of maximal rigidity in spatial processes, where perfect interpolation of the process is possible from partial information, specifically, from its restriction to a strict subdomain, often resulting in…
Psi-calculi is a parametric framework for extensions of the pi-calculus with data terms and arbitrary logics. In this framework there is no direct way to represent action priorities, where an action can execute only if all other enabled…