Related papers: Decompositions of Binomial Ideals
In this article, we present FastMinors.m2, a package in Macaulay2 designed to introduce new methods focused on computations in function field linear algebra. Some key functionality that our package offers includes: finding a submatrix of a…
The \texttt{StronglyStableIdeals} package for \textit{Macaulay2} provides a method to compute all saturated strongly stable ideals in a given polynomial ring with a fixed Hilbert polynomial. A description of the main method and auxiliary…
We present {\tt RandomPoints}, a package in \emph{Macaulay2} designed mainly to identify rational and geometric points in a variety over a finite field. We provide tools to estimate the dimension of a variety. We also present methods to…
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…
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…
For the last almost three decades, since the famous Buchberger-M\"oller(BM) algorithm emerged, there has been wide interest in vanishing ideals of points and associated interpolation polynomials. Our paradigm is based on the theory of…
A natural candidate for a generating set of the (necessarily prime) defining ideal of an $n$-dimensional monomial curve, when the ideal is an almost complete intersection, is a full set of $n$ critical binomials. In a somewhat modified and…
We introduce the Macaulay2 package BooleanGB, which computes a Gr\"obner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an…
We discuss algebraic and homological properties of binomial edge ideals associated to graphs which are obtained by gluing of subgraphs and the formation of cones.
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…
This is an expository version of our paper [arXiv:1902.07384]. Our aim is to present recent Macaulay2 algorithms for computation of mixed multiplicities of ideals in a Noetherian ring which is either local or a standard graded algebra over…
In this paper we characterize, in algebraic and geometric terms, when a graded vanishing ideal is generated by binomials over any field K.
We present an alternative method for computing primary decomposition of zero-dimensional ideals over finite fields. Based upon the further decomposition of the invariant subspace of the Frobenius map acting on the quotient algebra in the…
We propose an effective method for primary decomposition of symmetric ideals. Let $K[X]=K[x_1,\ldots,x_n]$ be the $n$-valuables polynomial ring over a field $K$ and $\mathfrak{S}_n$ the symmetric group of order $n$. We consider the…
We study a family of determinantal ideals whose decompositions encode the structural zeros in conditional independence models with hidden variables. We provide explicit decompositions of these ideals and, for certain subclasses of models,…
Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This…
The repeated solution of large-scale optimization problems arises frequently in process systems engineering tasks. Decomposition-based solution methods have been widely used to reduce the corresponding computational time, yet their…
A combinatorial property that characterizes Cohen-Macaulay binomial edge ideals has long been elusive. A recent conjecture ties the Cohen-Macaulayness of a binomial edge ideal $J_G$ to special disconnecting sets of vertices of its…
In this work, we show that for linearly constrained optimization problems the primal-dual hybrid gradient algorithm, analyzed by Chambolle and Pock [3], can be written as an entirely primal algorithm. This allows us to prove convergence of…
Given a parametric polynomial ideal I, the algorithm DISPGB, introduced by the author in 2002, builds up a binary tree describing a dichotomic discussion of the different reduced Groebner bases depending on the values of the parameters,…