scientific article; zbMATH DE number 3236819

Publication date: 1967

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Items (30)

Complexity, appeal and challenges of combinatorial games ⋮ Scaling properties of generalized Carlitz sequences of polynomials ⋮ The rook problem on saw-toothed chessboards ⋮ The use and usefulness of numeration systems ⋮ Efficient presolving methods for solving maximal covering and partial set covering location problems ⋮ The forest hiding problem ⋮ The most elementary proof that ? ⋮ Generalized Riemann Sums ⋮ The Sprague-Grundy function for Wythoff's game ⋮ The ring of \(k\)-regular sequences. II. ⋮ The orchard visibility problem and some variants ⋮ Nimhoff games ⋮ A two-parameter family of an extension of Beatty sequences ⋮ Patterns in the generalized Fibonacci word, applied to games ⋮ Games played by Boole and Galois ⋮ The trace method for cotangent sums ⋮ The number of product-weighted lead codes for ballots and its relation to the Ursell functions of the linear Ising model ⋮ Rulesets for Beatty games ⋮ Combinatorial and probabilistic properties of systems of numeration ⋮ Adjoining to Wythoff's game its P-positions as moves ⋮ Sur un théorème de Thue ⋮ Characterization of the set of values \(f(n)=[n \alpha , n=1,2,\dots \)] ⋮ A generalization of Wythoff's game ⋮ Heap games, numeration systems and sequences ⋮ Recent results and questions in combinatorial game complexities ⋮ Chessboard graphs, related designs, and domination parameters ⋮ A new heap game ⋮ Euclid and Wythoff games ⋮ Arrays, numeration systems and Frankenstein games ⋮ Explicit evaluations and reciprocity theorems for finite trigonometric sums

This page was built for publication: