Spinning switches on a wreath product
From MaRDI portal
Publication:6133638
Abstract: We classify an algebraic phenomenon on certain families of wreath products that can be seen as coming from a family of puzzles about switches on the corners of a spinning table. Such puzzles have been written about and generalized since they were first popularized by Martin Gardner in 1979. In this paper, we provide perhaps the fullest generalization yet, modeling both the switches and the spinning table as arbitrary finite groups combined via a wreath product. We classify large families of wreath products depending on whether or not they correspond to a solvable puzzle, completely classifying the puzzle in the case when the switches behave like abelian groups, constructing winning strategies for all wreath product that are -groups, and providing novel examples for other puzzles where the switches behave like nonabelian groups, including the puzzle consisting of two interchangeable copies of the monster group . Lastly, we provide a number of open questions and conjectures, and provide other suggestions of how to generalize some of these ideas further.
Recommendations
Cites work
- scientific article; zbMATH DE number 706263 (Why is no real title available?)
- scientific article; zbMATH DE number 2039003 (Why is no real title available?)
- scientific article; zbMATH DE number 2050057 (Why is no real title available?)
- scientific article; zbMATH DE number 1396685 (Why is no real title available?)
- A generalization of the blind rotating table game
- Generating triples of involutions for Lie-type groups over a finite field of odd characteristic. I
- Generating triples of involutions of Chevalley groups over a finite field of characteristic 2
- Generating triples of involutions of alternating groups
- Highly symmetric 2-plane fields on 5-manifolds and 5-dimensional Heisenberg group holonomy
- Mathematical Puzzles
- On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings
- Rotating-table games and derivatives of words
- Roulette games and depths of words over finite commutative rings
- The Blind Bartender's Problem
- The On-Line Encyclopedia of Integer Sequences
Cited in
(4)
This page was built for publication: Spinning switches on a wreath product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133638)