Related papers: RandomPoints package for Macaulay2
We introduce a new Macaulay2 package, Nauty, which gives access to powerful methods on graphs provided by the software nauty by Brendan McKay. The primary motivation for accessing nauty is to determine if two graphs are isomorphic. We also…
We present the $\textit{NumericalImplicitization}$ package for $\textit{Macaulay2}$, which allows for user-friendly computation of the invariants of the image of a polynomial map, such as dimension, degree, and Hilbert function values. This…
Consider the set of solutions to a system of polynomial equations in many variables. An algebraic manifold is an open submanifold of such a set. We introduce a new method for computing integrals and sampling from distributions on algebraic…
We introduce the Macaulay2 package SparseResultants, which provides general tools for computing sparse resultants, sparse discriminants, and hyperdeterminants. We give some background on the theory and briefly show how the package works.
Numerical algebraic geometry is the field of computational mathematics concerning the numerical solution of polynomial systems of equations. Bertini, a popular software package for computational applications of this field, includes…
We provide an overview of the Macaulay2 package VersalDeformations, which algorithmically computes versal deformations of isolated singularities, as well as local (multi)graded Hilbert schemes.
The Macaulay2 package PHCpack.m2 provides an interface to PHCpack, a general-purpose polynomial system solver that uses homotopy continuation. The main method is a numerical blackbox solver which is implemented for all Laurent systems. The…
This note describes a Macaulay2 package for handling divisors. Group operations for divisors are included. There are methods for converting divisors to reflexive or invertible sheaves. Additionally, there are methods for checking whether…
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…
The MultiplicitySequence package for Macaulay2 computes the multiplicity sequence of a graded ideal in a standard graded ring over a field, as well as several invariants of monomial ideals related to integral dependence. We discuss two…
We introduce a Macaulay2 package for working with jet schemes. The main method constructs jets of ideals, polynomial rings and their quotients, ring homomorphisms, affine varieties, and (hyper)graphs. The package also includes additional…
We seek to determine a real algebraic variety from a fixed finite subset of points. Existing methods are studied and new methods are developed. Our focus lies on aspects of topology and algebraic geometry, such as dimension and defining…
We describe a new software package for computing multiplier ideals in certain cases, including monomial ideals, monomial curves, generic determinantal ideals, and hyperplane arrangements. In these cases we take advantage of combinatorial…
This short course offers a new perspective on randomized algorithms for matrix computations. It explores the distinct ways in which probability can be used to design algorithms for numerical linear algebra. Each design template is…
Random point fields which describe gases consisting of para-particles of any order are given by means of the canonical ensemble approach. The analysis for the cases of the para-fermion gases are discussed in full detail.
We present the Matlab toolbox MacaulayLab, which implements numerical linear algebra algorithms for solving multivariate polynomial systems and rectangular multiparameter eigenvalue problems. Its structure and functionality are the result…
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…
We present Binomials, a package for the computer algebra system Macaulay2, which specializes well known algorithms to binomial ideals. These come up frequently in algebraic statistics and commutative algebra, and it is shown that…
Using the geometric vertex decomposition property first defined by Knutson, Miller, and Yong, a recursive definition for geometrically vertex decomposable ideals was given by Klein and Rajchgot. We introduce the Macaulay2 package…
Solving a system of polynomial equations is a ubiquitous problem in the applications of mathematics. Until recently, it has been hopeless to find explicit solutions to such systems, and mathematics has instead developed deep and powerful…