A skeleton model to enumerate standard puzzle sequences

DOI10.3934/era.2022010zbMath1486.05015arXiv2106.09471OpenAlexW4206486261MaRDI QIDQ2127482

Jiaxi Lu, Yuanzhe Ding, Shishuo Fu

Publication date: 20 April 2022

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

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

zbMATH Keywords

Catalan numberhypergeometric seriesenumerationbijective combinatoricsdouble factorialsecant numberstandard puzzle

Mathematics Subject Classification ID

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

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \((t,q)\)-analogs of secant and tangent numbers
• Bijections for Entringer families
• A new class of \(q\)-Fibonacci polynomials
• More bijections for Entringer and Arnold families
• Some properties of the Fibonacci sequence on an infinite alphabet
• DOUBLOONS AND NEW Q-TANGENT NUMBERS
• Catalan Numbers

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