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