Parametric systems of linear congruences.
This is a continuation of the authors' previous work [Matzat, B. Heinrich (ed.) et al., Algorithmic algebra and number theory. Selected papers from a conference, Heidelberg, 1997, Berlin: Springer, 221--247 (1999; Zbl 0934.68130)] on quantifier elimination. They use an extended quantifier elimination procedure for discretely valued fields, and devise algorithms for solving multivariate systems of linear congruences over the integers. Their computational methods split into two stages -- first finding solutions in suitable rings of \(p\)-adic integers, secondly lifting these solutions to the integers. The first stage is computationally hard, unlike the second which is efficient and straightforward. In special case when each modulus is a power of a fixed prime, the first stage can be worked out uniformly for all primes. The authors claim this to be the main advantage of their methods over the well-known methods in linear algebra for concrete fixed primes. Then for the uniform case, they have devised methods for making the lifting step as uniform as possible. Then these methods can be used in the more general case of arbitrary moduli. For the entire collection see [Zbl 0970.00027].
- Solution of systems of linear Diophantine equations
- A bibliography of quantifier elimination for real closed fields
- Applying Linear Quantifier Elimination
- QE software based on comprehensive Gröbner systems
- scientific article; zbMATH DE number 2151242
- On QE algorithms over an algebraically closed field based on comprehensive Gröbner systems
- Systems of algebraic equations with bad reduction
- scientific article; zbMATH DE number 503245
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
This page was built for publication: Parametric systems of linear congruences.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760201)
