Ryan Alweiss

activity

20192021

collaborators

5 papers

math.CO2021

Arithmetic Progressions in Sumsets of Sparse Sets

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

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

cs.DS2020

Discrepancy Minimization via a Self-Balancing Walk

Ryan Alweiss, Yang P. Liu, Mehtaab Sawhney

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

math.CO2019

On the subgraph query problem

Ryan Alweiss, Chady Ben Hamida, Xiaoyu He +1

Given a fixed graph $H$ , a real number $p \in (0, 1)$ , and an infinite Erdős-Rényi graph $G \sim G (\infty, p)$ , how many adjacency queries do we have to make to find a copy of $H$ insid…

math.CO2019

Noisy Corruption Detection

Ryan Alweiss

We answer a question of Alon, Mossel, and Pemantle about the corruption detection model on graphs in the noisy setting.

math.CO2019

On the product dimension of clique factors

Noga Alon, Ryan Alweiss

The product dimension of a graph $G$ is the minimum possible number of proper vertex colorings of $G$ so that for every pair $u, v$ of non-adjacent vertices there is at least one co…