Spinning switches on a wreath product
From MaRDI portal
Publication:6133638
DOI10.1016/J.JCTA.2023.105795zbMATH Open1520.91084arXiv2210.09408OpenAlexW4385502097MaRDI QIDQ6133638FDOQ6133638
Authors: Peter Kagey
Publication date: 21 August 2023
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2210.09408
Recommendations
combinatoricsalgorithmwreath productblind bartender's problemblind rotating table gamerotating-table games
Cites Work
- Title not available (Why is that?)
- Highly symmetric 2-plane fields on 5-manifolds and 5-dimensional Heisenberg group holonomy
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- Rotating-table games and derivatives of words
- The Blind Bartender's Problem
- On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings
- Roulette games and depths of words over finite commutative rings
- Generating triples of involutions of alternating groups
- Generating triples of involutions of Chevalley groups over a finite field of characteristic 2
- Generating triples of involutions for Lie-type groups over a finite field of odd characteristic. I
- Title not available (Why is that?)
- Title not available (Why is that?)
- A generalization of the blind rotating table game
- Mathematical Puzzles
Cited In (3)
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)