Bounds and definability in polynomial rings
From MaRDI portal
Publication:3606485
Abstract: We study questions around the existence of bounds and the dependence on parameters for linear-algebraic problems in polynomial rings over rings of an arithmetic flavor.In particular, we show that the module of syzygies of polynomials with coefficients in a Pr"ufer domain can be generated by elements whose degrees are bounded by a number only depending on , and the degree of the . This implies that if is a B'ezout domain, then the generators can be parametrized in terms of the coefficients of using the ring operations and a certain division function, uniformly in .
Recommendations
Cited in
(12)- Bounds in polynomial rings over Artinian local rings
- Degree bounds for Gröbner bases in algebras of solvable type
- Polynomial bounds in polynomial rings over fields
- The power of primitive positive definitions with polynomially many variables
- Ideal membership in polynomial rings over the integers
- Algebraic Certificates of (Semi)Definiteness for Polynomials Over Fields Containing the Rationals
- Effective definability of Kolchin polynomials
- Height bounds, Nullstellensatz and primality
- Bounds and definablity over fields.
- Dimension and singularity theory for local rings of finite embedding dimension
- Bounded arithmetic and the polynomial hierarchy
- Polynomial bounds for rings of invariants
This page was built for publication: Bounds and definability in polynomial rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3606485)