Related papers: Matroids: A Macaulay2 package
Mathematica offers, by way of the package Combinatorics, many useful functions to work on graphs and ordered structures, but none of these functions was specific enough to meet the needs of our research group. Moreover, the existing…
This article introduces the package MatchingFields for Macaulay2 and highlights some open problems. A matching field is a combinatorial object whose data encodes a candidate toric degeneration of a Grassmannian or partial flag variety of…
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…
Algebraic methods have a long history in statistics. The most prominent manifestation of modern algebra in statistics can be seen in the field of algebraic statistics, which brings tools from commutative algebra and algebraic geometry to…
We introduce the package PhylogeneticTrees for Macaulay2 which allows users to compute phylogenetic invariants for group-based tree models. We provide some background information on phylogenetic algebraic geometry and show how the package…
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…
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…
This note describes a package for computing seminormalization of rings within Macaulay2.
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…
We describe a Macaulay2 package for computing Schur complexes. This package expands on the ChainComplexOperations package by David Eisenbud.
We are developing a Maple package of functions related to Rota's Umbral Calculus. A Mathematica version of this package is being developed in parallel.
We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…
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…
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…
The Mathieu functions are used to solve analytically some problems in elliptical cylinder coordinates. A computational toolbox was implemented in Matlab. Since the notation and normalization for Mathieu functions vary in the literature, we…
The NumericalHilbert package for Macaulay2 includes algorithms for computing local dual spaces of polynomial ideals, and related local combinatorial data about its scheme structure. These techniques are numerically stable, and can be used…
In this paper we provide a description of the package \textit{PolyominoIdeals} for \textit{Macaulay2} that allows to deal with collections of cells, polyominoes and related binomial ideals.
We introduce the \verb|Macaulay2| package \verb|RepHomology| for the computations of representation homology of certain spaces. The main methods implement computing the representation homology of surfaces (with group coefficients, and…
In this paper we present an algorithm for computing a matrix representation for a surface in P^3 parametrized over a 2-dimensional toric variety T. This algorithm follows the ideas of [Botbol-Dickenstein-Dohm-09] and it was implemented in…
A binary frame template is a device for creating binary matroids from graphic or cographic matroids. Such matroids are said to conform or coconform to the template. We introduce a preorder on these templates and determine the nontrivial…