Efficient algorithms for finite \(\mathbb{Z}\)-algebras

DOI10.46298/jgcc.2024.15.2.12496MaRDI QIDQ6601470

Martin Kreuzer, Florian Walsh

Publication date: 10 September 2024

Published in: Journal of Groups, Complexity, Cryptology (Search for Journal in Brave)

zbMATH Keywords

primitive idempotentspolynomial complexityefficient algorithmprimary decompositionfinite \(\mathbb{Z}\)-algebra

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Syzygies, resolutions, complexes and commutative rings (13D02)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for primary decomposition in polynomial rings over the integers
• Factoring polynomials with rational coefficients
• Algorithms for commutative algebras over the rational numbers
• The decomposition theorem for ideals in polynomial rings over a domain
• Efficient decomposition of associative algebras over finite fields
• Computing zero-dimensional schemes
• Computing the structure of finite algebras
• Computational Linear and Commutative Algebra
• Primary decomposition of zero-dimensional ideals over finite fields
• Trading GRH for algebra: Algorithms for factoring polynomials and related structures
• Constructions in a Polynomial Ring Over the Ring of Integers
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Modern computer algebra
• On Systems of Linear Diophantine Equations
• Factoring Polynomials Over Large Finite Fields
• Factoring polynomials over finite fields: A survey
• On the deterministic complexity of factoring polynomials

Related Items (1)

Decomposing finite \(\mathbb{Z}\)-algebras

This page was built for publication: Efficient algorithms for finite \(\mathbb{Z}\)-algebras