Where have all the grasshoppers gone?

Abstract

Let P be an N-element point set in the plane. Consider N (pointlike) grasshoppers sitting at different points of P. In a "legal" move, any one of them can jump over another, and land on its other side at exactly the same distance. After a finite number of legal moves, can the grasshoppers end up at a point set, similar to, but larger than P? We present a linear algebraic approach to answer this question. In particular, we solve a problem of Brunck by showing that the answer is yes if P is the vertex set of a regular N-gon and N≠ 3, 4, 6. Some generalizations are also considered.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…