Related papers: Iterated algebraic injectivity and the faithfulnes…

The initial algebra for an endofunctor F provides a recursion and induction scheme for data structures whose constructors are described by F. The initial-algebra construction by Ad\'amek (1974) starts with the initial object (e.g. the empty…

We propose a computational modeling framework for inducing combinatory categorial grammars from arbitrary behavioral data. This framework provides the analyst fine-grained control over the assumptions that the induced grammar should conform…

We consider the problem of learning the semantics of composite algebraic expressions from examples. The outcome is a versatile framework for studying learning tasks that can be put into the following abstract form: The input is a partial…

Let $R$ be a ring, let $G$ be an amenable group and let $R\ast G$ be a crossed product. The goal of this paper is to construct, starting with a suitable additive function $L$ on the category of left modules over $R$, an additive function on…

The description of algebraic structure of n-fold loop spaces can be done either using the formalism of topological operads, or using variations of Segal's $\Gamma$-spaces. The formalism of topological operads generalises well to different…

Two important notions of integrability for discrete mappings are algebraic integrability and singularity confinement, have been used for discrete mappings. Algebraic integrability is related to the existence of sufficiently many conserved…

We study the operad of associative algebras equipped with a derivation. We show that it is determined by polynomials in several variables and substitution. Replacing polynomials by rational functions gives an operad which is isomorphic to…

Sharing of notations and theories across an inheritance hierarchy of mathematical structures, e.g., groups and rings, is important for productivity when formalizing mathematics in proof assistants. The packed classes methodology is a…

In this paper we present a new approach to Grothendieck duality over commutative rings. Our approach is based on the idea of rigid dualizing complexes, which was introduced by Van den Bergh in the context of noncommutative algebraic…

Conditioning is crucial in applied science when inference involving time series is involved. Belief calculus is an effective way of handling such inference in the presence of epistemic uncertainty -- unfortunately, different approaches to…

For general finite-dimensional self-injective algebra $A$ we construct a family of injective coassociative coproducts $A\to A\otimes A$, all $A$-bimodule morphisms. In particular such structures always exist, confirming a conjecture of…

We introduce type-theoretic algebraic weak factorisation systems and show how they give rise to homotopy-theoretic models of Martin-L\"of type theory. This is done by showing that the comprehension category associated to a type-theoretic…

We prove a formality theorem for algebraic objects internal to smooth complex varieties that are not compact but whose mixed Hodge structure has a certain purity property.

In this paper we investigate the computational complexity of deciding if a given finite algebraic structure satisfies a fixed (strong) Maltsev condition $\Sigma$. Our goal in this paper is to show that $\Sigma$-testing can be accomplished…

Let $G$ be a commutative algebraic group embedded in projective space and $\Gamma$ a finitely generated subgroup of $G$. From these data we construct a chain of algebraic subgroups of $G$ which is intimately related to obstructions to…

This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…

A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…

We show that certain vertex algebras without vacuum vector may be embedded into vertex algebras. The result is a partial analogue of the simple classical fact that any rng can be embedded into a ring. A one-line proof of the case of a…

In a paper published in 2012, the second author extended the well-known fact that Boolean algebras can be defined using only implication and a constant, to De Morgan algebras-this result led him to introduce, and investigate (in the same…

We show a model construction for a system of higher-order illative combinatory logic $\mathcal{I}_\omega$, thus establishing its strong consistency. We also use a variant of this construction to provide a complete embedding of first-order…