MonomialIntegerPrograms : Table of Contents

• MonomialIntegerPrograms -- A package for fast monomial ideal computations using constraint integer programming
• bettiTablesWithHilbertFunction -- list or tally all Betti tables that can be obtained from monomial ideals with a particular (partial or complete) Hilbert function
• BoundGenerators
• codimensionIP -- compute the codimension of a monomial ideal using integer programming
• Count
• degreeIP -- compute the degree of a monomial ideal using integer programming
• dimensionIP -- compute the dimension of a monomial ideal using integer programming
• FirstBetti
• GradedBettis
• IgnorePrimes -- Ignores certain primes when computing top minimal primes.
• loadBuiltinCodimAndDegree -- change codim and degree to use the default, built-in methods.
• loadSCIPCodimAndDegree -- change codim and degree to use the default, built-in methods.
• minimalPrimesIP -- one line description if different from minimalPrimesIP
• monomialIdealsWithHilbertFunction -- find all monomial ideals in a polynomial ring with a particular (partial or complete) Hilbert function
• ScipPrintLevel -- adjust how much solving information is displayed in MonomialIntegerPrograms
• SquareFree
• topMinimalPrimesIP -- compute the minimal primes of maximum dimension using integer programming