Macaulay2
»
Documentation
Packages
»
MonomialIntegerPrograms
::
Index
next | previous | forward | backward | up |
index
|
toc
MonomialIntegerPrograms : Index
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
bettiTablesWithHilbertFunction
-- list or tally all Betti tables that can be obtained from monomial ideals with a particular (partial or complete) Hilbert function
bettiTablesWithHilbertFunction(...,BoundGenerators=>...)
-- list or tally all Betti tables that can be obtained from monomial ideals with a particular (partial or complete) Hilbert function
bettiTablesWithHilbertFunction(...,Count=>...)
-- list or tally all Betti tables that can be obtained from monomial ideals with a particular (partial or complete) Hilbert function
bettiTablesWithHilbertFunction(...,FirstBetti=>...)
-- list or tally all Betti tables that can be obtained from monomial ideals with a particular (partial or complete) Hilbert function
bettiTablesWithHilbertFunction(...,GradedBettis=>...)
-- list or tally all Betti tables that can be obtained from monomial ideals with a particular (partial or complete) Hilbert function
bettiTablesWithHilbertFunction(...,SquareFree=>...)
-- list or tally all Betti tables that can be obtained from monomial ideals with a particular (partial or complete) Hilbert function
bettiTablesWithHilbertFunction(List,PolynomialRing)
-- 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
codimensionIP(MonomialIdeal)
-- compute the codimension of a monomial ideal using integer programming
Count
degreeIP
-- compute the degree of a monomial ideal using integer programming
degreeIP(...,KnownDim=>...)
-- compute the degree of a monomial ideal using integer programming
degreeIP(MonomialIdeal)
-- compute the degree of a monomial ideal using integer programming
dimensionIP
-- compute the dimension of a monomial ideal using integer programming
dimensionIP(MonomialIdeal)
-- compute the dimension of a monomial ideal using integer programming
FirstBetti
GradedBettis
IgnorePrimes
-- Ignores certain primes when computing top minimal primes.
KnownDim
-- compute the minimal primes of maximum dimension using integer programming
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
minimalPrimesIP(MonomialIdeal)
-- one line description if different from minimalPrimesIP
minimalPrimesIP(MonomialIdeal,ZZ)
-- one line description if different from minimalPrimesIP
monomialIdealsWithHilbertFunction
-- find all monomial ideals in a polynomial ring with a particular (partial or complete) Hilbert function
monomialIdealsWithHilbertFunction(...,BoundGenerators=>...)
-- find all monomial ideals in a polynomial ring with a particular (partial or complete) Hilbert function
monomialIdealsWithHilbertFunction(...,FirstBetti=>...)
-- find all monomial ideals in a polynomial ring with a particular (partial or complete) Hilbert function
monomialIdealsWithHilbertFunction(...,GradedBettis=>...)
-- find all monomial ideals in a polynomial ring with a particular (partial or complete) Hilbert function
monomialIdealsWithHilbertFunction(...,SquareFree=>...)
-- find all monomial ideals in a polynomial ring with a particular (partial or complete) Hilbert function
monomialIdealsWithHilbertFunction(List,PolynomialRing)
-- find all monomial ideals in a polynomial ring with a particular (partial or complete) Hilbert function
MonomialIntegerPrograms
-- A package for fast monomial ideal computations using constraint integer programming
ScipPrintLevel
-- adjust how much solving information is displayed in MonomialIntegerPrograms
SquareFree
topMinimalPrimesIP
-- compute the minimal primes of maximum dimension using integer programming
topMinimalPrimesIP(...,IgnorePrimes=>...)
-- Ignores certain primes when computing top minimal primes.
topMinimalPrimesIP(...,KnownDim=>...)
-- compute the minimal primes of maximum dimension using integer programming
topMinimalPrimesIP(MonomialIdeal)
-- compute the minimal primes of maximum dimension using integer programming