<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Finding minimum bounded and homologous chains in simplicial complexes with bounded-treewidth 1-skeleton · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2107.10339/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2107.10339/feed.xml" rel="self" type="application/rss+xml" /><item><title>Finding minimum bounded and homologous chains in simplicial complexes with bounded-treewidth 1-skeleton — mentioned by rob-p</title><link>https://news.ycombinator.com/item?id=48840011</link><guid isPermaLink="false">urn:hackerpapers:mention:2107.10339:48840011</guid><pubDate>Thu, 09 Jul 2026 01:59:10 GMT</pubDate><description>&lt;p&gt;The abstract problem absolutely has legitimate interpretations outside of phylogenetics, and there are other ways to formulate the problem that directly relate to linear algebra over GF(2). Reformulating the problem in those contexts also failed. It is a legitimate, pure CS theory question, that itself relates quite closely so several other known results including in computational geometry https://arxiv.org/abs/2003.02801 https://doi.org/10.1016/j.comgeo.2024.102102 https://arxiv.org/abs/2107.10339 https://dl.acm.org/doi/10.1145/1998196.1998218 — DOI: 10.1145/1998196.1998218 The problem in…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2107.10339/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CG</category></item></channel></rss>
