A skeleton model to enumerate standard puzzle sequences

From MaRDI portal
Publication:2127482

DOI10.3934/ERA.2022010zbMATH Open1486.05015arXiv2106.09471OpenAlexW4206486261MaRDI QIDQ2127482FDOQ2127482

Jiaxi Lu, Yuanzhe Ding, Shishuo Fu

Publication date: 20 April 2022

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

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.


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




Recommendations




Cites Work


Uses Software





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)