Grasshopper Problem: Combinatorics & Optimization

• The grasshopper problem is a collection of jump process challenges spanning combinatorial permutation avoidance, geometric shape optimization, and horological clock precision.
• Researchers use algebraic and combinatorial methods, including polynomial nonvanishing and antisymmetrized sums, to establish conditions for forbidden partial sums and optimal configurations.
• Recent studies apply numerical, formal, and analytical techniques to reveal symmetry breaking, phase transitions in optimal shapes, and error cancellation in mechanical clock mechanisms.

In the literature surveyed here, the expression grasshopper problem denotes a cluster of mathematically distinct questions organized around a jump process. The name most prominently refers to the International Mathematical Olympiad problem on permuting distinct positive jumps so that no intermediate partial sum lies in a prescribed forbidden set, and to a geometric optimization problem in which a lawn or colouring is chosen to maximize the probability that a randomly jumping grasshopper remains on the same set. A separate horological usage concerns the precision limits of John Harrison’s grasshopper escapement in mechanical clocks (Ieno, 2019, Goulko et al., 2017, Ziemkiewicz, 2021).

1. Olympiad formulation and combinatorial content

The classical olympiad grasshopper problem, posed as IMO 2009 Problem 6, starts with distinct positive integers $a_1,\dots,a_n$ and a set $M$ of $n-1$ positive integers not containing

$s=a_1+\cdots+a_n.$

A grasshopper starts at $0$ on the real axis and makes the jumps $a_1,\dots,a_n$ in some order, always to the right. The claim is that there exists a permutation $\pi$ such that the partial sums

$$S_k=a_{\pi(1)}+\cdots+a_{\pi(k)} \qquad (1\le k\le n-1)$$

all avoid $M$ (Ieno, 2019).

This formulation has several immediate structural features. Positivity implies that landing points are strictly increasing, distinctness of the $a_i$ is essential in the combinatorial arguments, and the final position $M$0 is automatically safe by hypothesis. The problem was widely discussed after IMO 2009, and the known complete solutions in the original positive-jump setting are elementary and inductive rather than polynomial-method proofs (Kós, 2010).

A generalized formal statement used in Lean 4 replaces the list $M$1 by a function $M$2, assumes positivity and injectivity, weakens $M$3 to $M$4, and asks for a permutation $M$5 such that every encoded partial sum $M$6 avoids $M$7 (Lau, 19 May 2026). This suggests that the olympiad statement sits naturally inside a broader finite-set permutation-avoidance framework.

2. Polynomial, signed-jump, and formal approaches

A standard algebraic encoding introduces

$M$8

so that, for a fixed ordering, $M$9 if and only if none of the intermediate partial sums hits a forbidden value. This makes the grasshopper constraint a nonvanishing problem for a polynomial on permutations (Ieno, 2019).

The direct Combinatorial Nullstellensatz route runs into two obstacles. If all coordinate sets are taken equal to $n-1$0, nonvanishing does not force the coordinates to be distinct, hence it need not correspond to a permutation. Multiplying by the Vandermonde polynomial enforces distinctness, but then the degree becomes too large for the usual Nullstellensatz hypotheses. Ieno’s refinement replaces direct multiplication by an antisymmetrized sum

$n-1$1

which is divisible by the Vandermonde and can be analyzed explicitly for $n-1$2. For $n-1$3 and $n-1$4, this yields partial algebraic control, but the method encounters “singularity” loci where $n-1$5 vanishes and no longer certifies the existence of a valid permutation (Ieno, 2019).

A different polynomial success occurs in the signed-jumps variant, where the $n-1$6 are allowed to be arbitrary distinct integers. In that setting, Kós proves sharp thresholds for the size of a blocking set $n-1$7: for $n-1$8, $n-1$9; for $s=a_1+\cdots+a_n.$0 with zero allowed, $s=a_1+\cdots+a_n.$1; and for $s=a_1+\cdots+a_n.$2 with all $s=a_1+\cdots+a_n.$3, $s=a_1+\cdots+a_n.$4 (Kós, 2010). The proof uses an alternating polynomial of exactly the same total degree as the Vandermonde, reducing the problem to positivity of a coefficient family $s=a_1+\cdots+a_n.$5 established by induction (Kós, 2010).

