Related papers: Convolution and Concurrency
We introduce a new version $kk^{\rm alg}$ of bivariant $K$-theory that is defined on the category of all locally convex algebras. A motivating example is the Weyl algebra $W$, i.e. the algebra generated by two elements satisfying the…
We consider all 16 unary operations that, given a homogeneous binary relation R, define a new one by a boolean combination of xRy and yRx. Operations can be composed, and connected by pointwise-defined logical junctors. We consider the…
We consider Kleene and Stone algebras defined on the completion DM(RS) of the ordered set of rough sets induced by a reflexive relation. We focus on cases where the completion forms a spatial and completely distributive lattice. We derive…
We give a category theoretic approach to several known equivalences from (classic) tilting theory and commutative algebra. Furthermore, we apply our main results to establish a duality theory for relative Cohen-Macaulay modules in the sense…
We first propose algorithms for checking language equivalence of finite automata over a large alphabet. We use symbolic automata, where the transition function is compactly represented using a (multi-terminal) binary decision diagrams…
Automata operating on pairs of words were introduced as an alternative way of capturing acceptance of regular $\omega$-languages. Families of DFAs and lasso automata operating on such pairs followed, giving rise to minimisation algorithms,…
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…
Q-systems first appeared in the analysis of the Bethe equations for the XXX-model and generalized Heisenberg spin chains. Such systems are known to exist for any simple Lie algebra and many other Kac-Moody algebras. We formulate the…
We introduce partially observable concurrent Kleene algebra (POCKA), an algebraic framework to reason about concurrent programs with control structures, such as conditionals and loops. POCKA enables reasoning about programs that can access…
We present a reflexive tactic for deciding the equational theory of Kleene algebras in the Coq proof assistant. This tactic relies on a careful implementation of efficient finite automata algorithms, so that it solves casual equations…
We consider quantum symmetric algebras, FRT bialgebras and, more generally, intertwining algebras for pairs of Hecke symmetries which represent quantum hom-spaces. The paper makes an attempt to investigate Koszulness and Gorensteinness of…
In this paper we examine how the notion of algebra of quotients for Lie algebras ties up with the corresponding well-known concept in the associative case. Specifically, we completely characterize when a Lie algebra $Q$ is an algebra of…
The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac--Moody algebras. We prove that any binomial coefficient can be written as weighted sums…
Quantum relations in the sense of Weaver are $M'$-bimodules, for a von Neumann algebra $M$, these generalising actual relations on a set $X$ when $M=\ell^\infty(X)$. Similarly, relations between two sets can be generalised as bimodules over…
The quantum-to-classical transition is considered from the point of view of contractions of associative algebras. Various methods and ideas to deal with contractions of associative algebras are discussed that account for a large family of…
Qualitative relationships illustrate how changing one property (e.g., moving velocity) affects another (e.g., kinetic energy) and constitutes a considerable portion of textual knowledge. Current approaches use either semantic parsers to…
In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems. This generalizes both the results of Kleene (on…
Machine Learning classification models learn the relation between input as features and output as a class in order to predict the class for the new given input. Quantum Mechanics (QM) has already shown its effectiveness in many fields and…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
In this paper, we extend properties Going Up and Lying Over from ring theory to the general setting of congruence--modular equational classes, using the notion of prime congruence defined through the commutator. We show how these two…