Related papers: Noncommutative orders. A preliminary study

Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…

We look at equivalence relations on the set of models of a theory -- MERs, for short -- such that the class of equivalent pairs is itself an elementary class, in a language appropriate for pairs of models. We provide many examples of…

Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also…

A notion of Cartan pairs as an analogy of vector fields in the realm of noncommutative geometry has been proposed in q-alg/9609011 In this paper we give an outline of the construction of a noncommutative analogy of the algebra of partial…

We define varieties of algebras for an arbitrary endofunctor on a cocomplete category using pairs of natural transformations. This approach is proved to be equivalent to the one of equational classes defined by equation arrows. Free…

Linear topological spaces with partial ordering (linear kinematics) are studied. They are defined by a set of 8 axioms implying that topology, linear structure and ordering are compatible with each other. Most of the results are valid for…

We generalize the solution of linear recurrence relations from fields to central division algebras, adapting the standard tools of companion matrices and characteristic polynomials to the non-commutative setting. We then solve linear…

An ordered semiring is a commutative semiring equipped with a compatible preorder. Ordered semirings generalise both distributive lattices and commutative rings, and provide a convenient framework to unify certain aspects of lattice theory…

Cartesian differential categories were introduced to provide an abstract axiomatization of categories of differentiable functions. The fundamental example is the category whose objects are Euclidean spaces and whose arrows are smooth maps.…

In this paper we study the representation theory of three monoids of partial functions on an $n$-set. The monoid of all order-preserving functions (i.e., functions satisfying $f(x)\leq f(y)$ if $x\leq y$) the monoid of all order-decreasing…

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

Let X be a singular affine normal variety with coordinate ring R and assume that there is an R-order admitting a stability structure such that the scheme of relevant semistable representations is smooth, then we construct a partial…

We provide a Lawvere-style definition for partial theories, extending the classical notion of equational theory by allowing partially defined operations. As in the classical case, our definition is syntactic: we use an appropriate class of…

Octupolar order is described in two space dimensions in terms of the maxima (and conjugated minima) of the probability density associated with a third-rank, fully symmetric and traceless tensor. Such a representation is shown to be…

Uniform preorders are a class of combinatory representations of Set-indexed preorders that generalize Pieter Hofstra's basic relational objects. An indexed preorder is representable by a uniform preorder if and only if it has as generic…

We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…

We construct a monadic second-order sentence that characterizes the ternary relations that are the betweenness relations of finite or infinite partial orders. We prove that no first-order sentence can do that. We characterize the partial…

We usually define an algebraic structure by a set, some operations defined on this set and some propositions that the algebraic structure must validate. In some cases, we can replace these propositions by an algorithm on terms constructed…

This paper pursues an investigation on groups equipped with an $L$-ordered relation, where $L$ is a fixed complete complete Heyting algebra. First, by the concept of join and meet on an $L$-ordered set, the notion of an $L$-lattice is…

We develop the basic constructions of homological algebra in the (appropriately defined) unbounded derived categories of modules over algebras over coalgebras over noncommutative rings (which we call semialgebras over corings). We define…