On the complexity of computing syzygies

From MaRDI portal
Revision as of 02:43, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1117693

DOI10.1016/S0747-7171(88)80039-7zbMath0667.68053WikidataQ102119303 ScholiaQ102119303MaRDI QIDQ1117693

David Bayer, Michael Stillman

Publication date: 1988

Published in: Journal of Symbolic Computation (Search for Journal in Brave)




Related Items (53)

Computing representation matrices for the action of Frobenius on cohomology groupsA solution to Kronecker's problemOn the embedded primes of the Mayr-Meyer idealsPolly cracker, revisitedAlgorithmic aspects of Suslin's proof of Serre's conjectureSubadditivity of Syzygies of Ideals and Related ProblemsRegularity of prime idealsUpper bounds for the degrees of the equations defining locally Cohen- Macaulay schemesLinear syzygies, flag complexes, and regularityOn the Cohen-Macaulay type of the general hypersurface section of a curveOpen problems on syzygies and Hilbert functionsA sharp Castelnuovo bound for smooth surfacesCastelnuovo-Mumford regularity of initial idealsThe regularity conjecture for prime ideals in polynomial ringsComputational aspects of the coordinate ring of an algebraic varietyBinomial idealsIdeals generated by quadrics exhibiting double exponential degreesUnnamed ItemSyzygies over a polynomial ringThe minimal components of the Mayr-Meyer ideals.W-Gröbner basis and monomial ideals under polynomial compositionSyzygies of curves in products of projective spacesSegre-driven radicality testingSyzygies for Metropolis base chainsLinear syzygies, hyperbolic Coxeter groups and regularityOn the maximal graded shifts of ideals and modulesTowards a structure theory for projective varieties of degree = codimension + 2Algebras defined by powers of determinantal idelasGrete Hermann and effective methods in geometryA construction of codimension three arithmetically Gorenstein subschemes of projective spaceA Gröbner basis technique for Padé approximationGENERALIZED REDUCTION TO COMPUTE TORIC IDEALSVanishing Theorems, A Theorem of Severi, and the Equations Defining Projective VarietiesComputation of Hilbert functionsFIRST SYZYGIES OF TORIC VARIETIES AND DIOPHANTINE EQUATIONS IN CONGRUENCEBounding the degrees of a minimal \(\mu\)-basis for a rational surface parametrizationMany associated primes of powers of primesSubadditivity of syzygies of Koszul algebrasMathematical vanity platesMacaulay-like marked basesHolonomic gradient descent for the Fisher-Bingham distribution on the \(d\)-dimensional sphereCurves of degree \(r+2\) in \(\mathbb{P}^r\): Cohomological, geometric, and homological aspectsProperness defects of projection and minimal discriminant varietyA surjectivity theorem for differential operators on spaces of regular functionsPrecise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fieldsOn the parallel complexity of the polynomial ideal membership problemLinearization of resolutions via productsReduced Gorenstein codimension three subschemes of projective spaceCounterexamples to the Eisenbud–Goto regularity conjectureOn polynomial vector fields having a given affine variety as attractive and invariant set: application to roboticsA new lower bound construction for commutative Thue systems with applicationsA sharp bound for the Castelnuovo-Mumford regularity of subspace arrangements.Linearly presented modules and bounds on the Castelnuovo-Mumford regularity of ideals




Cites Work




This page was built for publication: On the complexity of computing syzygies