Related papers: Coalgebraic Path Constraints
This paper proposes a new category theoretic account of equationally axiomatizable classes of algebras. Our approach is well-suited for the treatment of algebras equipped with additional computationally relevant structure, such as ordered…
We study coalgebraic modal logic to characterise behavioural equivalence in the presence of side effects, i.e., when coalgebras live in a (co)Kleisli or an Eilenberg-Moore category. Our aim is to develop a general framework based on indexed…
We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…
Complicated boundary conditions are essential to accurately describe phenomena arising in nature and engineering. Recently, the investigation of a potential speedup through quantum algorithms in simulating the governing ordinary and partial…
We prove that every finitary polynomial endofunctor of a category $C$ has a final coalgebra if $C$ is locally Cartesian closed, has finite disjoint coproducts and a natural number object. More generally, we prove that the category of…
We investigate polynomial endomorphisms of graph $C^*$-algebras and Leavitt path algebras. To this end, we define and analyze the coding graph corresponding to each such an endomorphism. We find an if and only if condition for the…
This work addresses the problem of vehicle path planning in the presence of obstacles and uncertainties, which is a fundamental problem in robotics. While many path planning algorithms have been proposed for decades, many of them have dealt…
A general prescription for the treatment of constrained quantum motion is outlined. We consider in particular constraints defined by algebraic submanifolds of the quantum state space. The resulting formalism is applied to obtain solutions…
In this paper we systematically investigate the connections between logics with a finite number of variables, structures of bounded pathwidth, and linear Datalog Programs. We prove that, in the context of Constraint Satisfaction Problems,…
We prove that algebraic isomorphisms between limit algebras are automatically continuous, and consider consequences of this result. In particular, we give partial solutions to a conjecture of Power [Limit Algebras, Longman, 1992, Notes to…
The treatment of equality as a type in type theory gives rise to an interesting type-theoretic structure known as `identity type'. The idea is that, given terms $a,b$ of a type $A$, one may form the type $Id_{A}(a,b)$, whose elements are…
Let k be a field of characteristic not two or three, let $\mathfrak{g}$ be a finite-dimensional colour Lie algebra and let V be a finite-dimensional representation of $\mathfrak{g}$. In this article we give various ways of constructing a…
This article introduces and studies the tight approximation property, a property of algebraic varieties defined over the function field of a complex or real curve that refines the weak approximation property (and the known cohomological…
When working in a proof assistant, automation is key to discharging routine proof goals such as equations between algebraic expressions. Homotopy type theory allows the user to reason about higher structures, such as topological spaces,…
We introduce a notion of rough paths on embedded submanifolds and demonstrate that this class of rough paths is natural. On the way we develop a notion of rough integration and an efficient and intrinsic theory of rough differential…
We define a basic class of algebras which we call homotopy path algebras. We find that such algebras always admit a cellular resolution and detail the intimate relationship between these algebras, stratifications of topological spaces, and…
Enumerating chemical graphs satisfying given constraints is a fundamental problem in mathematical and computational chemistry, and plays an essential part in a recently proposed framework for the inverse QSAR/QSPR. In this paper,…
Optimal decentralized controller design is notoriously difficult, but recent research has identified large subclasses of such problems that may be convexified and thus are amenable to solution via efficient numerical methods. One recently…
Irreducible representations of both Leavitt and Cohn path algebras of an arbitrary digraph with coefficients in a commutative field is classified. They are constructed in several ways using both infinite paths on the right as well as direct…
We introduce a notion of equivariant coarse cohomology of the complement of a subspace in a metric space. We use this cohomology to define a notion of coarse cohomology of the configuration space of a metric space and develop tools to…