Related papers: The MatrixSchubert package for Macaulay2
This article presents some aspects and experience in the use of algebraic manipulation software applied to general relativity. Some years ago certain results were reported using computer algebra platforms, but the growing popularity of…
Schemes for exact multiplication of small matrices have a large symmetry group. This group defines an equivalence relation on the set of multiplication schemes. There are algorithms to decide whether two schemes are equivalent. However, for…
A minimal separating set is found for the algebra of matrix invariants of several 2x2 matrices over an infinite field of arbitrary characteristic
Matrix mutation of skew-symmetrizable matrices is foundational in cluster algebra theory. Effective mutation invariants are essential for determining whether two matrices lie in the same mutation class. Casals~\cite{Casals} introduced a…
We explain a Macaulay2 implementation of a construction, which appeared in [Holweck-Oeding arXiv:2206.13662], of a graded algebra structure on the direct sum of a Lie algebra $\mathfrak{g}$ (typically $\mathfrak{sl}_n$) and a…
The Package Miura contains functions that compute divisor class group arithmetic for nonsingular curves. The package reduces computation in a divisor class group to that in the ideal class group via the isomorphism. The underlying quotient…
We describe the Macaulay2 package TateOnProducts and its capabilities, which include computing cohomology tables and Beilinson monads of sheaves on products of projective spaces and the derived category pushForward of a sheaf under a…
The following article is an application of commutative algebra to the study of multiparameter persistent homology in topological data analysis. In particular, the theory of finite free resolutions of modules over polynomial rings is applied…
We propose a theory of combinatorially explicit Schubert polynomials which represent the Schubert classes in the Borel presentation of the cohomology ring of orthogonal flag varieties. We use these polynomials to describe the arithmetic…
The Invar package is introduced, a fast manipulator of generic scalar polynomial expressions formed from the Riemann tensor of a four-dimensional metric-compatible connection. The package can maximally simplify any polynomial containing…
Software model checking is a challenging problem, and generating relevant invariants is a key factor in proving the safety properties of a program. Program invariants can be obtained by various approaches, including lightweight procedures…
Schubert polynomials are a basis for the polynomial ring that represent Schubert classes for the flag manifold. In this paper, we introduce and develop several new combinatorial models for Schubert polynomials that relate them to other…
We report on a systematic implementation of su(2) invariance for matrix product states (MPS) with concrete computations cast in a diagrammatic language. As an application we present a variational MPS study of $su(2)$ invariant quantum spin…
Let X be a projective scheme; let M and N be two coherent O_X-modules. Given an integer m, we present an algorithm for computing the global extension module Ext^m(X;M,N). In particular, this allows one to compute the sheaf cohomology…
We introduce the MathGR package, written in Mathematica. The package can manipulate tensor and GR calculations with either abstract or explicit indices, simplify tensors with permutational symmetries, decompose tensors from abstract indices…
I give in this lecture an overview of the features of the Mathematica package SARAH, and explain how it can be used together with other codes to study all aspects of a BSM model. The focus will be on the description of the analytical…
It is the aim of this work to identify and illustrate the potential and weaknesses of the computer algebra system Maple in the area of the Calculus of Variations: a classical area of mathematics that studies the methods for finding maximum…
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…
The development of embedded systems requires formal analysis of models such as those described with MATLAB/Simulink. However, the increasing complexity of industrial models makes analysis difficult. This paper proposes a model checking…
The density matrix renormalization group (DMRG) algorithm is a cornerstone computational method for studying quantum many-body systems, renowned for its accuracy and adaptability. Despite DMRG's broad applicability across fields such as…