Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Theory of Combinatorial Algorithms
Prof. Emo Welzl and Prof. Bernd Gärtner
Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
| Mittagsseminar Talk Information |
Date and Time: Thursday, November 04, 2004, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Gyula Károlyi (Eötvös Lorand Univ.)
According to an old conjecture of Rudin, there is an absolute constant C such that any nonconstant N-term arithmetic progression of integers contains at most C√N perfect squares. The best upper bound O(N2/3polylog N) has been obtained by Bombieri, Granville, and Pintz, employing heavy tools from algebraic geometry.
In this talk I will present a simple combinatorial argument that gives the upper bound O(√N log d), where d is the common difference of the progression.
Upcoming talks | All previous talks | Talks by speaker | 
Upcoming talks in iCal format (beta version!)
Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login
