<html><head><meta http-equiv="Content-Type" content="text/html; charset=utf-8"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class="">Thank you for this, Roger,<div class=""><br class=""></div><div class="">Very good to have.</div><div class=""><br class=""></div><div class="">Eric</div><div class=""><br class=""></div><div class=""><br class=""><div><br class=""><blockquote type="cite" class=""><div class="">On Feb 24, 2022, at 11:26 AM, Roger Critchlow <<a href="mailto:rec@elf.org" class="">rec@elf.org</a>> wrote:</div><br class="Apple-interchange-newline"><div class=""><div dir="ltr" class="">There's a little news burp about hypergraphs in this month's CACM, mostly about how hard they are, except when they reduce to graphs, and that the NSF is funding some research efforts.<div class=""><br class=""></div><div class="">CACM, MARCH 2022, VOL . 65, NO. 3, DOI:10.1145/3510550<br class="">Chris Edwards, A Group Effort, Researchers look for new insights in the world of hypergraphs<br class=""><div class=""><br class=""></div><div class="">Further Reading<br class="">Agarwal, S., Branson, K., and Belongie, S. Higher-Order Learning with Graphs, Proceedings of the 23rd International Conference on Machine Learning (ICML 2006), pages 17–24</div><div class=""><br class=""></div><div class="">Jost, J. and Mulas, R., Normalized Laplace Operators for Hypergraphs with Real Coefficients, Journal of Complex Networks, Volume 9, Issue 1, February 2021, cnab009</div><div class=""><br class="">Hillar, C.J., and Lim, L.-H., Most Tensor Problems are NP-Hard, Journal of the ACM, 60, 6, Article 45, November 2013</div><div class=""><br class="">Veldt, N., Benson, A.R., and Kleinberg, J. Higher-order Homophily is Combinatorially Impossible, arXiv: 2103.11818 (2021), <a href="https://arxiv.org/" class="">https://arxiv.org/</a><br class="">abs/2103.1181<br class=""><div class=""><br class=""></div><div class="">-- rec --</div><div class=""><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif" class="">Further Reading</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif" class="">Agarwal, S., Branson, K., and Belongie, S.</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif" class="">Higher-Order Learning with Graphs</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif" class="">Proceedings of the 23rd International </span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif" class="">Conference on Machine Learning (ICML </span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif" class="">2006)</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif" class="">, pages 17–24</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif" class="">Jost, J. and Mulas, R.</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif" class="">Normalized Laplace Operators for </span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif" class="">Hypergraphs with Real Coefficients</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif" class="">Journal of Complex Networks</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif" class="">, Volume 9, </span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif" class="">Issue 1, February 2021, cnab009</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif" class="">Hillar, C.J., and Lim, L.-H.</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif" class="">Most Tensor Problems are NP-Hard</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif" class="">Journal of the ACM</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif" class="">, 60, 6, Article 45, </span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif" class="">November 2013</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif" class="">Veldt, N., Benson, A.R., and Kleinberg, J.</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif" class="">Higher-order Homophily</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif" class="">is Combinatorially Impossible</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif" class="">arXiv: 2103.11818 (2021)</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif" class="">, <a href="https://arxiv.org/" class="">https://arxiv.org/</a></span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif" class="">abs/2103.11818</span></div></div></div></div>
<br class="">.-- .- -. - / .- -.-. - .. --- -. ..--.. / -.-. --- -. .--- ..- --. .- - .<br class="">FRIAM Applied Complexity Group listserv<br class="">Zoom Fridays 9:30a-12p Mtn UTC-6 <a href="https://linkprotect.cudasvc.com/url?a=https%3a%2f%2f%2f%2fbit.ly%2fvirtualfriam&c=E,1,wESXHLhF_A9fMgD1_PYGHFY4lKSdDoNrN_I23_B5OgTdlhrFbN1sYHxd1P4_5Gd1TPkdpHocQ30zMHI_S3D0j3Kh6MFNq8vCpEVdxn3mtIrhRQU2&typo=1" class="">https://linkprotect.cudasvc.com/url?a=https%3a%2f%2f%2f%2fbit.ly%2fvirtualfriam&c=E,1,wESXHLhF_A9fMgD1_PYGHFY4lKSdDoNrN_I23_B5OgTdlhrFbN1sYHxd1P4_5Gd1TPkdpHocQ30zMHI_S3D0j3Kh6MFNq8vCpEVdxn3mtIrhRQU2&typo=1</a><br class="">un/subscribe <a href="https://linkprotect.cudasvc.com/url?a=http%3a%2f%2fredfish.com%2fmailman%2flistinfo%2ffriam_redfish.com&c=E,1,gbR3NW7yvh6njQjIm3mwfCyWde1zchF6xw-hiORaZXDPAOOPSB2Lue-k0ml57EHVTf43W2y6b1JTdC9u0DCD8Lb_vXSr3FAlD_SWeS0ZEg,,&typo=1" class="">https://linkprotect.cudasvc.com/url?a=http%3a%2f%2fredfish.com%2fmailman%2flistinfo%2ffriam_redfish.com&c=E,1,gbR3NW7yvh6njQjIm3mwfCyWde1zchF6xw-hiORaZXDPAOOPSB2Lue-k0ml57EHVTf43W2y6b1JTdC9u0DCD8Lb_vXSr3FAlD_SWeS0ZEg,,&typo=1</a><br class="">FRIAM-COMIC <a href="https://linkprotect.cudasvc.com/url?a=http%3a%2f%2ffriam-comic.blogspot.com%2f&c=E,1,jnDXzQpquRiGHWw_bpK81A-V0LrQtWWVZXyNsb0bDiK60I1ZdCSP4XyI6mKCm5Jm7bZrNcM5mO16cJgdz8Tpc8Jp6lNscF-XMmtKrUuhaUsx4Cv-4IMDsXE,&typo=1" class="">https://linkprotect.cudasvc.com/url?a=http%3a%2f%2ffriam-comic.blogspot.com%2f&c=E,1,jnDXzQpquRiGHWw_bpK81A-V0LrQtWWVZXyNsb0bDiK60I1ZdCSP4XyI6mKCm5Jm7bZrNcM5mO16cJgdz8Tpc8Jp6lNscF-XMmtKrUuhaUsx4Cv-4IMDsXE,&typo=1</a><br class="">archives:<br class=""> 5/2017 thru present <a href="https://linkprotect.cudasvc.com/url?a=https%3a%2f%2fredfish.com%2fpipermail%2ffriam_redfish.com%2f&c=E,1,XzgeCCgWXbci1RFJi0qrfDM_Vl_ixyh1EDxsZnBoDE4a2xT07FVU6b8B8abjydqCEKgL1SOU2Ywz5JQVkLDO3FgrNyTzQZlHELrUnH0Kd1NnSwF7dKEtuJKQ24k,&typo=1" class="">https://linkprotect.cudasvc.com/url?a=https%3a%2f%2fredfish.com%2fpipermail%2ffriam_redfish.com%2f&c=E,1,XzgeCCgWXbci1RFJi0qrfDM_Vl_ixyh1EDxsZnBoDE4a2xT07FVU6b8B8abjydqCEKgL1SOU2Ywz5JQVkLDO3FgrNyTzQZlHELrUnH0Kd1NnSwF7dKEtuJKQ24k,&typo=1</a><br class=""> 1/2003 thru 6/2021 <a href="http://friam.383.s1.nabble.com/" class="">http://friam.383.s1.nabble.com/</a><br class=""></div></blockquote></div><br class=""></div></body></html>