Sign inGet started
Dataset · Hugging Face

BeeGass/Group-Theory-Collection

Group Theory Collection A benchmark of 11.28 million permutation-composition problems over 94 finite groups, split by computational complexity class (TC⁰ vs NC¹). Given a sequence of group elements, the task is to predict their composition. By Barrington's theorem, iterated composition in any fixed non-solvable group is NC¹-complete, while for solvable groups it lies in ACC⁰ ⊆ TC⁰. Architectures whose expressive power is bounded by TC⁰ — fixed-depth transformers and linear… See the full description on the dataset page: https://huggingface.co/datasets/BeeGass/Group-Theory-Collection.

Author / organizationBeeGass
License (as declared)mit
Downloads2.7K (as reported by Hugging Face)
Likes2
Created7 July 2025
Last updated at source9 August 2026
mathematicsgroup-theorypermutationssymbolic-reasoningalgebrasequence-modelingstate-space-modelscomputational-complexity
Embed this entry
<iframe src="https://silytics.si/embed/item/fcf965bc-a118-4b72-b985-60d9f287fac7" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from Hugging Face and links to the original. Information may be incomplete or out of date. Last refreshed 16 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.