Localization and primary decomposition of polynomial ideals
From MaRDI portal
Publication:674744
DOI10.1006/JSCO.1996.0052zbMATH Open0874.13022OpenAlexW2027044504MaRDI QIDQ674744FDOQ674744
Authors: Takeshi Shimoyama, Kazuhiro Yokoyama 
Publication date: 6 March 1997
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1996.0052
Recommendations
Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Ideals and multiplicative ideal theory in commutative rings (13A15)
Cited In (61)
- Title not available (Why is that?)
- Cellular binomial ideals. Primary decomposition of binomial ideals
- Effective algorithm for computing Noetherian operators of zero-dimensional ideals
- Calculations involving symbolic powers
- Computing strong regular characteristic pairs with Gröbner bases
- Efficient localization at a prime ideal without producing unnecessary primary components
- Stanley decompositions in localized polynomial rings
- Brane webs and magnetic quivers for SQCD
- Jacobian ideals of trilinear forms: An application of 1-genericity
- Mode decomposition of global bifurcation diagram with Gröbner bases
- Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety
- Characteristic decomposition: from regular sets to normal sets
- Algorithms for computing triangular decomposition of polynomial systems
- Title not available (Why is that?)
- An approach to solving systems of polynomials via modular arithmetics with applications
- Direct methods for primary decomposition
- Algebraic geometry of Bayesian networks
- Center problem for third-order ODEs
- One class of planar rational involutions
- Isochronicity and normal forms of polynomial systems of ODEs
- Integrability conditions for Lotka-Volterra planar complex quintic systems
- A new approach to primary decomposition
- Implementation of prime decomposition of polynomial ideals over small finite fields
- The cyclicity of a cubic system
- Primary Decomposition in Singular
- Primary decomposition of zero-dimensional ideals over finite fields
- Parallelization of modular algorithms
- Evaluation techniques for zero-dimensional primary decomposition
- The minimal components of the Mayr-Meyer ideals.
- New algorithms for computing primary decomposition of polynomial ideals
- Subexponential-time computation of isolated primary components of a polynomial ideal
- Primary Decompositions
- A simple introduction to Gröbner basis methods in string phenomenology
- Noetherian operators and primary decomposition
- On systems of algebraic equations with parametric exponents. II
- A connectedness result in positive characteristic
- Decomposition of polynomial sets into characteristic pairs
- Title not available (Why is that?)
- Time-reversibility in 2-dimensional systems
- Algorithms for computing a primary ideal decomposition without producing intermediate redundant components
- Primary decomposition of squarefree pseudomonomial ideals
- Estimating the number of limit cycles in polynomial systems
- Algorithms for \(D\)-modules -- restriction, tensor product, localization, and local cohomology groups
- Applications of some properties of the canonical module in computational projective algebraic geometry
- The decision of prime and primary ideal
- On ideals in polynomial rings over localities
- On the primary decomposition of some determinantal hyperedge ideal
- An algorithm for primary decomposition in polynomial rings over the integers
- A hybrid symbolic-numerical approach to the center-focus problem
- Computation of inverses in residue class rings of parametric polynomial ideals
- Enlarging localized polynomial rings while preserving their prime ideal structure
- Parametric polynomial spectral factorization using the sum of roots and its application to a control design problem
- Algorithms for \(b\)-functions, restrictions, and algebraic local cohomology groups of \(D\)-modules
- Computer algebra and algebraic geometry -- achievements and perspectives
- Algorithm for primary submodule decomposition without producing intermediate redundant components
- On the structure of ideals in a family of skew polynomial rings
- Segre-driven radicality testing
- Syzygies, constant rank, and beyond
- A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface
- Effective Algorithm for Computing Noetherian Operators of Positive Dimensional Ideals
- Merging multiple algorithms for computing comprehensive Gröbner systems using parallel processing
Uses Software
This page was built for publication: Localization and primary decomposition of polynomial ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674744)