Formalization work in Lean 4 exposes a different boundary. The Aristotle-generated development verifies four local lemmas: PS_last, PS_swap, PS_swap_eq, and maximizer_swap_in_M. These establish that the final partial sum equals the total sum, that an adjacent transposition changes only one relevant intermediate partial sum, that the changed partial sum has the expected algebraic form, and that maximality forces corresponding forbidden-set membership. The main theorem, however, remains closed by a single unresolved sorry, because the global counting argument needed to contradict $s=a_1+\cdots+a_n.$6 is not formalized (Lau, 19 May 2026). This suggests a sharp distinction between local exchange lemmas and global combinatorial bookkeeping.

3. Planar geometric optimization

In geometric combinatorics, the grasshopper problem asks for a measurable lawn of area $s=a_1+\cdots+a_n.$7 in $s=a_1+\cdots+a_n.$8 maximizing the probability that a grasshopper, initially landing uniformly on the lawn and then jumping a fixed Euclidean distance $s=a_1+\cdots+a_n.$9 in a random direction, remains on the lawn. For a density $0$0 with $0$1, the success functional is

$0$2

and in the indicator case $0$3, the problem is to optimize over measurable sets $0$4 of area $0$5 (Goulko et al., 2017).

The principal negative result is that a disc-shaped lawn is not optimal for any $0$6 (Goulko et al., 2017). This is already unexpected at small jump lengths, where an isoperimetric heuristic might suggest discs. Goulko and Kent further introduce a discrete spin model whose ground state corresponds to a discretized version of the problem and use simulated annealing and parallel tempering to search for optimizers (Goulko et al., 2017).

For $0$7, the best numerical lawns resemble cogwheels with $0$8 cogs, where $0$9 is close to

$a_1,\dots,a_n$0

For $a_1,\dots,a_n$1, the numerics indicate transitions to qualitatively different shapes, including disconnected and stripe-like regimes (Goulko et al., 2017). A plausible implication is that the planar problem is governed less by classical perimeter minimization than by a nonlocal resonance between boundary geometry and the prescribed jump distance.

4. Circle and sphere variants, and the Bell-inequality connection

On the circle $a_1,\dots,a_n$2 of circumference $a_1,\dots,a_n$3, the corresponding problem admits a largely complete arithmetic classification. For unconstrained lawns of any fixed length and arbitrary jump length, the supremum retention probability is $a_1,\dots,a_n$4; it is attained for rational jump lengths and approximated arbitrarily well for irrational ones (Chistikov et al., 2020). For antipodal lawns of length $a_1,\dots,a_n$5, the picture changes: if

$a_1,\dots,a_n$6

then the optimal retention probability equals $a_1,\dots,a_n$7 when $a_1,\dots,a_n$8 is odd and $a_1,\dots,a_n$9, equals $\pi$0 for $\pi$1, and is $\pi$2 in the complementary cases (Chistikov et al., 2020). For a pair of antipodal lawns, the optimal transfer probability is $\pi$3 when $\pi$4 is odd and $\pi$5 is even, and $\pi$6 otherwise (Chistikov et al., 2020).

On the sphere, the same jump process becomes directly relevant to Bell inequalities. The spherical grasshopper problem can be interpreted as finding the best local hidden-variable approximation to singlet correlations for measurements along random axes separated by a fixed angle (Llamas et al., 9 Mar 2026). Kent and Pitalúa-García had shown that if $\pi$7, a hemispherical lawn is optimal with retention probability $\pi$8. “Globe-hopping” strengthens the picture by proving that for every other $\pi$9, hemispherical lawns are not optimal (Chistikov et al., 2020).

This destroys the general “hemispherical colouring maximality” hypothesis and replaces it with a more selective statement: hemispheres are optimal only at the discrete angles $$S_k=a_{\pi(1)}+\cdots+a_{\pi(k)} \qquad (1\le k\le n-1)$$0. In Bell-theoretic terms, this means that the best classical approximation to the quantum singlet is generally realized by more intricate antipodal colourings than hemispheres (Chistikov et al., 2020).

5. Symmetry breaking, spherical phase structure, and dimensionality

