Restricted bargraphs and unimodal compositions

IF 0.9 2区 数学 Q2 MATHEMATICS
Rigoberto Flórez , José L. Ramírez , Diego Villamizar
{"title":"Restricted bargraphs and unimodal compositions","authors":"Rigoberto Flórez ,&nbsp;José L. Ramírez ,&nbsp;Diego Villamizar","doi":"10.1016/j.jcta.2024.105934","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we present a study on <em>polyominoes</em>, which are polygons created by connecting unit squares along their edges. Specifically, we focus on a related concept called a <em>bargraph</em>, which is a path on a lattice in <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mo>≥</mo><mn>0</mn></mrow></msub><mo>×</mo><msub><mrow><mi>Z</mi></mrow><mrow><mo>≥</mo><mn>0</mn></mrow></msub></math></span> traced along the boundaries of a column convex polyomino where the lower edge is on the <em>x</em>-axis. To explore new variations of bargraphs, we introduce the notion of <em>non-decreasing bargraphs</em>, which incorporate an additional restriction concerning the valleys within the path. We establish intriguing connections between these novel objects and unimodal compositions. To facilitate our analysis, we employ generating functions, including <em>q</em>-series, as well as various closed formulas. These tools enable us to enumerate the different types of bargraphs based on their semi-perimeter, area, and the number of peaks. Furthermore, we provide combinatorial justifications for some of the derived closed formulas.</p></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"208 ","pages":"Article 105934"},"PeriodicalIF":0.9000,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0097316524000736/pdfft?md5=f5366b9dc5560c0148e0644514e1990d&pid=1-s2.0-S0097316524000736-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097316524000736","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we present a study on polyominoes, which are polygons created by connecting unit squares along their edges. Specifically, we focus on a related concept called a bargraph, which is a path on a lattice in Z0×Z0 traced along the boundaries of a column convex polyomino where the lower edge is on the x-axis. To explore new variations of bargraphs, we introduce the notion of non-decreasing bargraphs, which incorporate an additional restriction concerning the valleys within the path. We establish intriguing connections between these novel objects and unimodal compositions. To facilitate our analysis, we employ generating functions, including q-series, as well as various closed formulas. These tools enable us to enumerate the different types of bargraphs based on their semi-perimeter, area, and the number of peaks. Furthermore, we provide combinatorial justifications for some of the derived closed formulas.

受限条形图和单模态组合
在本文中,我们将对多面体进行研究,多面体是由单位正方形沿边连接而成的多边形。具体来说,我们关注一个相关的概念,即 "条形图"(bargraph)。"条形图 "是在 Z≥0×Z≥0 的网格上沿着柱凸多面体的边界追踪的路径,其中下边位于 x 轴上。为了探索条形图的新变化,我们引入了非递减条形图的概念,其中包含了关于路径内山谷的额外限制。我们在这些新对象和单模态组合之间建立了有趣的联系。为了便于分析,我们使用了包括 q 序列在内的生成函数以及各种封闭公式。通过这些工具,我们可以根据半周长、面积和峰值数量枚举出不同类型的条形图。此外,我们还为一些推导出的封闭公式提供了组合理由。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.90
自引率
9.10%
发文量
94
审稿时长
12 months
期刊介绍: The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信