scientific article; zbMATH DE number 2166957
From MaRDI portal
Publication:4674258
zbMath1161.13306MaRDI QIDQ4674258
Publication date: 9 May 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Polynomials in number theory (11C08) Research exposition (monographs, survey articles) pertaining to commutative algebra (13-02)
Related Items
Unnamed Item ⋮ Border bases for lattice ideals ⋮ Standard bases in mixed power series and polynomial rings over rings ⋮ Unnamed Item ⋮ Computing Gröbner bases associated with lattices ⋮ Smoothable Gorenstein Points Via Marked Schemes and Double-generic Initial Ideals ⋮ A Pommaret bases approach to the degree of a polynomial ideal ⋮ Gröbner bases for polynomial systems with parameters ⋮ F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases ⋮ The scheme of liftings and applications ⋮ Quantifying the unstable in linearized nonlinear systems ⋮ Axioms for a theory of signature bases ⋮ An FGLM-like algorithm for computing the radical of a zero-dimensional ideal ⋮ A new algorithm for computing staggered linear bases ⋮ Standard bases over Euclidean domains ⋮ Symmetric decomposition of the associated graded algebra of an Artinian Gorenstein algebra ⋮ Involutive bases algorithm incorporating F\(_5\) criterion ⋮ The Generalized Rabinowitsch Trick ⋮ Segments and Hilbert schemes of points ⋮ Recursive structures in involutive bases theory ⋮ A survey on signature-based algorithms for computing Gröbner bases ⋮ Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals ⋮ Gröbner bases of Hilbert ideals of alternating groups ⋮ Grete Hermann and effective methods in geometry ⋮ On the bit complexity of polynomial system solving ⋮ Gröbner basis approach to list decoding of algebraic geometry codes ⋮ Toward a theory of monomial preorders ⋮ An algorithmic approach to resolutions ⋮ Double-generic initial ideal and Hilbert scheme ⋮ On the construction of staggered linear bases ⋮ Bar code for monomial ideals ⋮ From grids to pseudo-grids of lines: Resolution and seminormality ⋮ Buchberger-Zacharias theory of multivariate Ore extensions ⋮ On the use of Buchberger criteria in \(\mathrm G^2\mathrm V\) algorithm for calculating Gröbner bases ⋮ Improved evaluation codes defined by plane valuations ⋮ Improved decoding of affine-variety codes ⋮ Gröbner bases and combinatorics for binary codes ⋮ The F5 criterion revised ⋮ Flat families by strongly stable ideals and a generalization of Gröbner bases ⋮ Dimension and depth dependent upper bounds in polynomial ideal theory ⋮ Zacharias representation of effective associative rings ⋮ Degree upper bounds for involutive bases ⋮ Multivariate polynomial interpolation with perturbed data ⋮ The Approach of Moments for Polynomial Equations ⋮ Minimal free resolutions of some configurations of fat lines ⋮ Multiple zeros of nonlinear systems ⋮ Computing Equilibrium Points of Genetic Regulatory Networks ⋮ Computation of Macaulay constants and degree bounds for Gröbner bases ⋮ HELP: a sparse error locator polynomial for BCH codes ⋮ Effective algorithm for computing Noetherian operators of zero-dimensional ideals ⋮ Computing an Invariant of a Linear Code
