A skeleton model to enumerate standard puzzle sequences

DOI10.3934/ERA.2022010MaRDI QIDQ2127482zbMATH OpenOpenAlexFDO

Authors Shishuo Fu, Jiaxi Lu, Yuanzhe Ding

Publication date 20 April 2022

Published in Electronic Research Archive (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Catalan numberenumerationhypergeometric seriesbijective combinatoricsdouble factorialsecant numberstandard puzzle

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Classical hypergeometric functions, ({}_2F_1) (33C05) Exact enumeration problems, generating functions (05A15)

Abstract: Guo-Niu Han [arXiv:2006.14070 [math.CO]] has introduced a new combinatorial object named standard puzzle. We use digraphs to show the relations between numbers in standard puzzles and propose a skeleton model. By this model, we solve the enumeration problem of over fifty thousand standard puzzle sequences. Most of them can be represented by classical numbers, such as Catalan numbers, double factorials, Secant numbers and so on. Also, we prove several identities in standard puzzle sequences.

Recommendations

• The enumeration of standard puzzles
• Refinements on an enumeration scheme for solving a pattern sequencing problem
• Enumerating solutions to grid-based puzzles with a fixed number of rows
• A characterization of achievable patterns of the MN-puzzle problem
• A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles
• A general method of solving Smullyan's puzzles
• Solution sequences for the keyboard problem and its generalizations
• scientific article; zbMATH DE number 1380741
• scientific article; zbMATH DE number 1923055
• An optimal algorithm for Reve's puzzle

Cites work

• scientific article; zbMATH DE number 193367 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 2117212 (Why is no real title available?)
• scientific article; zbMATH DE number 872231 (Why is no real title available?)
• scientific article; zbMATH DE number 3233639 (Why is no real title available?)
• A new class of \(q\)-Fibonacci polynomials
• Bijections for Entringer families
• Catalan Numbers
• DOUBLOONS AND NEW Q-TANGENT NUMBERS
• Doubloons and \(q\)-secant numbers
• More bijections for Entringer and Arnold families
• Some properties of the Fibonacci sequence on an infinite alphabet
• The (t,q)-analogs of secant and tangent numbers

Cited in

(1)

• The enumeration of standard puzzles

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: A skeleton model to enumerate standard puzzle sequences

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