Bogdan Nica
Indiana University - Purdue University Indianapolis, USA

The study of multivariate polynomials over finite grids – that is, cartesian products of finite subsets of a field – is a rich theme rooted in algebra, with ramifications in combinatorics and in theoretical computer science. A prime illustration of the theme is Alon's Combinatorial Nullstellensatz. I will discuss a 'structured' generalization of the Combinatorial Nullstellensatz. The talk is based on the recent paper 'Polynomials over structured grids' (Combinatorics, Probability and Computing 2023).