scientific article; zbMATH DE number 1302473
From MaRDI portal
Publication:4247789
Software, source code, etc. for problems pertaining to commutative algebra (13-04) Ideals and multiplicative ideal theory in commutative rings (13A15) 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) Symbolic computation and algebraic computation (68W30)
Recommendations
Cited in
(61)- Evaluation techniques for zero-dimensional primary decomposition
- Direct methods for primary decomposition
- Cohomology, stratifications and parametric Gröbner bases in characteristic zero.
- Applications of some properties of the canonical module in computational projective algebraic geometry
- Computer algebra and algebraic geometry -- achievements and perspectives
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety
- Computing the primary decomposition of zero-dimensional ideals
- Usage of modular techniques for efficient computation of ideal operations
- Numerical computation of H-bases
- Subexponential-time computation of isolated primary components of a polynomial ideal
- Primary ideals and their differential equations
- On singularities of real algebraic sets and applications to kinematics
- Noetherian operators and primary decomposition
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
- Effective algorithm for computing Noetherian operators of zero-dimensional ideals
- Efficient localization at a prime ideal without producing unnecessary primary components
- Normal projection: deterministic and probabilistic algorithms
- Parallelization of modular algorithms
- Computing syzygies by Faugère's \(\mathbb{F}_{5}\) algorithm
- Algebraic geometry of Bayesian networks
- Computing restrictions of ideals in finitely generated \(k\)-algebras by means of Buchberger's algorithm
- Implementation of prime decomposition of polynomial ideals over small finite fields
- Primary decomposition in \textsc{Singular}
- Primary decompositions with sections on Macaulay2 and networks
- Primary decomposition of zero-dimensional ideals over finite fields
- Asymptotically fast group operations on Jacobians of general curves
- Efficient Algorithms for Computing Nœther Normalization
- scientific article; zbMATH DE number 17840 (Why is no real title available?)
- scientific article; zbMATH DE number 2077081 (Why is no real title available?)
- scientific article; zbMATH DE number 2156369 (Why is no real title available?)
- Random arithmetic formulas can be reconstructed efficiently
- Computing H-bases via minimal bases for syzygy modules
- Symbolic Rees algebras
- Numerical algorithms for detecting embedded components
- Algorithms for primary decomposition in SINGULAR
- Algorithms for primary decomposition of modules
- Efficient computation of Castelnuovo-Mumford regularity
- A new approach to primary decomposition
- Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability
- A Direttissimo Algorithm for Equidimensional Decomposition
- Extended \(F_5\) criteria
- Conormal spaces and Whitney stratifications
- Primary decomposition of squarefree pseudomonomial ideals
- A signature-based algorithm for computing the nondegenerate locus of a polynomial system
- Primary Decomposition with Differential Operators
- Segre-driven radicality testing
- Correction to: ``Conormal spaces and Whitney stratifications.
- An algorithm for primary decomposition in polynomial rings over the integers
- Efficient algorithms for finite \(\mathbb{Z}\)-algebras
- Primary decomposition of symmetric ideals
- Faster computation of Whitney stratifications and their minimization
- A syzygial method for equidimensional decomposition
- First-order factors of linear Mahler operators
- Decomposition of polynomial ideals into triangular regular sequences
- Computing minimal associated primes in polynomial rings over the integers
- Algorithms for computing a primary ideal decomposition without producing intermediate redundant components
- Minimal staggered linear bases and their applications
- Sum-and-quotient characteristic decomposition of polynomial ideals
- Primary decomposition. II: Primary components and linear growth
- Noether normalization guided by monomial cone decompositions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247789)
