COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Discrete Analysis Seminar > Forbidden bipartite configurations in subsets of finite groups

## Forbidden bipartite configurations in subsets of finite groupsAdd to your list(s) Download to your calendar using vCal - Gabriel Conant (University of Cambridge)
- Wednesday 23 October 2019, 13:45-14:45
- MR5, CMS.
If you have a question about this talk, please contact Thomas Bloom. A common theme in additive combinatorics is that if a subset of a group is “approximately structured”, then it can be approximated by a set that is “perfectly structured”. In this talk, I will consider subsets A of groups G that are approximately structured in the sense that the bipartite graph defined by the relation “xy is in A” omits some bipartite graph, of a fixed finite size, as an induced subgraph. This can also be quantified using the VC-dimension of the set system of (left) translates of A. I will present several results showing that if a subset of an arbitrary finite group is approximately structured in this way, then it can be approximated by “perfectly structured” sets such as subgroups and Bohr sets. These results qualitatively generalize work of Terry and Wolf, and of Alon, Fox, and Zhao, on tame forms of arithmetic regularity in finite abelian groups. The proofs rely on model theory, as well as classical results from the structure theory for compact groups. Joint with A. Pillay and C. Terry. This talk is part of the Discrete Analysis Seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- Discrete Analysis Seminar
- Hanchen DaDaDash
- Interested Talks
- MR5, CMS
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsCreative Research at Museum of Archaeology & Anthropology euroscicon Graduate Union talks## Other talksLunchtime Seminar - The Odyssey of eighteenth-century scholarship and the entangled emergence of the Enlightenment An approximate version of Jackson's conjecture Alan Turing and the Enigma Machine Mechanobiology of cell shape control LEARNING TO BUILD: HOW MACHINE LEARNING RESHAPES THE WAY WE DEVELOP HIGH-TECHNOLOGY PRODUCTS |