Extremal Chowla sets and their linear analogues: A human-AI mathematical investigation using Co-Scientist
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 of a finite group is called a Chowla set if every element of has order greater than , and we write for the maximum cardinality of such a set. We first show that is determined by the distribution of element orders in . For cyclic groups, we derive an exact divisor formula and characterize the integers for which . We prove that , whereas , and we determine the corresponding lower and upper limits under normalization by . For finite abelian groups, we obtain an explicit formula in terms of the invariant-factor decomposition, together with a closed formula for finite abelian -groups. We then develop a linear analogue for finite field extensions. A nonzero -subspace of an extension is called a Chowla subspace if for every nonzero . Since this condition depends on , it does not generally require every nonzero element of to generate over . Nevertheless, when is finite and separable, we prove the exact formula , where is the largest degree over 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.