Arrays, numeration systems and Frankenstein games

DOI10.1016/S0304-3975(01)00070-6zbMath1002.91009MaRDI QIDQ1603715

Aviezri S. Fraenkel

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

complexitynumeration systemsmatricescombinatorial games

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Combinatorial games (91A46)

Related Items (2)

A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS ⋮ A new heap game

Uses Software

• OEIS

Cites Work

• A note on periodicity in some octal games
• Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
• Heap games, numeration systems and sequences
• Generalized Wythoff arrays, shuffles and interspersions
• A combinatorial interpretation of the recurrence \(f_{n+1}=6f_n-f_{n-1}\)
• Systems of Numeration
• The Bracket Function and Complementary Sets of Integers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Arrays, numeration systems and Frankenstein games