Related papers: Extended Connectors: Structuring Glue Operators in…
Proposition algebra is based on Hoare's conditional connective, which is a ternary connective comparable to if-then-else and used in the setting of propositional logic. Conditional statements are provided with a simple semantics that is…
This article, which is substantially motivated by the previous joint work with J. McKay [8], establishes the analytic analogues of the relations we found free probability has with Witt vectors. Therefore, we first present a novel analytic…
We suggest an enhancement to structural coding through the use of (a) causally bound codes, (b) basic constructs of graph theory and (c) statistics. As is the norm with structural coding, the codes are collected into categories. The…
We extend the classical associative PI-theory to Associative Pairs, and in doing so, we introduce related notions already present for algebras (and Jordan systems) as the ones of PI-element and PI-ideal, extended centroid and central…
We discuss topological theories, arising from the general $\mathcal{N}=2$ twisted gauge theories. We initiate a program of their study in the Gromov-Witten paradigm. We re-examine the low-energy effective abelian theory in the presence of…
This paper concerns the relation between process algebra and Hoare logic. We investigate the question whether and how a Hoare logic can be used for reasoning about how data change in the course of a process when reasoning equationally about…
Let G be a connected split reductive group over a complete discrete valuation ring of mixed characteristic. We use the theory of intermediate extensions due to Abe-Caro and arithmetic Beilinson-Bernstein localization to classify irreducible…
The approach to reasoning about structural operational semantics style specifications supported by the Abella system is discussed. This approach uses lambda tree syntax to treat object language binding and encodes binding related properties…
This article establishes a bilinear embedding for second-order divergence-form operators with complex coefficients, characterized by the simultaneous presence of first-order terms and negative potentials. This work provides a further…
We prove that operators satisfying the hypotheses of the extrapolation theorem for Muckenhoupt weights are bounded on weighted Morrey spaces. As a consequence, we obtain at once a number of results that have been proved individually for…
Let $P$ be a Poisson algebra, $E$ a vector space and $\pi : E \to P$ an epimorphism of vector spaces with $V = {\rm Ker} (\pi)$. The global extension problem asks for the classification of all Poisson algebra structures that can be defined…
The usual strategy for deducing the $\pi\mbox{--}\pi^\ast$ electronic energy (or optical bandgap) in a molecule with an "infinite" number of conjugated double bonds consists in fitting a function with some adjustable parameters to the…
For a fixed finite group $Q$ and semi-simple finite dimensional algebra $S$, we examine an equivalence between strongly $Q$-graded algebras (extensions) with identity component $S$ and $S^1$-gerbes on action groupoids of $Q$ on the set of…
We compare two known methods of extending a complex, unital, commutative normed algebra so as to include solutions to sets of monic polynomials over the original algebra. (One of these is a generalisation of a construction from the thesis…
P-algebras are a non-commutative, non-associative generalization of Boolean algebras that are for quantum logic what Boolean algebras are for classical logic. P-algebras have type <X, 0, ', .> where 0 is a constant, ' is unary and . is…
To a finite Hopf-Galois extension $A | B$ we associate dual bialgebroids $S := \End_BA_B$ and $T := (A \o_B A)^B$ over the centralizer $R$ using the depth two theory in math.RA/0108067. First we extend results on the equivalence of certain…
The notion of a coalgebra-Galois extension is defined as a natural generalisation of a Hopf-Galois extension. It is shown that any coalgebra-Galois extension induces a unique entwining map $\psi$ compatible with the right coaction. For the…
The computational complexity of time-dependent perturbation theory is well-known to be largely combinatorial whatever the chosen expansion method and family of parameters (combinatorial sequences, Goldstone and other Feynman-type…
While behavioural equivalences among systems of the same type, such as Park/Milner bisimilarity of labelled transition systems, are an established notion, a systematic treatment of relationships between systems of different type is…
We introduce an additional structure on ribbon graphs, arrow structure. We extend the Bollob\'as-Riordan polynomial to ribbon graph with this structure. The extended polynomial satisfies the contraction-deletion relations and naturally…