A general framework for Noetherian well ordered polynomial reductions
From MaRDI portal
Publication:2000264
DOI10.1016/J.JSC.2019.02.002zbMATH Open1430.13043arXiv1511.03234OpenAlexW2963099234MaRDI QIDQ2000264FDOQ2000264
Michela Ceria, Margherita Roggero, Ferdinando Mora
Publication date: 28 June 2019
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Abstract: Polynomial reduction is one of the main tools in computational algebra with innumerable applications in many areas, both pure and applied. Since many years both the theory and an efficient design of the related algorithm have been solidly established. This paper presents a general definition of polynomial reduction structure, studies its features and highlights the aspects needed in order to grant and to efficiently test the main properties (noetherianity, confluence, ideal membership). The most significant aspect of this analysis is a negative reappraisal of the role of the notion of term order which is usually considered a central and crucial tool in the theory. In fact, as it was already established in the computer science context in relation with termination of algorithms, most of the properties can be obtained simply considering a well-founded ordering, while the classical requirement that it be preserved by multiplication is irrelevant. The last part of the paper shows how the polynomial basis concepts present in literature are interpreted in our language and their properties are consequences of the general results established in the first part of the paper.
Full work available at URL: https://arxiv.org/abs/1511.03234
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Parametrization (Chow and Hilbert schemes) (14C05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The diamond lemma for ring theory
- Involutive bases of polynomial ideals
- Minimal involutive bases
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Involution. The formal theory of differential equations and its applications in computer algebra
- Proving termination with multiset orderings
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- Algebraic simplification
- Eine Bedingung für die Flachheit und das Hilbertpolynom eines graduierten Ringes
- A note on polynomial reduction
- Upgraded methods for the effective computation of marked schemes on a strongly stable ideal
- A Borel open cover of the Hilbert scheme
- Flat families by strongly stable ideals and a generalization of Gröbner bases
- Computing quot schemes via marked bases over quasi-stable modules
- Functors of liftings of projective schemes
- Extensors and the Hilbert scheme
- On the functoriality of marked families
- What can be computed in algebraic geometry?
- The Locus of Points of the Hilbert Scheme with Bounded Regularity
- Segments and Hilbert schemes of points
- Rational components of Hilbert schemes
- Non-commutative Gröbner bases in algebras of solvable type
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- La queste del Saint \(\text{Gr}_ a(\text{AL})\): A computational approach to local algebra
- On the construction of Gröbner bases using syzygies
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- On an installation of Buchberger's algorithm
- An algorithm for constructing Gröbner and free Schreier bases in free group algebras
- Skew polynomial rings with binomial relations
- Noetherian Properties of Skew Polynomial Rings with Binomial Relations
- A combinatorial approach to involution and \(\delta \)-regularity. II: Structure analysis of polynomial modules with Pommaret bases
- The theory of involutive divisions and an application to Hilbert function computations
- Term-ordering free involutive bases
- Computer Algebra in Scientific Computing
- Double-generic initial ideal and Hilbert scheme
- Quasi-stable ideals and Borel-fixed ideals with a given Hilbert polynomial
- A generalization of reduction rings
- On the D-bases of polynomial ideals over principal ideal domains
- Bezoutian and quotient ring structure
- Gröbner bases in function rings -- a guide for introducing reduction relations to algebraic structures
- Solving Polynomial Equation Systems
- Gröbner bases of modules over reduction rings
- On the Noetherianity of some associative finitely presented algebras
- Bar code for monomial ideals
- Buchberger-Zacharias theory of multivariate Ore extensions
- Gröbner bases and generalized sylvester matrices
- The reduction ring property is hereditary
- Involutive Division Generated by an Antigraded Monomial Ordering
- Smoothable Gorenstein Points Via Marked Schemes and Double-generic Initial Ideals
- Borel degenerations of arithmetically Cohen-Macaulay curves in \(\mathbb{P}^{3}\)
- The scheme of liftings and applications
- Computation and simplification in lie fields
- Computer Algebra in Scientific Computing
- Buchberger-Weispfenning theory for effective associative rings
- De nugis Groebnerialium. IV: Zacharias, Spears, Möller
- Automated Reasoning in Reduction Rings Using the Theorema System
- Macaulay-like marked bases
Cited In (4)
Uses Software
This page was built for publication: A general framework for Noetherian well ordered polynomial reductions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000264)
