Pure Math · Mathematics & Statistics
Group Theory
The newest papers in Group Theory that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
14 papers, from 7 September 2026 to 5 November 2026: 14 arXiv preprints.
Get the few papers worth your time in Group Theory every morning.
Follow Group Theory and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers
Data-driven discovery of intrinsic Lie point symmetries of differential equation systems
Discovering continuous symmetries directly from differential-equation data can reveal geometric structure for model reduction and scientific machine learning without symbolic determining equations…Full-Rank Constructions of Explicit Lossless Expanders and Good Small-Set qLTCs
We construct explicit two-sided lossless expanders whose binary adjacency matrices have full rank, and use them to obtain explicit asymptotically good quantum LDPC codes whose specified X- and…The Symmetry of Differential Neural Tangent Kernel under the Orthogonal Group
The differential neural tangent kernel (DNTK) is a tool for analyzing the training dynamics of overparameterized physics informed neural networks.Learning a Group Element from Its Action: Galois Correspondences, Optimal ERM, and an Abel-Ruffini Threshold for the Natarajan Dimension
We study learning an unknown element $g$ of a group acting with finite orbits on a countable set, from examples $(x,gx)$.Clifford Invariants and Three-Copy Quantum Tests
We give an explicit treatment of the third tensor power of the Clifford representation on $n$ qutrits, for $n\geq2$.Almost Tight Bounds for Isomorphism Testing and Basis Construction in Finite Abelian Groups
We study isomorphism decision and basis construction for finite Abelian groups of known order $n$.A Cohomological Characterization of the Clifford Hierarchy
The Clifford hierarchy plays a central role in fault-tolerant quantum computation, but its higher levels remain only partially understood.Amenable groups with nearly exponential sofic profile, and quantum channels that need nearly linear memory
How far from finite can an amenable group be?Beyond odd characteristic: Faster isomorphism testing of 2-groups of Frattini class 2
The finite group isomorphism problem asks whether two finite groups of order $N$ are isomorphic.Quantum Algorithms for Minimum Generating Set
In this paper, we present a polynomial-time quantum algorithm for computing a minimum-sized generating set of solvable black-box groups.CAS II: Orbits as Models: Kolmogorov's Structure Function under Symmetry
In algorithmic statistics a string x is explained by a finite set containing it, and Kolmogorov's structure function records the smallest such model at each level of complexity.Sample Complexity of Equivariant Reinforcement Learning
Reinforcement learning (RL) is a powerful framework for robotic control, yet its practical application is often hindered by high sample complexity.On the generation of multiplicative groups by small primes
Motivated by a question of Regev arising from his improved quantum factoring algorithm, we study how many small primes are needed to generate the group $({\mathbb Z}/q{\mathbb Z})^\times$ when each…Algorithms for Finite Group Epimorphism Testing
The Group Epimorphism Problem (GpEpi) asks, given two finite groups $G_1$ and $G_2$, whether there exists a surjective group homomorphism, or epimorphism, from $G_1$ to $G_2$.