Related papers: Noncommutative orders. A preliminary study

We study the non-uniqueness of factorizations of non zero-divisors into atoms (irreducibles) in noncommutative rings. To do so, we extend concepts from the commutative theory of non-unique factorizations to a noncommutative setting. Several…

A higher order difference equation may be generally defined in an arbitrary nonempty set S as: \[ f_{n}(x_{n},x_{n-1},...,x_{n-k})=g_{n}(x_{n},x_{n-1},...,x_{n-k}) \] where $f_{n},g_{n} :S^{k+1}\rightarrow S$ are given functions for…

We use computational linear algebra and commutative algebra to study spaces of relations satisfied by quadrilinear operations. The relations are analogues of associativity in the sense that they are quadratic (every term involves two…

Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…

While the embedding of words has revolutionized the field of Natural Language Processing, the embedding of concepts has received much less attention so far. A dense and meaningful representation of concepts, however, could prove useful for…

The notion of vertex operator coalgebra is presented and motivated via the geometry of conformal field theory. Specifically, we describe the category of geometric vertex operator coalgebras, whose objects have comultiplicative structures…

We define and study expansion problems on countable structures in the setting of descriptive combinatorics. We consider both expansions on countable Borel equivalence relations and on countable groups, in the Borel, measure and category…

A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…

We propose an abstract definition of convex spaces as sets where one can take convex combinations in a consistent way. A priori, a convex space is an algebra over a finitary version of the Giry monad. We identify the corresponding Lawvere…

We classify (possibly non commutative) algebras of low rank over a domain R. We first review results for algebras of rank 2 and for finite-dimensional division algebras over the real numbers. These results motivate us to consider which…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

There exists two types of nonassociative algebras whose associator satisfies a symmetric relation associated with a 1-dimensional invariant vector space with respect to the natural action of the symmetric group on three elements. The first…

In this paper we classify invariant noncommutative connections in the framework of the algebra of endomorphisms of a complex vector bundle. It has been proven previously that this noncommutative algebra generalizes in a natural way the…

Using Cartan equivalence method, invariant coframes are constructed for two branches of rank one and zero, which characterize linearizable third-order ODEs under contact transformations with four- and five-dimensional Lie symmetry algebras,…

In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permutation of the sequence's indices. In this paper we prove a simple formula that explicitly describes how the elements of a sequence are…

We give an algebraic characterisation of ordered groupoids, namely, we show that there is a categorical isomophism between the category of ordered groupoids and the category of $D$-inverse constellations. Here constellations are partial…

Correlation matrices are the sub-class of positive definite real matrices with all entries on the diagonal equal to unity. Earlier work has exhibited a parametrisation of the corresponding Cholesky factorisation in terms of partial…

Poisson algebra is usually defined to be a commutative algebra together with a Lie bracket, and these operations are required to satisfy the Leibniz rule. We describe Poisson structures in terms of a single bilinear operation. This enables…

A categorical point of view about minimization in subrecursive classes is presented by extending the concept of Symmetric Monoidal Comprehension to that of Distributive Minimization Comprehension. This is achieved by endowing the former…

Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor on some full subcategory of the…