Sweet Division Problems: From Chocolate Bars to Honeycomb Strips

DOI10.1080/00029890.2024.2419340MaRDI QIDQ6995647zbMATH OpenFDO

Authors Tomislav Došlić, Luka Podrug

Publication date 17 April 2025

Published in American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00029890.2024.2419340

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Special sequences and polynomials (11B83)

Cites work

• Connected subsets of an \(n\times 2\) rectangle
• Counting Connected Sets of Squares
• Counting Divisions of a 2 × n Rectangular Grid
• Graph compositions. I: Basic enumeration
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1975686 (Why is no real title available?)
• scientific article; zbMATH DE number 2163294 (Why is no real title available?)
• Recounting Fibonacci and Lucas Identities

Cited in

(1)

• Enumeration of colored tilings on graphs via generating functions

This page was built for publication: Sweet Division Problems: From Chocolate Bars to Honeycomb Strips

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