The 2023 symmetry-breaking analysis recasts the grasshopper functional in $$S_k=a_{\pi(1)}+\cdots+a_{\pi(k)} \qquad (1\le k\le n-1)$$1 as a nonlocal variational problem with isotropic kernel and fixed volume. In two dimensions, the unit-area disk has radius $$S_k=a_{\pi(1)}+\cdots+a_{\pi(k)} \qquad (1\le k\le n-1)$$2, and boundary perturbations of the form

$$S_k=a_{\pi(1)}+\cdots+a_{\pi(k)} \qquad (1\le k\le n-1)$$3

lead to a second-order stability coefficient

$$S_k=a_{\pi(1)}+\cdots+a_{\pi(k)} \qquad (1\le k\le n-1)$$4

This identifies explicit unstable Fourier modes of the disk and explains the emergence of cogwheels (Llamas et al., 2023).

The same paper isolates the dimensional effect through flat-interface perturbations. For plane-wave boundary modes, the quadratic coefficients are

$$S_k=a_{\pi(1)}+\cdots+a_{\pi(k)} \qquad (1\le k\le n-1)$$5

The two-dimensional coefficient has marginal commensurate modes, while the three-dimensional coefficient is strictly negative for nonzero $$S_k=a_{\pi(1)}+\cdots+a_{\pi(k)} \qquad (1\le k\le n-1)$$6. This gives a mechanism for why rotational symmetry is broken in $$S_k=a_{\pi(1)}+\cdots+a_{\pi(k)} \qquad (1\le k\le n-1)$$7D but recovered in $$S_k=a_{\pi(1)}+\cdots+a_{\pi(k)} \qquad (1\le k\le n-1)$$8D for small jumps (Llamas et al., 2023).

Numerical work on the sphere exhibits an analogous pattern language. A simulated-annealing study found cogwheel colourings for $$S_k=a_{\pi(1)}+\cdots+a_{\pi(k)} \qquad (1\le k\le n-1)$$9, with an odd number of cogs $M$0 close to $M$1; critical solutions with shrinking same-colour domains for $M$2; and stripe-based solutions for $M$3, with stripe widths scaling with $M$4 near $M$5 (Breugel, 2023). A later spherical analysis formalized three variants—antipodal complementary lawns, antipodal independent lawns, and non-antipodal complementary lawns—using a geodesic averaging operator $M$6 diagonalized by spherical harmonics,

$M$7

and numerically identified cogwheel, labyrinth, and stripe regimes across these variants (Llamas et al., 9 Mar 2026).

6. Horological usage: the grasshopper escapement problem

In a separate horological literature, “grasshopper problem” refers to the dynamics and attainable precision of the grasshopper escapement, John Harrison’s pendulum-driven clock mechanism. The escapement operates at large amplitude, with very low sliding friction, moderate $M$8, and position-dependent torque that makes the pendulum a self-excited van der Pol–type oscillator (Ziemkiewicz, 2021).

The clock-dynamical question is how accurately such a device can keep time in the presence of internal mechanical noise. One analysis models the pendulum by

$M$9

defines the accuracy measure

$a_i$0

and finds a broad linear relation

$a_i$1

between clock accuracy and entropy production per period, in agreement with corresponding results for nanoscale and quantum clocks (Ziemkiewicz, 2021). The same work models torque fluctuations with a Maxwell–Boltzmann-type distribution and reports that the cumulative clock error behaves like a random walk with fractal-like properties, with long-time box-counting dimension tending toward $a_i$2 (Ziemkiewicz, 2021).

A complementary numerical study emphasizes the mechanical source of this robustness. In a simplified constant-torque model, the grasshopper escapement produces a negative escapement error that can cancel the positive circular error of a large-amplitude pendulum, creating a broad minimum in the total rate error as a function of amplitude. This identifies a regime of large amplitude and moderate $a_i$3 in which the clock rate is relatively insensitive to drive variations and transient disturbances (Ziemkiewicz, 2021).

Taken together, these usages show that the grasshopper problem is not a single theorem or model but a family of problems linked by jump dynamics, nonlocal constraints, and optimization. In olympiad combinatorics it is a permutation-avoidance theorem for partial sums; in geometric probability it is a shape-optimization problem with symmetry breaking and Bell-theoretic significance; and in horology it becomes a precision problem for a nonlinear self-excited oscillator (Ieno, 2019, Goulko et al., 2017, Ziemkiewicz, 2021).