Variations of a Coin-Removal Problem

Simple item page
dc.creatorShelton, Kennan
dc.creatorSiler, Michael
dc.date2004-11-02
dc.date.accessioned2026-07-07T05:13:54Z
dc.date.available2026-07-07T05:13:54Z
dc.descriptionGiven a set of coins arranged in a line, we remove heads-up coins one at a time and flip any adjacent coins after each removal. The coin-removal problem is to determine for which arrangements of coins it is possible to remove all of the coins. In this paper we consider a variation of the problem in which gaps created by removing coins are eliminated by pushing the coins together. We characterize the set of removable arrangements and show that this set forms a regular language. We use a finite automaton to find a recursive formula for the number of removable arrangements of different lengths.
dc.description13 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/math/0411052
dc.identifierhttp://arxiv.org/abs/math/0411052
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/73082
dc.subjectCombinatorics
dc.subjectGeneral Mathematics
dc.titleVariations of a Coin-Removal Problem
dc.typetext

Files

Collections

arXiv