Related papers: Blow up and Blur constructions in Algebraic Logic
Convergent rewriting systems on algebraic structures give methods to solve decision problems, to prove coherence results, and to compute homological invariants. These methods are based on higher-dimensional extensions of the critical…
In previous work "Betweenness algebras" we introduced and examined the class of betweenness algebras. In the current paper we study a larger class of algebras with binary operators of possibility and sufficiency, the weak mixed algebras.…
Let $M$ be a compact hyperkaehler manifold. The hyperkaehler structure equips $M$ with a set $R$ of complex structures parametrized by $CP^1$, called "the set of induced complex structures". It was known previously that induced complex…
In this article, we give a family of examples of algebras, showing that for every $n \geq 2$ and $m \geq 0$, there is an algebra displaying a path of n irreducible morphisms between indecomposable modules whose composite lies in the…
We classify the twisted tensor products of a finite set algebra with a two elements set algebra using colored quivers obtained through considerations analogous to Ore extensions. This provides also a classification of entwining structures…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
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…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
Blow-up in graph theory is a procedure in which each vertex is replaced by copies of itself, and two copies are adjacent if and only if the original vertices are adjacent. In this paper, we extend the concept of graph blow-up to a more…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
Our goal is to define an algebraic language for reasoning about non-deterministic computations. Towards this goal, we introduce an algebra of string-to-string transductions. Specifically, it is an algebra of partial functions on words over…
We consider relationships between cubic algebras and implication algebras. We first exhibit a functorial construction of a cubic algebra from an implication algebra. Then we consider an collapse of a cubic algebra to an implication algebra…
This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…
The classical Kepler-Coulomb system in 3 dimensions is well known to be 2nd order superintegrable, with a symmetry algebra that closes polynomially under Poisson brackets. This polynomial closure is typical for 2nd order superintegrable…
Many finite symmetric integral non-representable relation algebras, including almost all Monk algebras, can be embedded in the completion of an atomic symmetric integral representable relation algebra whose finitely-generated subalgebras…
We prove that a finite dimensional algebra $\Lambda$ is $\tau-$tilting finite if and only if all the bricks over $\Lambda$ are finitely generated. This is obtained as a consequence of the existence of proper locally maximal torsion classes…
In physics, Lie groups represent the algebraic structure that describes symmetry transformations of a given system. Then, the descending Lie algebra of those groups are necessarily real. In most cases, the complexification of those Lie…
This paper introduces a model theory for resolution on Higher Order Hereditarily Harrop formulae (HOHH), the logic underlying the Lambda-Prolog programming language, and proves soundness and completeness of resolution. The semantics and the…
Plonka sums consist of an algebraic construction similar, in some sense to direct limits, which allows to represent classes of algebras defined by means of regular identities (namely those equations where the same set of variables appears…
Probabilistic graphical models (PGMs) are powerful tools for solving systems of complex relationships over a variety of probability distributions. However, while tree-structured PGMs always result in efficient and exact solutions, inference…