Related papers: Mathematical Structure of Syntactic Merge
We consider three a priori totally different setups for Hopf algebras from number theory, mathematical physics and algebraic topology. These are the Hopf algebra of Goncharov for multiple zeta values, that of Connes-Kreimer for…
These lecture notes aim to present the algebraic theory of regularity structures as developed in arXiv:1303.5113, arXiv:1610.08468, and arXiv:1711.10239. The main aim of this theory is to build a systematic approach to renormalisation of…
Super-Hopf algebra structure on the function algebra on the extended quantum symplectic superspace ${\rm SP}_q^{2|1}$ has been defined. The dual Hopf algebra is explicitly constructed.
We show that the process of renormalization encapsules a Hopf algebra structure in a natural manner. This sheds light on the recently proposed connection between knots and renormalization theory.
Syntactic theory has traditionally adopted a constructivist approach, in which a set of atomic elements are manipulated by combinatory operations to yield derived, complex elements. Syntactic structure is thus seen as the result or discrete…
Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic…
Separation logic is a concise method for specifying programs that manipulate dynamically allocated storage. Partially inspired by separation logic, Implicit Dynamic Frames has recently been proposed, aiming at first-order tool support. In…
Human syntactic structures are usually represented as graphs. Much research has focused on the mapping between such graphs and linguistic sequences, but less attention has been paid to the shapes of the graphs themselves: their topologies.…
We provide an algebraic framework to describe renormalization in regularity structures based on multi-indices for a large class of semi-linear stochastic PDEs. This framework is ``top-down", in the sense that we postulate the form of the…
We introduce a new Hopf algebra that operates on pairs of finite interval partitions and permutations of equal length. This algebra captures vincular patterns, which involve specifying both the permutation patterns and the consecutive…
We provide a mathematical theory and methodology for synthesising equational logics from algebraic metatheories. We illustrate our methodology by means of two applications: a rational reconstruction of Birkhoff's Equational Logic and a new…
The Hopf algebra of word-quasi-symmetric functions ($\WQSym$), a noncommutative generalization of the Hopf algebra of quasi-symmetric functions, can be endowed with an internal product that has several compatibility properties with the…
This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave)…
To a semisimple and cosemisimple Hopf algebra over an algebraically closed field, we associate a planar algebra defined by generators and relations and show that it is a connected, irreducible, spherical, non-degenerate planar algebra with…
Algorithms like those for differentiating functional expressions manipulate the syntactic structure of mathematical expressions in a mathematically meaningful way. A formalization of such an algorithm should include a specification of its…
Language sciences rely less and less on formal syntax as their base. The reason is probably its lack of psychological reality, knowingly avoided. Philosophers of science call for a paradigm shift in which explanations are by mechanisms, as…
We propose an algebraic study of the simple graph isomorphism problem. We define a Hopf algebra from an explicit realization of its elements as formal power series. We show that these series can be evaluated on graphs and count occurrences…
There are many scientific problems generated by the multiple and conflicting alternative definitions of linguistic recursion and human recursive processing that exist in the literature. The purpose of this article is to make available to…
In arXiv:1605.06672 the authors introduced inhomogeneous bases of the ring of symmetric functions. The elements in these bases have the property that they evaluate to characters of symmetric groups. In this article we develop further…
Moving from the mathematical theory of (abstract) syntax, we develop a general relational theory of symbolic manipulation parametric with respect to, and accounting for, general notions of syntax. We model syntax relying on categorical…