On the recurrence f_m+1=b_m f_m-f_m-1 and applications

DOI10.1016/S0012-365X(00)00138-2MaRDI QIDQ1586778zbMATH OpenOpenAlexFDO

Authors Aviezri S. Fraenkel

Publication date 26 August 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(00)00138-2

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Continued fractions; complex-analytic aspects (30B70)

Review text

The author shows how simple and well known properties of regular and semiregular continued fractions can be applied to formulate strategies for combinatorial games. In particular he formulates a polynomial strategy for a generalized Wythoff game.

Recommendations

• Wythoff games, continued fractions, cedar trees and Fibonacci searches
• A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory
• Euclid and Wythoff games
• General restrictions of Wythoff-like games
• The Sprague-Grundy function for Wythoff's game

Cited in

(6)

• scientific article; zbMATH DE number 5840408 (Why is no real title available?)
• scientific article; zbMATH DE number 3851188 (Why is no real title available?)
• A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
• ANISOTROPIC STEP, SURFACE CONTACT, AND AREA WEIGHTED DIRECTED WALKS ON THE TRIANGULAR LATTICE
• Complementary iterated floor words and the Flora game
• A unified approach to some recurrence sequences via Faà di Bruno's formula

This page was built for publication: On the recurrence \(f_{m+1}=b_m f_m-f_{m-1}\) and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1586778)