activity
20162023
most citedImproved bounds for the sunflower lemma

6 citations · 25 across the 13 of their papers we have counts for

collaborators

14 papers

math.CO2023

Monochromatic Sums and Products over

Ryan Alweiss

Hindman's finite sums theorem states that in any finite coloring of the naturals, there is an infinite sequence so that all of its finite subset sums are the same color. In 1979, H…

math.CO2022★ 1 cited

Improved Lower Bound for Frankl's Union-Closed Sets Conjecture

Ryan Alweiss, Brice Huang, Mark Sellke

We verify an explicit inequality conjectured recently by Gilmer, thus proving that for any nonempty union-closed family , some is contained in at le…

math.CO2022★ 1 cited

Monochromatic Sums and Products of Polynomials

Ryan Alweiss

We show that the pattern is partition regular over the space of formal integer polynomials of degree at least one with zero constant term, with primitive recursive b…

math.CO2021

Arithmetic Progressions in Sumsets of Sparse Sets

Noga Alon, Ryan Alweiss, Yang P. Liu +2

A set of positive integers is \emph{log-sparse} if there is an absolute constant so that for any positive integer the sequence contains at most…

math.CO2020

On a Question of Gowers on Clique Differences

Ryan Alweiss

We solve a question of Gowers from 2009 on clique differences in chains, thus ruling out any Sperner-type proof of the polynomial density Hales-Jewett theorem for alphabets of size…

cs.DS2020

Discrepancy Minimization via a Self-Balancing Walk

Ryan Alweiss, Yang P. Liu, Mehtaab Sawhney

We study discrepancy minimization for vectors in under various settings. The main result is the analysis of a new simple random process in multiple dimensions throug…