Papers › The mathematics of burger flipping
The mathematics of burger flipping
Jean-Luc Thiffeault
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
What is the most effective way to grill food? Timing is everything, since only one surface is exposed to heat at a given time. Should we flip only once, or many times? We present a simple model of cooking by flipping, and some interesting observations emerge. The rate of cooking depends on the spectrum of a linear operator, and on the fixed point of a map. If the system has symmetric thermal properties, the rate of cooking becomes independent of the sequence of flips, as long as the last point to be cooked is the midpoint. After numerical optimization, the flipping intervals become roughly equal in duration as their number is increased, though the final interval is significantly longer. We find that the optimal improvement in cooking time, given an arbitrary number of flips, is about 29% over a single flip. This toy problem has some characteristics reminiscent of turbulent thermal convection, such as a uniform average interior temperature with boundary layers.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections