Related papers: The free algebra in R
We provide a construction of free factorization algebras in algebraic geometry and link factorization homology of a scheme with coefficients in a free factorization algebra to the homology of its (unordered) configuration spaces. As an…
We demonstrate how methods in Functional Programming can be used to implement a computer algebra system. As a proof-of-concept, we present the computational-algebra package. It is a computer algebra system implemented as an embedded…
In modern mathematics, graphs figure as one of the better-investigated class of mathematical objects. Various properties of graphs, as well as graph-processing algorithms, can be useful if graphs of a certain kind are used as denotations…
This note is to show the effectiveness of the notion of pseudoalgebra in the theory of conformal algebras. We adduce very simple construction of free associative conformal algebra and find its linear basis. There is no any new result but we…
We apply the filtered and graded methods developed in earlier works to find (noncommutative) free group algebras in division rings. If $L$ is a Lie algebra, we denote by $U(L)$ its universal enveloping algebra. P. M. Cohn constructed a…
We construct pairs of algebras with mixed independence relations by using truncations of reduced free products of algebras. For example, we construct free-Boolean pairs of algebras and free-monotone pairs of algebras. We also introduce…
The free product of an arbitrary pair of finite hyperfinite von Neumann algebras is examined, and the result is determined to be the direct sum of a finite dimensional algebra and an interpolated free group factor $L(\freeF_r)$. The finite…
In this paper we briefly discuss \Rings --- an efficient lightweight library for commutative algebra. Polynomial arithmetic, GCDs, polynomial factorization and Gr\"obner bases are implemented with the use of modern asymptotically fast…
An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…
The field equations for both generic bosonic and generic locally supersymmetric 2D dilatonic gravity theories in the absence of matter are written as free differential algebras. This constitutes a generalization of the gauge theoretic…
A conjecture for the dimension and the character of the homogenous components of the free Jordan algebras is proposed. As a support of the conjecture, some numerical evidences are generated by a computer and some new theoretical results are…
A free differential for an arbitrary associative algebra is defined as a differential with a uniqueness property. The existence problem for such a differential is posed. The notion of optimal calculi for given commutation rules is…
This is the compendium of the cluster algebra and quiver package for sage. The purpose of this package is to provide a platform to work with cluster algebras in graduate courses and to further develop the theory by working on examples, by…
In this paper, first-order logic is interpreted in the framework of universal algebra, using the clone theory developed in three previous papers. We first define the free clone T(L, C) of terms of a first order language L over a set C of…
We study varieties of certain ordered $\Sigma$-algebras with restricted completeness and continuity properties. We give a general characterization of their free algebras in terms of submonads of the monad of $\Sigma$-coterms. Varieties of…
R is a language and environment for statistical computing and graphics, which provides a wide variety of statistical tools (modeling, statistical testing, time series analysis, classification problems, machine learning, ...), together with…
A tutorial introduction to projective geometric algebra (PGA), a modern, coordinate-free framework for doing euclidean geometry. PGA features: uniform representation of points, lines, and planes; robust, parallel-safe join and meet…
Pattern matching is a popular feature in functional, imperative and object-oriented programming languages. Language designers should therefore invest effort in a good design for pattern matching. Most languages choose a first-match…
Let $k$ be a field and let $A=\bigoplus_{n\ge 1}A_n$ be a positively graded $k$-algebra. We recall that $A$ is graded nilpotent if for every $d\ge 1$, the subalgebra of $A$ generated by elements of degree $d$ is nilpotent. We give a method…
A theorem prover without an extensive library is much less useful to its potential users. Algebra, the study of algebraic structures, is a core component of such libraries. Algebraic theories also are themselves structured, the study of…