Related papers: Rings: an efficient Java/Scala library for polynom…
The open source ALPS (Algorithms and Libraries for Physics Simulations) project provides a collection of physics libraries and applications, with a focus on simulations of lattice models and strongly correlated systems. The libraries…
Semiring algebras have been shown to provide a suitable language to formalize many noteworthy combinatorial problems. For instance, the Shortest-Path problem can be seen as a special case of the Algebraic-Path problem when applied to the…
A major challenge in the deployment of scientific software solutions is the adaptation of research prototypes to production-grade code. While high-level languages like MATLAB are useful for rapid prototyping, they lack the resource…
Differential graded (DG) commutative algebra provides powerful techniques for proving theorems about modules over commutative rings. These notes are a somewhat colloquial introduction to these techniques. In order to provide some motivation…
A major factor contributing to the success of modern representation learning is the ease of performing various vector operations. Recently, objects with geometric structures (eg. distributions, complex or hyperbolic vectors, or regions such…
Machine learning solutions are very popular in the field of chemoinformatics, where they have numerous applications, such as novel drug discovery or molecular property prediction. Molecular fingerprints are algorithms commonly used for…
The main goal of this article is to introduce BL-rings, i.e., commutative rings whose lattices of ideals can be equipped with a structure of BL-algebra. We obtain a description of such rings, and study the connections between the new class…
Suppose we are given black-box access to a finite ring R, and a list of generators for an ideal I in R. We show how to find an additive basis representation for I in poly(log |R|) time. This generalizes a quantum algorithm of Arvind et al.…
We present a Sage implementation of Ore algebras. The main features for the most common instances include basic arithmetic and actions; gcrd and lclm; D-finite closure properties; natural transformations between related algebras; guessing;…
In [5, 6] it has been proved that the ring of quasisymmetric functions over the integers is free polynomial, see also [4]. This is a matter that has been of great interest since 1972; for instance because of the role this statement plays in…
I present libcommute, a C++11/14/17 template library that implements a domain-specific language for easy manipulating of polynomial operators used in the quantum many-body theory, as well as a software development toolkit for exact…
In this paper, a transform approach is used for polycyclic and serial codes over finite local rings in the case that the defining polynomials have no multiple roots. This allows us to study them in terms of linear algebra and invariant…
We argue that once octonions are formulated as soft Lie algebras, they may be safely used and the non-associativity can be overcame. The necessary points are: (a) Fixing the direction of action by introducing the \delta operator. (b)…
Fixed-size commutative rings are quasi-ordered such that all scalar linearly solvable networks over any given ring are also scalar linearly solvable over any higher-ordered ring. As consequences, if a network has a scalar linear solution…
We introduce a detection algorithm for SAGBI basis in polynomial rings, analogous to a Gr\"obner basis detection algorithm previously proposed by Gritzmann and Sturmfels. We also present two accompanying software packages named…
The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively…
We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…
Data processing systems roughly group into families such as relational, array, graph, and key-value. Many data processing tasks exceed the capabilities of any one family, require data stored across families, or run faster when partitioned…
The translation of linear algebra computations into efficient sequences of library calls is a non-trivial task that requires expertise in both linear algebra and high-performance computing. Almost all high-level languages and libraries for…
In this paper we introduce a block-structured adaptive mesh refinement (AMR) software framework that incorporates tiling, a well-known loop transformation. Because the multiscale, multiphysics codes built in BoxLib are designed to solve…