Integrals, Partitions, and Cellular Automata
Abstract
We prove that ∫01- f(x)xdx=π23ab where f(x) is the decreasing function that satisfies fa-fb=xa-xb, for 0<a<b. When a is an integer and b=a+1 we deduce several combinatorial results. These include an asymptotic formula for the number of integer partitions not having a consecutive parts, and a formula for the metastability thresholds of a class of threshold growth cellular automaton models related to bootstrap percolation.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.