Extremal Chowla sets and their linear analogues: A human-AI mathematical investigation using Co-Scientist
Authors: Mohsen Aliabadi, Keith Driscoll, Elliot Krop, Petar Sirkovic, Everett Sullivan, Elahe Vedadi
Organizations: Clayton State University · Google Cloud AI Research · Google DeepMind
Abstract
We introduce an extremal invariant associated with Chowla-type order conditions in finite groups. A nonempty subset S of a finite group G is called a Chowla set if every element of S has order greater than ∣S∣, and we write C(G) for the maximum cardinality of such a set. We first show that C(G) is determined by the distribution of element orders in G. For cyclic groups, we derive an exact divisor formula and characterize the integers n for which C(Z/nZ)=φ(n). We prove that liminfn→∞C(Z/nZ)/φ(n)=1, whereas limsupn→∞C(Z/nZ)/φ(n)=∞, and we determine the corresponding lower and upper limits under normalization by n. For finite abelian groups, we obtain an explicit formula in terms of the invariant-factor decomposition, together with a closed formula for finite abelian p-groups. We then develop a linear analogue for finite field extensions. A nonzero K-subspace A of an extension L/K is called a Chowla subspace if [K(a):K]>dimKA for every nonzero a∈A. Since this condition depends on dimKA, it does not generally require every nonzero element of A to generate L over K. Nevertheless, when L/K is finite and separable, we prove the exact formula C(L/K)=[L:K]−dmax(L/K), where dmax(L/K) is the largest degree over K of a proper intermediate field. For finite fields, we give a direct proof in every degree using a normal-basis construction. This work was developed through an expert-guided human-AI collaboration. A reasoning-focused configuration of Co-Scientist was used to explore examples and potential proof strategies. The authors formulated the problem, independently verified and completed all arguments, and wrote the final proofs.
In Question~3.1 of his 1995 paper on depth and transfer, Carlson asked whether the depth of a finite-group cohomology ring is always realized by the dimension of one of its associated primes. We give a negative answer. Let
G=\SG128859,k=\kbar.
An exact presentation certificate proves that \depthH∗(G;k)=2. Okuyama's associated-prime theorem would convert an associated prime of dimension two into a rank-two elementary abelian subgroup E≤G satisfying \depthH∗(CG(E);k)=2. We enumerate all 75 rank-two elementary abelian subgroups of G and obtain six centralizer types. Duflot's theorem gives depth at least three for four types, while exact ideal-quotient certificates exhibit regular sequences of length three for the remaining two. Hence every rank-two centralizer has cohomological depth at least three, so H∗(G;k) has no associated prime of dimension two. The finite group presentation, the three cohomology-ring presentations, the enumeration summary, and the exact algebraic certificates are included for independent verification.
A finite presentation < X | R > of a finite group is called `just finite' if removing any relation from R results in a presentation for an infinite group. It has been an open question (Kourovka Notebook, Problem 21.10) whether every finite group admits such a presentation. We resolve this conjecture in the affirmative.
AI agents are increasingly used in mathematics research, but it is often unclear how to use them effectively. Towards this, we present an extensive case study of how AI was used to improve bounds on the Grothendieck constant KG, which captures the hardness between combinatorial problems and their continuous relaxations. Specifically, while the precise value of KG is not known, we recently tightened the best known bounds to
116π≤KG≤2log(1+2)π−10−4.
Crucially, these improvements were achieved using an AI research system that could arrive at insights deemed novel by domain experts. We give a detailed discussion of our experience using AI for mathematics research, particularly touching upon its strengths and weaknesses, as well as our experience with creating ideal conditions for AI to arrive at breakthrough insights.