# Category Archives: Combinatorics

## Erdős Sumset conjecture

Hindman’s finite sums theorem is one of the most famous and useful theorems in Ramsey theory. It states that for any finite partition of the natural numbers, one of the cells of this partition contains an IP-set, i.e., there exists … Continue reading

## An arithmetic van der Corput trick and the polynomial van der Waerden theorem

The van der Corput difference theorem (or trick) was develop (unsurprisingly) by van der Corput, and deals with uniform distribution of sequences in the torus. Theorem 1 (van der Corput trick) Let be a sequence in a torus . If … Continue reading

## Piecewise syndetic sets, topological dynamics and ultrafilters

In this post I explore the notion of piecewise syndeticity and its relation to topological dynamical systems and the Stone-Čech compactification. I restrict attention to the additive semigroup but most results presented are true in much bigger generality (and I … Continue reading

## Measure preserving actions of affine semigroups and {x+y,xy} patterns

Vitaly Bergelson and I have recently submitted to the arXiv our paper entitled `Measure preserving actions of affine semigroups and patterns’. The main purpose of this paper is to extend the results of our previous paper, establishing some partial progress … Continue reading

## Large subsets of discrete hypersurfaces in Z^d contain arbitrarily many collinear points

— 1. Introduction — Recently, Florian Richter and I uploaded to the arXiv our paper titled `Large subsets of discrete hypersurfaces in contain arbitrarily many collinear points’. This was the outcome of a fun project which started when we learned … Continue reading

## New polynomial and multidimensional extensions of classical partition results

Vitaly Bergelson, John Johnson and I recently uploaded to the arXiv a paper entitled “New polynomial and multidimensional extensions of classical partition results“. In this post I will give some motivating examples for the results in the paper. To keep … Continue reading

## Weighted densities with multiplicative structure

The upper density of a set , defined by provides a useful way to measure subsets of . For instance, whenever , contains arbitrarily long arithmetic progressions, this is Szemerédi’s theorem. A fundamental property of the upper density is that … Continue reading