Related papers: Arithmetical meadows
Matroids generalize the familiar notion of linear dependence from linear algebra. Following a brief discussion of founding work in computability and matroids, we use the techniques of reverse mathematics to determine the logical strength of…
A tree T is invertible if and only if T has a perfect matching. Godsil considers an invertible tree T and finds that the inverse of the adjacency matrix of T has entries in {0, 1, -1} and is the signed adjacency matrix of a graph which…
The usual dictionary between geometry and commutative algebra is not appropriate for Arithmetic geometry because addition is a singular operation at the "Real prime". We replace Rings, with addition and multiplication, by Props (=strict…
Periodic trees are combinatorial structures which are in bijection with cluster tilting objects in cluster categories of affine type $\tilde{A}_{n-1}$. The internal edges of the tree encode the $c$-vectors corresponding to the cluster…
The operad of moulds is realized in terms of an operational calculus of formal integrals (continuous formal power series). This leads to many simplifications and to the discovery of various suboperads. In particular, we prove a conjecture…
We study operator algebras associated to integral domains. In particular, with respect to a set of natural identities we look at the possible nonselfadjoint operator algebras which encode the ring structure of an integral domain. We show…
In computational design and fabrication, neural networks are becoming important surrogates for bulky forward simulations. A long-standing, intertwined question is that of inverse design: how to compute a design that satisfies a desired…
The humble $\dagger$ ("dagger") is used to denote two different operations in category theory: Taking the adjoint of a morphism (in dagger categories) and finding the least fixed point of a functional (in categories enriched in domains).…
In a unitary ring with involution, we prove that each element has at most one weak group inverse if and only if each idempotent element has a unique weak group inverse. Furthermore, we define the $m$-weak group inverse and show some…
We divide the class of infinite computable trees into three types. For the first and second types, $0'$ computes a nontrivial self-embedding while for the third type $0''$ computes a nontrivial self-embedding. These results are optimal and…
Line graphs are an alternative representation of graphs where each vertex of the original (root) graph becomes an edge. However not all graphs have a corresponding root graph, hence the transformation from graphs to line graphs is not…
A ringoid is a set with two binary operations that are linked by the distributive laws. We study special classes of ringoids that are congruence-simple or ideal-simple. In particular, we examine generalised parasemifields and…
A commutative ring is reduced when it can be embedded into a direct product of fields. While the category of reduced commutative rings plays a fundamental role in affine geometry, it exhibits several structural deficiencies: it admits…
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…
In a former paper we introduced partial infinitary noncommutative semigroups and showed, among other, that significant differences arise in comparison with the commutative case, previously studied in the literature. For example, in the…
We define and describe the properties of a class of perverse sheaves which is very useful when the base ring is not a field.
In the paper we introduce the notion of twisted derivation of a bialgebra. Twisted derivations appear as infinitesimal symmetries of the category of representations. More precisely they are infinitesimal versions of twisted automorphisms of…
We study the existence of algebras of hypercyclic vectors for weighted backward shifts on sequence spaces of directed trees with the coordinatewise product. When $V$ is a rooted directed tree, we show the set of hypercyclic vectors of any…
The present article is concerned with division algebras that are structurally close to alternative algebras, in the sense that they satisfy some identity or other algebraic property that holds for all alternative division algebras.…
Reversible computing models settings in which all processes can be reversed. Applications include low-power computing, quantum computing, and robotics. It is unclear how to represent side-effects in this setting, because conventional…