2010/09/29 by Qiang Zhen, Zhen, Qiang, Charles Knessl +1
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Algorithms and Data Compression #Classical Analysis and ODEs (math.CA) #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1009.5731
openalex publication_date 2010/09/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider the chessboard pebbling problem analyzed by Chung, Graham, Morrison and Odlyzko [3]. We study the number of reachable configurations G(k) and a related double sequence G(k,m). Exact expressions for these are derived, and we then consider various asymptotic limits.