New constructive methods in classical ideal theory
From MaRDI portal
Publication:1090369
DOI10.1016/0021-8693(86)90071-2zbMath0621.13007OpenAlexW2171317148MaRDI QIDQ1090369
Ferdinando Mora, Hans-Michael Möller
Publication date: 1986
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-8693(86)90071-2
Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Ideals and multiplicative ideal theory in commutative rings (13A15)
Related Items
ON THE IDEALS OF MINORS OF PLURI-CIRCULANT MATRICES, A solution of the Cauchy problem for multidimensional discrete linear shift-invariant systems, Gröbner bases of ideals defined by functionals with an application to ideals of projective points, Upper bounds for the betti numbers of a given hilbert function, The syzygies of m-full ideals, Applications of Gröbner bases to signal and image processing: a survey, Application of the Generalized Weierstrass Preparation Theorem to the Study of Homogeneous Ideals, Unnamed Item, A theorem on refining division orders by the reverse lexicographic order, Canonical forms for polynomial and quadratic differential operators, Normal Rees algebras, Gotzmann theorems for exterior algebras and combinatorics, Computing minimal finite free resolutions, A new explicit finite free resolution of ideals generated by monomials in an R-sequence, Computing a Gröbner basis of a polynomial ideal over a Euclidean domain, An extension of Buchberger's algorithm and calculations in enveloping fields of Lie algebras, On an implementation of standard bases and syzygies in SINGULAR, Stability of Gröbner bases, The Gröbner fan of an ideal, Computational aspects of the coordinate ring of an algebraic variety, A p-adic approach to the computation of Gröbner bases, On an installation of Buchberger's algorithm, A combinatorial result on Gröbner fans with an application to universal Gröbner bases, Advances and improvements in the theory of standard bases and syzygies, Ideals of generic minors, Signature Gröbner bases in free algebras over rings, On the computation of parametric Gröbner bases for modules and syzygies, W-Gröbner basis and monomial ideals under polynomial composition, Computing syzygies by Faugère's \(\mathbb{F}_{5}\) algorithm, Moduln über Streckungsringen. (Modules over rings with straightening laws), Upper bounds for the number of facets of a simplicial complex, On the construction of Gröbner bases using syzygies, On the computation of generalized standard bases, Gröbner bases, H–bases and interpolation, Computational algebraic geometry of projective configurations, Computing the conductor of an integral extension, La queste del Saint \(\text{Gr}_ a(\text{AL})\): A computational approach to local algebra, Algorithms for the Quillen-Suslin theorem, 2D residual generation and dead-beat observers, A behavioral approach to identifiability of 2D scalar systems, A Gröbner basis technique for Padé approximation, Comprehensive Gröbner bases, Betti numbers, castelnuovo mumford regularity, and generalisations of macaulay's theorem, Standard Gröbner-Shirshov Bases of Free Algebras Over Rings, I, On lucky ideals for Gröbner basis computations, Gröbner bases and primary decomposition of modules, Solving a congruence on a graded algebra by a subresultant sequence and its application, Gröbner basis and the problem of contiguous relations, Buchberger-Zacharias theory of multivariate Ore extensions, Filtered-graded transfer of groebner basis computation in solvable polynomial algebras, Flat families by strongly stable ideals and a generalization of Gröbner bases, Syzygies among reduction operators, Computing H-bases via minimal bases for syzygy modules, On Invariant Relations between Zeros of Polynomials, Standard bases for modules over polynomial subalgebras, Regularity of ideals and their radicals, Computations in differential and difference modules, A minimal dimension polynomial of a field extension given by a system of linear differential equations, Computational ideal theory in finitely generated extension rings, Some remarks on the inverse systems of polynomial modules, Multivariate interpolation and standard bases for Macaulay modules, On decomposing systems of polynomial equations with finitely many solutions, Output feedback stabilizability and stabilization algorithms for 2D systems, The reduction ring property is hereditary, On the computation of Hilbert-Poincaré series
Cites Work
- Hilbert functions of graded algebras
- Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen
- Théorème de division et stabilité en géométrie analytique locale
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Resolution of singularities of an algebraic variety over a field of characteristic zero. I
- An improved algorithmic construction of Gröbner-bases for polynomial ideals
- A simplified proof of the characterization theorem for Gröbner-bases
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item