2000 character limit reached
The Jamneshan-Tao conjecture for finite abelian groups of bounded rank
Published 13 Jan 2026 in math.GR and math.CO | (2601.08810v1)
Abstract: We confirm the Jamneshan-Tao conjecture for finite abelian groups of rank at most a fixed integer $R$ (i.e. finite abelian groups generated by at most $R$ elements), by proving an inverse theorem for 1-bounded functions of non-trivial Gowers norm on such groups, concluding that such a function must correlate non-trivially with a nilsequence of bounded complexity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.