Decomposing finite Z-algebras
From MaRDI portal
Publication:6667385
Cites work
- An algorithm for primary decomposition in polynomial rings over the integers
- Computational linear and commutative algebra
- Definable invariants of bilinear mappings
- Direct methods for primary decomposition
- Efficient algorithms for finite \(\mathbb{Z}\)-algebras
- Efficient decomposition of associative algebras over finite fields
- Elementary equivalence of rings with finitely generated additive groups
- Formularity of sets of Mal'tsev bases, and elementary theories of finite algebras. I
- Formularity of sets of Mal'tsev bases, and elementary theories of finite- dimensional algebras. II
- Gröbner bases and primary decomposition of polynomial ideals
- How to compute the Wedderburn decomposition of a finite-dimensional associative algebra.
- scientific article; zbMATH DE number 1254290 (Why is no real title available?)
- scientific article; zbMATH DE number 1276816 (Why is no real title available?)
- scientific article; zbMATH DE number 1515218 (Why is no real title available?)
- scientific article; zbMATH DE number 5678901 (Why is no real title available?)
- On Systems of Linear Diophantine Equations
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- THE STRUCTURE OF MODELS AND A DECIDABILITY CRITERION FOR COMPLETE THEORIES OF FINITE-DIMENSIONAL ALGEBRAS
This page was built for publication: Decomposing finite \(\mathbb{Z}\)-algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6667385)