scientific article; zbMATH DE number 1253966

MaRDI QIDQ4226940zbMATH OpenFDO

Authors Gábor Ivanyos, A. L. Chistov, Marek Karpinski

Publication date 30 May 1999

zbMATH Keywords

finite-dimensional algebrasfinite fieldsnumber fieldspolynomial time algorithmsmodule isomorphism problemdirect sums of indecomposable modules

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Computational aspects of associative rings (general theory) (16Z05) Representations of orders, lattices, algebras over commutative rings (16G30)

Recommendations

• Testing isomorphism of modules.
• The module isomorphism problem reconsidered.
• Computation of lattice isomorphisms and the integral matrix similarity problem
• Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\)
• The multiplicity problem for indecomposable decompositions of modules over a finite-dimensional algebra. Algorithms and a computer algebra approach

Cited in

(36)

• Persistence modules on commutative ladders of finite type
• scientific article; zbMATH DE number 1415872 (Why is no real title available?)
• The multiplicity problem for indecomposable decompositions of modules over a finite-dimensional algebra. Algorithms and a computer algebra approach
• The graph isomorphism problem and approximate categories
• Classical complexity and quantum entanglement
• Determinant Equivalence Test over Finite Fields and over Q
• Matrix method for persistence modules on commutative ladders of finite type
• On the computational complexity of Bongartz's algorithm
• Algorithms based on \(*\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
• On the multiplicity problem and the isomorphism problem for the four subspace algebra
• Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\)
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
• Two-closure of rank \(3\) groups in polynomial time
• Noncommutative polynomials describing convex sets
• On the normal forms of modules with respect to parametrizing bimodules.
• Splitting full matrix algebras over algebraic number fields.
• Linear Representation of Graphs: Applications to Molecular Graphs
• A polynomial time algorithm to compute the Abelian kernel of a finite monoid
• The module isomorphism problem reconsidered.
• Non-commutative Edmonds' problem and matrix semi-invariants
• Algorithms based on \(\ast\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
• Matrix coefficient realization theory of noncommutative rational functions
• Subspace arrangements, graph rigidity and derandomization through submodular optimization
• General linear group action on tensors: a candidate for post-quantum cryptography
• A polynomial time algorithm for computing the HNF of a module over the integers of a number field
• Testing isomorphism of modules.
• Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
• Computation of lattice isomorphisms and the integral matrix similarity problem
• Generalized Wong sequences and their applications to Edmonds' problems
• Trading GRH for algebra: algorithms for factoring polynomials and related structures
• Tensor isomorphism by conjugacy of Lie algebras
• Ranks of linear matrix pencils separate simultaneous similarity orbits
• Invariant Grassmannians and a K3 surface with an action of order 192*2
• Algorithms for group isomorphism via group extensions and cohomology
• Exact hierarchical reductions of dynamical models via linear transformations
• Approximations of isomorphism and logics with linear-algebraic operators

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4226940)