activity
20182025
most citedImproved bounds for the Erdős-Rogers function

5 citations · 14 across the 6 of their papers we have counts for

collaborators

6 papers

cs.CL2025★ 3 cited

Early science acceleration experiments with GPT-5

Sébastien Bubeck, Christian Coester, Ronen Eldan +11

AI models like GPT-5 are an increasingly valuable tool for scientists, but many remain unaware of the capabilities of frontier AI. We present a collection of short case studies in…

cs.LG2023★ 4 cited

Evaluating Language Models for Mathematics through Interactions

Katherine M. Collins, Albert Q. Jiang, Simon Frieder +11

There is much excitement about the opportunity to harness the power of large language models (LLMs) when building problem-solving assistants. However, the standard methodology of e…

math.FA2019

High-dimensional tennis balls

W. T. Gowers, K. Wyczesany

We show that there exist constants such that for every positive integer there is a continuous odd function , with , such that the -expansion…

math.CO2019★ 1 cited

Partial associativity and rough approximate groups

W. T. Gowers, Jason Long

Suppose that a binary operation on a finite set is injective in each variable separately and also associative. It is easy to prove that must be a group. In…

math.CO2018★ 1 cited

Subsets of Cayley graphs that induce many edges

W. T. Gowers, O. Janzer

Let be a regular graph of degree and let . Say that is -closed if the average degree of the subgraph induced by is at least . This says that i…

math.CO2018★ 5 cited

Improved bounds for the Erdős-Rogers function

W. T. Gowers, O. Janzer

The Erdős-Rogers function measures how large a -free induced subgraph there must be in a -free graph on vertices. While good estimates for are kno…