[FRIAM] Looking for an algorithm

[Roger Critchlow]

https://en.wikipedia.org/wiki/Low-rank_approximation,
https://www.quora.com/What-is-the-meaning-of-low-rank-matrix

-- rec --

On Wed, Nov 3, 2021 at 6:43 PM Frank Wimberly <wimberly3 at gmail.com> wrote:

> Usually by the tensor product of two matrices peopleean the Kronecker
> product.  Is that what you mean?
>
> ---
> Frank C. Wimberly
> 140 Calle Ojo Feliz,
> Santa Fe, NM 87505
>
> 505 670-9918
> Santa Fe, NM
>
> On Wed, Nov 3, 2021, 2:13 PM Jon Zingale <jonzingale at gmail.com> wrote:
>
>> 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/
>>
>
> .-- .- -. - / .- -.-. - .. --- -. ..--.. / -.-. --- -. .--- ..- --. .- - .
> 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/
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://redfish.com/pipermail/friam_redfish.com/attachments/20211104/aec373b9/attachment.html>