3 citations · 4 across the 3 of their papers we have counts for
3 papers
math.CO2009
Finite Analogs of Szemerédi's Theorem
Paul Raff, Doron Zeilberger
One of the "deepest" theorems in mathematics is Endre Szemerédi's theorem about the inevitability of arithmetical progressions. Here we try to nibble at it, by doing "finite" analo…
math.CO2008★ 3 cited
Spanning Trees in Grid Graphs
Paul Raff
Building on work by Desjarlais, Molina, Faase, and others, a general method is obtained for counting the number of spanning trees of graphs that are a product of an arbitrary graph…
cs.AI2005★ 1 cited
A formally verified proof of the prime number theorem
Jeremy Avigad, Kevin Donnelly, David Gray +1
The prime number theorem, established by Hadamard and de la Vall'ee Poussin independently in 1896, asserts that the density of primes in the positive integers is asymptotic to 1 /…