Jonah Stockwell

collaborators

2 papers

math.CO2026

Multiple Distance Ramsey Bounds For Graphs in Euclidean Spaces

Ayşegül Kula, Mohamed Omar, Jonah Stockwell +1

For a finite set $A \subset R_{> 0}$ and a finite graph $H$ , let $χ_{H} (R^{n}; A)$ be the minimum number of colors required to color $R^{n}$ while avoiding a mon…

cs.CC2025

Boolean function monotonicity testing requires (almost) $n^{1/2}$ queries

Mark Chen, Xi Chen, Hao Cui +2

We show that for any constant $c > 0$ , any (two-sided error) adaptive algorithm for testing monotonicity of Boolean functions must have query complexity $I^c ◯ (n^{1/2 - c})$ . This improve…

Multiple Distance Ramsey Bounds For Graphs in Euclidean Spaces

Boolean function monotonicity testing requires (almost) n1/2 queries

Boolean function monotonicity testing requires (almost) $n^{1/2}$ queries