相关论文: Computing Quasidegrees of A-graded Modules
We present the Macaulay2 package Resultants, which provides commands for the effective computation of multivariate resultants, discriminants, and Chow forms. We provide some background for the algorithms implemented and show, with a few…
The Macaulay2 package CharacteristicClasses provides commands for the computation of the topological Euler characteristic, the degrees of the Chern classes and the degrees of the Segre classes of a closed subscheme of complex projective…
We deepen the theory of quasiorthogonal and approximately quasiorthogonal operator algebras through an analysis of the commutative algebra case. We give a new approach to calculate the measure of orthogonality between two such subalgebras…
We describe a Macaulay2 package for computing Schur complexes. This package expands on the ChainComplexOperations package by David Eisenbud.
The {\tt Macaulay2} package {\tt RandomMonomialIdeals} provides users with a set of tools that allow for the systematic generation and study of random monomial ideals. It also introduces new objects, Sample and Model, to allow for…
The Weyl closure is a basic operation in algebraic analysis: it converts a system of differential operators with rational coefficients into an equivalent system with polynomial coefficients. In addition to encoding finer information on the…
We introduce the $\textit{Macaulay2}$ package $\texttt{OIGroebnerBases}$ for working with OI-modules over Noetherian polynomial OI-algebras. The main methods implement OI-analogues of Buchberger's algorithm and Schreyer's theorem to compute…
A concrete description of all graded maximal Cohen-Macaulay modules of rank one and two over the affine cone of the simple node (a non-isolated singularity) is given. For this purpose we construct an alghoritm that provides extensions of…
We illustrate the use of the computer algebra system Macaulay2 for simplifications of classical unirationality proofs. We explicitly treat the moduli spaces of curves of genus g=10, 12 and 14.
Let $S=K[x_1, \dots, x_m, y_1, \dots, y_n]$ be the standard bigraded polynomial ring over a field $K$. Let $M$ be a finitely generated bigraded $S$-module and $Q=(y_1, \dots, y_n)$. We say $M$ has maximal depth with respect to $Q$ if there…
We describe a significant update to the Macaulay2 package A1BrouwerDegrees. We extend several methods in the previous version of the package to the setting of finite \'{e}tale algebras, allowing the computation of transfers along finite…
The purpose of this note is to show that a finitely generated graded module $M$ over $S=k[x_1,\ldots,x_n]$, $k$ a field, is sequentially Cohen-Macaulay if and only if its arithmetic degree ${\rm adeg}(M)$ agrees with ${\rm adeg}(F/{\rm…
We define a convenient $\infty$-operad parametrizing modules over commutative algebras in $\infty$-categories.
Numerical Algebraic Geometry uses numerical data to describe algebraic varieties. It is based on the methods of numerical polynomial homotopy continuation, an alternative to the classical symbolic approaches of computational algebraic…
In this article we show how to compute a matrix representation and the implicit equation by means of the method developed in [Botbol: arXiv:1007.3437], using the computer algebra system Macaulay2 \cite{M2}. As it is probably the most…
Macaulay Duality, between quotients of a polynomial ring over a field, annihilated by powers of the variables, and finitely generated submodules of the ring's graded dual, is generalized over any Noetherian ring, and used to provide…
In this article, we describe the theoretical foundations of the Macaulay2 package ConnectionMatrices and explain how to use it. For a left ideal in the Weyl algebra that is of finite holonomic rank, we implement the computation of the…
The notion of quasicrossed product is introduced in the setting of G-graded quasialgebras, i.e., algebras endowed with a grading by a group G, satisfying a "quasiassociative" law. The equivalence between quasicrossed products and…
The Macaulay2 package DecomposableSparseSystems implements methods for studying and numerically solving decomposable sparse polynomial systems. We describe the structure of decomposable sparse systems and explain how the methods in this…
The Macaulay2 package SumsOfSquares decomposes polynomials as sums of squares. It is based on methods to rationalize sum-of-squares decompositions due to Parrilo and Peyrl. The package features a data type for sums-of-squares polynomials,…