Related papers: Decomposable sparse polynomial systems
This note introduces the $\texttt{LikelihoodGeometry}$ package for the computer algebra system $\textit{Macaulay2}$. This package gives tools to construct the likelihood correspondence of a discrete algebraic statistical model, a variety…
We introduce the Brackets package for the computer algebra system Macaulay2, which provides convenient syntax for computations involving the classical invariants of the special linear group. We describe our implementation of bracket rings…
This paper is devoted to the classification of integrable Davey-Stewartson type equations. A list of potentially deformable dispersionless systems is obtained through the requirement that such systems must be generated by a polynomial…
We give a description of a new Macaulay2 package called SimplicialPosets. This package provides functions for working with simplicial posets and calculating their generalized Stanley-Reisner ideals. For practical purposes, we also introduce…
Symbolic powers are a classical commutative algebra topic that relates to primary decomposition, consisting, in some circumstances, of the functions that vanish up to a certain order on a given variety. However, these are notoriously…
This tutorial illustrates how to use Grayson and Stillman's computer algebra system, Macaulay2, to study schemes. The examples are taken from the homework for an algebraic geometry class given at the University of California, Berkeley in…
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…
This paper describes the RationalMaps package for Macaulay2. This package provides functionality for computing several aspects of rational maps such as whether a map is birational, or a closed embedding.
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 introduce the DeterminantalRepresentations package for Macaulay2, which computes definite symmetric determinantal representations of real polynomials. We focus on quadrics and plane curves of low degree (i.e. cubics and quartics). Our…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
This paper focuses on the equidimensional decomposition of affine varieties defined by sparse polynomial systems. For generic systems with fixed supports, we give combinatorial conditions for the existence of positive dimensional components…
For several computational procedures such as finding radicals and Noether normalizations, it is important to choose as sparse as possible a system of parameters in a polynomial ideal or modulo a polynomial ideal. We describe new strategies…
In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new…
We introduce the package \texttt{EliminationTemplates} for the Macaulay2 computer algebra system, which provides tools for constructing automatic solvers for families of zero-dimensional radical ideals depending on algebraically independent…
We introduce the Probability package for Macaulay2, which provides an interface for users to compute probabilities and generate random variates from a wide variety of univariate probability distributions.
The package Binomials contains implementations of specialized algorithms for binomial ideals, including primary decomposition into binomial ideals. The current implementation works in characteristic zero. Primary decomposition is restricted…
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…
CylindricalAlgebraicDecomposition.m2 is the first implementation of Cylindrical Algebraic Decomposition (CAD) in Macaulay2. CAD decomposes space into 'cells' where input polynomials are sign-invariant. This package computes an Open CAD…
We prove two criteria for direct sum decomposability of homogeneous polynomials. For a homogeneous polynomial with a non-zero discriminant, we interpret direct sum decomposability of the polynomial in terms of factorization properties of…