Repository logo
 
No Thumbnail Available
Publication

Ordinal sums, clockwise hackenbush, and domino shave

Use this identifier to reference this record.
Name:Description:Size:Format: 
Ordinal sums_ACarvalho.pdf514.36 KBAdobe PDF Download

Advisor(s)

Abstract(s)

We present two rulesets, domino shave and clockwise hackenbush . The first is somehow natural and, as special cases, includes stirling shave and Hetyei’s Bernoulli game. Clockwise hackenbush seems artificial yet it is equivalent to domino shave. From the pictorial form of the game, and a knowledge of hackenbush, the decomposition into ordinal sums is immediate. The values of clockwise blue-red hackenbush are numbers and we provide an explicit formula for the ordinal sum of numbers where the literal form of the base is { x | } or { | x }, and x is a number. That formula generalizes van Roode’s signed binary number method for blue-red hackenbush.

Description

Keywords

Combinatorial game theory Hackenbush van Roode’s method Ordinal sum

Citation

CARVALHO, Alda; [et al] – Ordinal sums, clockwise hackenbush, and domino shave. Integers. Electronic Journal of Combinatorial Number Theory. Vol. 21B (2021), pp. 1-23.

Organizational Units

Journal Issue

Publisher

CC License