Sounds like SmartTensors from LANL might be what you want? I’m not sure if that does integers. It focuses only on non-negative I think.
From: Friam <friam-boun...@redfish.com> On Behalf Of Jon Zingale Sent: Wednesday, November 3, 2021 1:13 PM To: friam@redfish.com Subject: [FRIAM] Looking for an algorithm Hey all, Given a square matrix over Z2, how do I find whether or not it is the tensor product of two simpler square matrices? Are there well-known algorithms for deciding this as well as for finding what matrices the original *can be* factored into? [*] Because it is obvious that such factorizations will not always be unique even over the field Z2.
.-- .- -. - / .- -.-. - .. --- -. ..--.. / -.-. --- -. .--- ..- --. .- - . FRIAM Applied Complexity Group listserv Zoom Fridays 9:30a-12p Mtn UTC-6 bit.ly/virtualfriam un/subscribe http://redfish.com/mailman/listinfo/friam_redfish.com FRIAM-COMIC http://friam-comic.blogspot.com/ archives: 5/2017 thru present https://redfish.com/pipermail/friam_redfish.com/ 1/2003 thru 6/2021 http://friam.383.s1.nabble.com/
