<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Counting, Symmetries and Equivalence Classes of Sudoku Grids · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2607.20669/</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/2607.20669/feed.xml" rel="self" type="application/rss+xml" /><item><title>Counting, Symmetries and Equivalence Classes of Sudoku Grids — mentioned by gilleain</title><link>https://news.ycombinator.com/item?id=49711365</link><guid isPermaLink="false">urn:hackerpapers:mention:2607.20669:49711365</guid><pubDate>Tue, 15 Sep 2026 12:13:50 GMT</pubDate><description>&lt;p&gt;There is a way of understanding all this through group theory. eg: https://arxiv.org/html/2607.20669 &amp;#x27;Counting, Symmetries and Equivalence Classes of Sudoku Grids&amp;#x27; where an &amp;#x27;equivalence class&amp;#x27; is a set of structures (such as filled Sudoku grids) that are all equivalent under some relation.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2607.20669/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.GM</category></item></channel></rss>
