<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Group Theory on AmeyArc</title><link>https://amey-thakur.github.io/tags/group-theory/</link><description>Recent content in Group Theory on AmeyArc</description><generator>Hugo -- 0.152.2</generator><language>en-us</language><lastBuildDate>Mon, 30 Nov 2026 09:00:00 -0500</lastBuildDate><atom:link href="https://amey-thakur.github.io/tags/group-theory/index.xml" rel="self" type="application/rss+xml"/><item><title>Length as Priority, Not Constraint: Search Geometry of the Andrews-Curtis Challenge Pool</title><link>https://amey-thakur.github.io/posts/2026-11-30-length-as-priority-not-constraint/</link><pubDate>Mon, 30 Nov 2026 09:00:00 -0500</pubDate><guid>https://amey-thakur.github.io/posts/2026-11-30-length-as-priority-not-constraint/</guid><description>A search for an Andrews-Curtis reduction that bounds the total length of the relators is defeated by the bound rather than by its budget, and this paper measures the difference on the 10,115 balanced presentations of the SAIR Andrews-Curtis Challenge pool. Ten presentations whose shortest reduction is known are returned at exactly that length, in 0.4 to 2.6 seconds and 2,028 to 2,456,933 search states, by a search with no length bound at all, ordered instead by the priority L(P) + wd(P) on total relator length L and moves spent d, at w = 12. At w = 4 eight of the ten are exact; at w = 0 the same search returns 32 moves against an optimum of 15. That the bound and not the budget is the defect is then shown directly: on 196 presentations nobody has reduced, a bounded search closed its entire space in 256 to 897,279 states, so no reduction of any of them stays within its starting length, and for 33 none stays within four of it.</description></item></channel></rss>