University of Cambridge > Talks.cam > Combinatorics Seminar > A stable arithmetic regularity lemma in finite abelian groups

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

A stable arithmetic regularity lemma in finite abelian groups

Download to your calendar using vCal

  • UserCaroline Terry (University of Chicago)
  • ClockThursday 14 February 2019, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason .

Abstract: The arithmetic regularity lemma for Fpn (first proved by Green in 2005) states that given $A\subseteq \F_pn$, there exists $H\leq \F_pn$ of bounded index such that $A$ is Fourier-uniform with respect to almost all cosets of $H$. In general, the growth of the index of $H$ is required to be of tower type depending on the degree of uniformity, and must also allow for a small number of non-uniform elements. Previously, in joint work with Wolf, we showed that under a natural model theoretic assumption, called stability, the bad bounds and non-uniform elements are not necessary. In this talk, we present results extending this work to stable subsets of arbitrary finite abelian groups. This is joint work with Julia Wolf.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Alternate Mondays (unless otherwise stated), 13.00 – 14.00 in the Kenneth Craik Room, Craik Marshall Building, Downing Site Department of Earth Sciences - Harker II CUED,Board Room

Other talks

TBC CSAR lecture: In a post-Ozempic world, have we cured obesity? Title to be confirmed Morning Break Title TBC TBC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity