Complexity of elements in rings
For an associative ring \(R\) with identity element the symbol \(U(R)\) denotes the group of units of \(R\). If \(S\) is a subset of \(R\), then the rational closure \(D\) of \(S\) in \(R\) is the smallest subring of \(R\) containing \(S\) and such that \(U(D)=D\cap U(R)\). In the second part the authors present a new approach to the complexity of elements in \(D\). This allows to give new proofs of all important results concerning the structure of \(D\). The third part investigates the interaction between complexity and addition, while the last one is devoted to complexity and multiplication.
- Complexity of ring morphism problems
- Complexes of rings
- Arithmetic complexity in ring extensions
- scientific article; zbMATH DE number 3044413
- Rings of low multiplicative complexity
- The complexity of decomposability of computable rings
- scientific article; zbMATH DE number 3889515
- The complexity of equivalence for commutative rings
- scientific article; zbMATH DE number 42730
- Computing combinatorial decompositions of rings
This page was built for publication: Complexity of elements in rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1868341)