Sweet division problems: from chocolate bars to honeycomb strips and back

Sweet division problems: from chocolate bars to honeycomb strips and back

We consider two division problems on narrow strips of square and hexagonal lattices. In both cases we compute the bivariate enumerating sequences and the corresponding generating functions, which allowed us to determine the asymptotic behavior of the total number of such subdivisions and the expecte...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Došlić, Tomislav, Podrug, Luka
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Došlić, Tomislav
Podrug, Luka
description We consider two division problems on narrow strips of square and hexagonal lattices. In both cases we compute the bivariate enumerating sequences and the corresponding generating functions, which allowed us to determine the asymptotic behavior of the total number of such subdivisions and the expected number of parts. For the square lattice we extend results of two recent references by establishing polynomiality of enumerating sequences forming columns and diagonals of the triangular enumerating sequence. In the hexagonal case, we find a number of new combinatorial interpretations of the Fibonacci numbers and find combinatorial proofs of some Fibonacci related identities. We also show how both cases could be treated via the transfer matrix method and discuss some directions for future research.
doi_str_mv 10.48550/arxiv.2304.12121
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2304_12121</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2304_12121</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-abd29e0ce7580e20b9886fd759ca0f89321244f2992c1949aa50224f3705416e3</originalsourceid><addsrcrecordid>eNotj8tOwzAURL1hgQofwAr_QIKfic0OVTwqVWJB99G1c61aJHFkR4X-PaGgWcxipKM5hNxxViujNXuA_B1PtZBM1VysuSa7jy_EhfbxFEtME51zcgOO5ZGGnEbqj8mnARakDnKhS6LHNOHZp9HRsuQ4FwpTv47-84ZcBRgK3v73hhxeng_bt2r__rrbPu0raFpegeuFReax1YahYM4a04S-1dYDC8bK9ZZSQVgrPLfKAmgmhAqyZVrxBuWG3P9hLy7dnOMI-dz9OnUXJ_kD8KpGMw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Sweet division problems: from chocolate bars to honeycomb strips and back</title><source>arXiv.org</source><creator>Došlić, Tomislav ; Podrug, Luka</creator><creatorcontrib>Došlić, Tomislav ; Podrug, Luka</creatorcontrib><description>We consider two division problems on narrow strips of square and hexagonal lattices. In both cases we compute the bivariate enumerating sequences and the corresponding generating functions, which allowed us to determine the asymptotic behavior of the total number of such subdivisions and the expected number of parts. For the square lattice we extend results of two recent references by establishing polynomiality of enumerating sequences forming columns and diagonals of the triangular enumerating sequence. In the hexagonal case, we find a number of new combinatorial interpretations of the Fibonacci numbers and find combinatorial proofs of some Fibonacci related identities. We also show how both cases could be treated via the transfer matrix method and discuss some directions for future research.</description><identifier>DOI: 10.48550/arxiv.2304.12121</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2023-04</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2304.12121$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2304.12121$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Došlić, Tomislav</creatorcontrib><creatorcontrib>Podrug, Luka</creatorcontrib><title>Sweet division problems: from chocolate bars to honeycomb strips and back</title><description>We consider two division problems on narrow strips of square and hexagonal lattices. In both cases we compute the bivariate enumerating sequences and the corresponding generating functions, which allowed us to determine the asymptotic behavior of the total number of such subdivisions and the expected number of parts. For the square lattice we extend results of two recent references by establishing polynomiality of enumerating sequences forming columns and diagonals of the triangular enumerating sequence. In the hexagonal case, we find a number of new combinatorial interpretations of the Fibonacci numbers and find combinatorial proofs of some Fibonacci related identities. We also show how both cases could be treated via the transfer matrix method and discuss some directions for future research.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tOwzAURL1hgQofwAr_QIKfic0OVTwqVWJB99G1c61aJHFkR4X-PaGgWcxipKM5hNxxViujNXuA_B1PtZBM1VysuSa7jy_EhfbxFEtME51zcgOO5ZGGnEbqj8mnARakDnKhS6LHNOHZp9HRsuQ4FwpTv47-84ZcBRgK3v73hhxeng_bt2r__rrbPu0raFpegeuFReax1YahYM4a04S-1dYDC8bK9ZZSQVgrPLfKAmgmhAqyZVrxBuWG3P9hLy7dnOMI-dz9OnUXJ_kD8KpGMw</recordid><startdate>20230424</startdate><enddate>20230424</enddate><creator>Došlić, Tomislav</creator><creator>Podrug, Luka</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20230424</creationdate><title>Sweet division problems: from chocolate bars to honeycomb strips and back</title><author>Došlić, Tomislav ; Podrug, Luka</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-abd29e0ce7580e20b9886fd759ca0f89321244f2992c1949aa50224f3705416e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Došlić, Tomislav</creatorcontrib><creatorcontrib>Podrug, Luka</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Došlić, Tomislav</au><au>Podrug, Luka</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Sweet division problems: from chocolate bars to honeycomb strips and back</atitle><date>2023-04-24</date><risdate>2023</risdate><abstract>We consider two division problems on narrow strips of square and hexagonal lattices. In both cases we compute the bivariate enumerating sequences and the corresponding generating functions, which allowed us to determine the asymptotic behavior of the total number of such subdivisions and the expected number of parts. For the square lattice we extend results of two recent references by establishing polynomiality of enumerating sequences forming columns and diagonals of the triangular enumerating sequence. In the hexagonal case, we find a number of new combinatorial interpretations of the Fibonacci numbers and find combinatorial proofs of some Fibonacci related identities. We also show how both cases could be treated via the transfer matrix method and discuss some directions for future research.</abstract><doi>10.48550/arxiv.2304.12121</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2304.12121
ispartof
issn
language eng
recordid cdi_arxiv_primary_2304_12121
source arXiv.org
subjects Mathematics - Combinatorics
title Sweet division problems: from chocolate bars to honeycomb strips and back
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T19%3A29%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Sweet%20division%20problems:%20from%20chocolate%20bars%20to%20honeycomb%20strips%20and%20back&rft.au=Do%C5%A1li%C4%87,%20Tomislav&rft.date=2023-04-24&rft_id=info:doi/10.48550/arxiv.2304.12121&rft_dat=%3Carxiv_GOX%3E2304_12121%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true