Mon, 12 May 2025
16:00
16:00
L6
The moduli space of Bohr sets in R^n
Yaël Dillies
(Stockholm University)
Abstract
The arithmetic regularity lemma says that any dense set A in F_p^n can be cut along cosets of some small codimension subspace H <= F_p^n such that on almost all cosets of H, A is either random or structured (in a precise quantitative manner). A standard example shows that one cannot hope to improve "almost all" to "all", nor to have a good quantitative dependency between the constants involved. Adding a further combinatorial assumption on A to the arithmetic regularity lemma makes its conclusion so strong that one can essentially classify such sets A. In this talk, I will use use the analogous problem with F_p^n replaced with R^n as a way the motivate the funny title.
Multivariable Vandermonde determinants, amalgams of matrices and Specht modules
Brown, F
Journal of Algebra
(01 Apr 2025)
Pattern formation along signaling gradients driven by active droplet behaviour of cell groups
Ford, H
Celora, G
Westbrook, E
Dalwadi, M
Walker, B
Baumann, H
Weijer, C
Pearce, P
Chubb, J
Proceedings of the National Academy of Sciences
A note on indefinite matrix splitting and preconditioning
Wathen, A
Linear Algebra and its Applications