Combinatorial aspects of flashcard games

DOI10.1007/S00026-014-0234-9MaRDI QIDQ404539zbMATHOpenAlexFDO

Authors Joel Brewster Lewis, Nan Li

Publication date 4 September 2014

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1210.2419

zbMATH Keywords

permutationschedulingtableaudiscrete dynamical processRSK

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Asymptotic enumeration (05A16) Combinatorial games (91A46)

Abstract: We study a certain family of discrete dynamical processes introduced by Novikoff, Kleinberg and Strogatz that we call flashcard games. We prove a number of results on the evolution of these games, an in particular we settle a conjecture of NKS on the frequency with which a given card appears. We introduce a number of generalizations and variations that we believe are of interest, and provide a large number of open questions and problems.

Recommendations

• scientific article; zbMATH DE number 4066897
• scientific article; zbMATH DE number 4059154
• scientific article; zbMATH DE number 863512
• Cards, permutations, and sums
• The combinatorial \(k\)-deck
• Mathematical aspect of the combinatorial game ``Mahjong
• The card guessing game: a generating function approach
• A study of a generalization of a card problem
• Complexity, appeal and challenges of combinatorial games

Cites work

• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• Education of a model student

Cited in

(3)

• Lattice structure and convergence of a game of cards
• The Proportion of Comets in the Card Game SET
• Diagrammatic Representation and Inference

This page was built for publication: Combinatorial aspects of flashcard games

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