An algorithm to compute the set of characteristics of a system of polynomial equations over the integers.
From MaRDI portal
Publication:1401152
DOI10.1016/S0747-7171(02)00134-7zbMath1058.13015MaRDI QIDQ1401152
Publication date: 17 August 2003
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(02)00134-7
matroid; constructible set of prime ideals; Gröbner basis over the integers; set of characteristics; solvable system of multivariate polynomials
13-04: Software, source code, etc. for problems pertaining to commutative algebra
13F20: Polynomial rings and ideals; rings of integer-valued polynomials
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
11Y05: Factorization
Related Items
An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties, Von Staudt constructions for skew-linear and multilinear matroids, Confinement of matroid representations to subsets of partial fields, Lifts of matroid representations over partial fields, The templates for some classes of quaternary matroids
Uses Software
Cites Work