Related papers: A SageTeX Hypermatrix Algebra Package
We have developed a Mathematica package capable of performing gamma-matrix algebra in arbitrary (integer) dimensions. As an application we can compute Fierz transformations.
We report on implementations for algorithms treating algebraic and arithmetic properties of hypergeometric functions in the computer algebra system SageMath. We treat hypergeometric series over the rational numbers, over finite fields, and…
The paper describes a SageTeX implementation of an integer encoding procedures.
Elementary tutorial on implementation aspects of Gr\"obner bases computation.
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…
We introduce FlagAlgebraToolbox, an extension of SageMath capable of automating flag algebra calculations and optimizations. FlagAlgebraToolbox has a simple interface, can handle a wide range of combinatorial theories, can numerically…
The new finite state machine package in the mathematics software system SageMath is presented and illustrated by many examples. Several combinatorial problems, in particular digit problems, are introduced, modeled by automata and…
We introduce the new sage_acsv package for the SageMath computer algebra system, allowing users to rigorously compute asymptotics for a large variety of multivariate sequences with rational generating functions. Using Sage's support for…
We represent vector bundles over a regular algebraic curve as pairs of lattices over the maximal orders of its function field and we give polynomial time algorithms for several tasks: computing determinants of vector bundles, kernels and…
We present `liesuperalg` a SageMath package for representation-theoretic calculations involving Lie superalgebras in Type A. Our package introduces functionality to calculate invariants of weights and produce the associated cup diagrams. We…
We present a Mathematica package for doing computations with gamma matrices, spinors, tensors and other objects, in any dimension and signature. The approach we use is based on defining the commutation relations of the relevant matrices,…
Package-X, a Mathematica package for the analytic computation of one-loop integrals dimensionally regulated near 4 spacetime dimensions is described. Package-X computes arbitrarily high rank tensor integrals with up to three propagators,…
We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…
Multiplication of a sparse matrix with another (dense or sparse) matrix is a fundamental operation that captures the computational patterns of many data science applications, including but not limited to graph algorithms, sparsely connected…
In the past two decades, some major efforts have been made to reduce exact (e.g. integer, rational, polynomial) linear algebra problems to matrix multiplication in order to provide algorithms with optimal asymptotic complexity. To provide…
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…
This paper describes a package for calculations of expressions with Dirac matrixes. Advantages to existing similar packages are described. MatrixExp package is intended for simplification of complex expressions involving $\gamma$-matrixes,…
We use the characteristic polynomial of the Coxeter matrix of an algebra to complete the combinatorial classification of piecewise hereditary algebras which Happel gave in terms of the trace of the Coxeter matrix. We also give a…
We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining…
Some idea, which leads to a non-trivial solution of the quantum four-simplex equation, is exposed in this paper. We call this idea "pentagonal algebra". Few examples of the realisation of this idea are given here, and thus few examples of…