9 citations · 11 across the 9 of their papers we have counts for
Showing 2004Show all
2 papers · 1 filter
math.CO2004
Peg Jumping for Fun and Profit
David M. Bradley, Hugh Thomas
We consider the problem of determining the minimum number of moves needed to solve a certain one-dimensional peg puzzle. Let N be a positive integer. The puzzle apparatus consists…
math.CO2004
Graded left modular lattices are supersolvable
Hugh Thomas
We provide a direct proof that a finite graded lattice with a maximal chain of left modular elements is supersolvable. This result was first established via a detour through EL-lab…