Related papers: Lambda-calculus and Reversible Automatic Combinato…
A categorical approach to study model comparison games in terms of comonads was recently initiated by Abramsky et al. In this work, we analyse games that appear naturally in the context of description logics and supplement them with…
Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of…
We give integrable quad equations which are multi-quadratic (degree-two) counterparts of the well-known multi-affine (degree-one) equations classified by Adler, Bobenko and Suris (ABS). These multi-quadratic equations define multi-valued…
Koenig and Xi introduced {\em affine cellular algebras}. Kleshchev and Loubert showed that an important class of {\em infinite dimensional} algebras, the KLR algebras $R(\Gamma)$ of finite Lie type $\Gamma$, are (graded) affine cellular; in…
Linear logic provides a framework to control the complexity of higher-order functional programs. We present an extension of this framework to programs with multithreading and side effects focusing on the case of elementary time. Our main…
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…
Along the lines of the Abramsky ``Proofs-as-Processes'' program, we present an interpretation of multiplicative linear logic as typing system for concurrent functional programming. In particular, we study a linear multiple-conclusion…
We describe a categorification of the Double Affine Hecke Algebra (${\mathcal{H}\kern -.4em\mathcal{H}}$) associated with an affine Lie algebra $\widehat{\mathfrak{g}}$, including a categorification of the polynomial representation and…
Classical affine Lie algebras appear e.g. as symmetries of infinite dimensional integrable systems and are related to certain differential equations. They are central extensions of current algebras associated to finite-dimensional Lie…
We pursue tractable Bayesian analysis of generalized linear models (GLMs) for categorical data. Thus far, GLMs are difficult to scale to more than a few dozen categories due to non-conjugacy or strong posterior dependencies when using…
New deformed affine algebras A_{\hbar,\eta}(\hat{g}) are defined for any simply-laced classical Lie algebra g, which are generalizations of the algebra A_{\hbar,\eta}(\hat{sl_2}) recently proposed by Khoroshkin, Lebedev and Pakuliak (KLP).…
This thesis proposes a combinatorial generalization of a nilpotent operator on a vector space. The resulting object is highly natural, with basic connections to a variety of fields in pure mathematics, engineering, and the sciences. For the…
There is increasing interest within the research community in the design and use of recursive probability models. Although there still remains concern about computational complexity costs and the fact that computing exact solutions can be…
The group scheme of ternary automorphisms of a perfect finite dimensional evolution algebra A is computed. The main advantage of using group schemes is that it allows to apply the Lie functor to determine the Lie algebra of ternary…
This paper is a concise and painless introduction to the $\lambda$-calculus. This formalism was developed by Alonzo Church as a tool for studying the mathematical properties of effectively computable functions. The formalism became popular…
The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…
Filinski constructed a symmetric lambda-calculus consisting of expressions and continuations which are symmetric, and functions which have duality. In his calculus, functions can be encoded to expressions and continuations using primitive…
The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constants and a commutation rule between case and application…
We introduce analogues of algebraic groups called algebraic racks, which are pointed rack objects in the category of schemes over a ground field. Addressing a problem of Loday, we construct functors assigning left and right Leibniz algebras…
We extend all cohomological invariants of similarity classes of quadratic forms to anti-hermitian forms over a quaternion algebra. This uses the fact that such invariants can be lifted to Witt invariants, which can be described as…