On Tensor-Factorisation Problems,I: The Combinatorial Problem

DOI10.1112/S1461157000001054MaRDI QIDQ4827625zbMATH OpenOpenAlexFDO

Authors Peter M. Neumann, Cheryl E. Praeger

Publication date 18 November 2004

Published in LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL http://www.lms.ac.uk/jcm/7/lms2003-031/

zbMATH Keywords

tensor productpolynomial-time algorithmmultisetfactorisationdivision-problem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Software, source code, etc. for problems pertaining to group theory (20-04)

Recommendations

• On tensor products of matrix factorizations
• Combinatorics in tensor-integral reduction
• On the properties of tensor complementarity problems
• Tensor complementarity problems. I: Basic theory
• Tensor decompositions and rank increment conjecture
• Comon's conjecture, rank decomposition, and symmetric rank decomposition of symmetric tensors
• Tensor complementarity problems. III: Applications
• scientific article; zbMATH DE number 7387190
• Tensor complementarity problems. II: Solution methods
• On decomposition of tensor products into irreducible components

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• An Algorithm for Recognising the Exterior Square of a Multiset
• An algorithm for recognising the exterior square of a matrix
• On random polynomials over finite fields

Cited in

(3)

• Combinatorics in tensor-integral reduction
• A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum
• An Algorithm for Recognising the Exterior Square of a Multiset

This page was built for publication: On Tensor-Factorisation Problems,I: The Combinatorial Problem

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