<div dir="ltr"><a href="https://en.wikipedia.org/wiki/Low-rank_approximation">https://en.wikipedia.org/wiki/Low-rank_approximation</a>, <a href="https://www.quora.com/What-is-the-meaning-of-low-rank-matrix">https://www.quora.com/What-is-the-meaning-of-low-rank-matrix</a><div><br></div><div>-- rec --</div></div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Wed, Nov 3, 2021 at 6:43 PM Frank Wimberly <<a href="mailto:wimberly3@gmail.com">wimberly3@gmail.com</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div dir="auto">Usually by the tensor product of two matrices peopleean the Kronecker product.  Is that what you mean?<br><br><div>---<br>Frank C. Wimberly<br>140 Calle Ojo Feliz, <br>Santa Fe, NM 87505<br><br>505 670-9918<br>Santa Fe, NM</div></div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Wed, Nov 3, 2021, 2:13 PM Jon Zingale <<a href="mailto:jonzingale@gmail.com" target="_blank">jonzingale@gmail.com</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div dir="ltr"><div class="gmail_default" style="font-family:verdana,sans-serif;font-size:small;color:rgb(51,51,51)">Hey all,</div><div class="gmail_default" style="font-family:verdana,sans-serif;font-size:small;color:rgb(51,51,51)"><br></div><div class="gmail_default" style="font-family:verdana,sans-serif;font-size:small;color:rgb(51,51,51)">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?</div><div class="gmail_default" style="font-family:verdana,sans-serif;font-size:small;color:rgb(51,51,51)"><br></div><div class="gmail_default" style="font-family:verdana,sans-serif;font-size:small;color:rgb(51,51,51)">[*] Because it is obvious that such factorizations will not always be unique even over the field Z2.</div></div>
<br>
.-- .- -. - / .- -.-. - .. --- -. ..--.. / -.-. --- -. .--- ..- --. .- - .<br>
FRIAM Applied Complexity Group listserv<br>
Zoom Fridays 9:30a-12p Mtn UTC-6  <a href="http://bit.ly/virtualfriam" rel="noreferrer noreferrer" target="_blank">bit.ly/virtualfriam</a><br>
un/subscribe <a href="http://redfish.com/mailman/listinfo/friam_redfish.com" rel="noreferrer noreferrer" target="_blank">http://redfish.com/mailman/listinfo/friam_redfish.com</a><br>
FRIAM-COMIC <a href="http://friam-comic.blogspot.com/" rel="noreferrer noreferrer" target="_blank">http://friam-comic.blogspot.com/</a><br>
archives:<br>
 5/2017 thru present <a href="https://redfish.com/pipermail/friam_redfish.com/" rel="noreferrer noreferrer" target="_blank">https://redfish.com/pipermail/friam_redfish.com/</a><br>
 1/2003 thru 6/2021  <a href="http://friam.383.s1.nabble.com/" rel="noreferrer noreferrer" target="_blank">http://friam.383.s1.nabble.com/</a><br>
</blockquote></div>
<br>
.-- .- -. - / .- -.-. - .. --- -. ..--.. / -.-. --- -. .--- ..- --. .- - .<br>
FRIAM Applied Complexity Group listserv<br>
Zoom Fridays 9:30a-12p Mtn UTC-6  <a href="http://bit.ly/virtualfriam" rel="noreferrer" target="_blank">bit.ly/virtualfriam</a><br>
un/subscribe <a href="http://redfish.com/mailman/listinfo/friam_redfish.com" rel="noreferrer" target="_blank">http://redfish.com/mailman/listinfo/friam_redfish.com</a><br>
FRIAM-COMIC <a href="http://friam-comic.blogspot.com/" rel="noreferrer" target="_blank">http://friam-comic.blogspot.com/</a><br>
archives:<br>
 5/2017 thru present <a href="https://redfish.com/pipermail/friam_redfish.com/" rel="noreferrer" target="_blank">https://redfish.com/pipermail/friam_redfish.com/</a><br>
 1/2003 thru 6/2021  <a href="http://friam.383.s1.nabble.com/" rel="noreferrer" target="_blank">http://friam.383.s1.nabble.com/</a><br>
</blockquote></div>