Decomposing finite Z-algebras
DOI10.1016/J.JALGEBRA.2024.10.027MaRDI QIDQ6667385FDOQ6667385
Martin Kreuzer, Florian Walsh, Alexei D. Miasnikov
Publication date: 20 January 2025
Published in: Journal of Algebra (Search for Journal in Brave)
bilinear mapLie ringprimitive idempotentalgebra decompositiondirectly indecomposable factormaximal ring of scalars
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects of associative rings (general theory) (16Z05) Finite rings and finite-dimensional associative algebras (16P10)
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?)
- Direct methods for primary decomposition
- Gröbner bases and primary decomposition of polynomial ideals
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Efficient decomposition of associative algebras over finite fields
- On Systems of Linear Diophantine Equations
- How to compute the Wedderburn decomposition of a finite-dimensional associative algebra.
- Formularity of sets of Mal'tsev bases, and elementary theories of finite algebras. I
- Definable invariants of bilinear mappings
- Formularity of sets of Mal'tsev bases, and elementary theories of finite- dimensional algebras. II
- THE STRUCTURE OF MODELS AND A DECIDABILITY CRITERION FOR COMPLETE THEORIES OF FINITE-DIMENSIONAL ALGEBRAS
- An algorithm for primary decomposition in polynomial rings over the integers
- Elementary equivalence of rings with finitely generated additive groups
- Computational Linear and Commutative Algebra
- Efficient algorithms for finite \(\mathbb{Z}\)-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)
