The enumeration of standard puzzles

zbMATH Open1489.05004arXiv2006.14070MaRDI QIDQ2145991FDOQ2145991

Authors: Guo-Niu Han 

Publication date: 15 June 2022

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Abstract: We introduce a large family of combinatorial objects, called standard puzzles, defined by very simple rules. We focus on the standard puzzles for which the enumeration problems can be solved by explicit formulas or by classical numbers, such as binomial coefficients, Fibonacci numbers, tangent numbers, Catalan numbers, $ldots$

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• A skeleton model to enumerate standard puzzle sequences
• DHD-puzzles
• ECO:a methodology for the enumeration of combinatorial objects
• Hall polynomials, inverse Kostka polynomials and puzzles
• Puzzles, tableaux, and mosaics

zbMATH Keywords

Catalan numbersFibonacci numbersinteger sequencestangent numbersstandard puzzles

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Polyominoes (05B50)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Hook Graphs of the Symmetric Group
• Doubloons and \(q\)-secant numbers
• DOUBLOONS AND NEW Q-TANGENT NUMBERS
• Interpretations combinatoires des nombres de Genocchi
• Enumerating split-pair arrangements

Cited In (3)

• A skeleton model to enumerate standard puzzle sequences
• DHD-puzzles
• Title not available (Why is that?)

Uses Software

• OEIS

This page was built for publication: The enumeration of standard puzzles

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