<?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>Transitive Groups on AmeyArc</title><link>https://amey-thakur.github.io/tags/transitive-groups/</link><description>Recent content in Transitive Groups on AmeyArc</description><generator>Hugo -- 0.152.2</generator><language>en-us</language><lastBuildDate>Sun, 20 Sep 2026 09:00:00 -0400</lastBuildDate><atom:link href="https://amey-thakur.github.io/tags/transitive-groups/index.xml" rel="self" type="application/rss+xml"/><item><title>Chebotarev Fingerprints: Identifying Degree-24 Galois Groups Without Computer Algebra</title><link>https://amey-thakur.github.io/posts/2026-09-20-chebotarev-fingerprints-identifying-degree-24-galois-groups/</link><pubDate>Sun, 20 Sep 2026 09:00:00 -0400</pubDate><guid>https://amey-thakur.github.io/posts/2026-09-20-chebotarev-fingerprints-identifying-degree-24-galois-groups/</guid><description>Naming the Galois group of a degree-24 integer polynomial ordinarily demands resolvent computations inside a computer algebra system. This paper presents a statistical alternative that needs only polynomial factorisation modulo small primes, and evaluates it against 576,682 polynomials whose groups the SAIR IGP24 evaluation server computed independently in Magma. The method reads the multiset of Frobenius cycle types at 60 primes as a sample from the group&amp;rsquo;s own cycle-type distribution, which the Chebotarev density theorem licenses, then scores that sample against empirical profiles of candidate groups drawn by product-replacement sampling. Within its domain the classifier reaches 69.0% top-1 and 88.7% top-3 accuracy at 53 ms per polynomial.</description></item></channel></rss>