An algorithm to compute the set of characteristics of a system of polynomial equations over the integers.
DOI10.1016/S0747-7171(02)00134-7zbMATH Open1058.13015OpenAlexW1995058913MaRDI QIDQ1401152FDOQ1401152
Authors: Rosemary Baines, P. Vámos 
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
Recommendations
- Characteristic set algorithms for equation solving in finite fields
- Solving linear systems of equations over integers with Gröbner bases
- Solving polynomial systems in integers
- Zero decomposition algorithms for systems of polynomial equations
- A nonlinear algebraic matroid with infinite characteristic set
matroidconstructible set of prime idealsset of characteristicssolvable system of multivariate polynomialsGröbner basis over the integers
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) Factorization (11Y05) Software, source code, etc. for problems pertaining to commutative algebra (13-04)
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?)
- Lifting standard bases in filtered structures
- MATROID REPRESENTATIONS—AN ALGEBRAIC TREATMENT
- Title not available (Why is that?)
- Grobner bases and extension of scalars
- Note on Independence Functions
- Characteristic Sets of Matroids
- Title not available (Why is that?)
Cited In (5)
- The templates for some classes of quaternary matroids
- Confinement of matroid representations to subsets of partial fields
- Lifts of matroid representations over partial fields
- Von Staudt constructions for skew-linear and multilinear matroids
- An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties
Uses Software
This page was built for publication: An algorithm to compute the set of characteristics of a system of polynomial equations over the integers.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401152)
