On a General Approach to Bessenrodt–Ono Type Inequalities and Log-Concavity Properties

IF 0.7 4区 数学 Q4 MATHEMATICS, APPLIED Annals of Combinatorics Pub Date : 2024-05-21 DOI:10.1007/s00026-024-00700-7
Krystian Gajdzica, Piotr Miska, Maciej Ulas
{"title":"On a General Approach to Bessenrodt–Ono Type Inequalities and Log-Concavity Properties","authors":"Krystian Gajdzica,&nbsp;Piotr Miska,&nbsp;Maciej Ulas","doi":"10.1007/s00026-024-00700-7","DOIUrl":null,"url":null,"abstract":"<div><p>In recent literature concerning integer partitions one can find many results related to both the Bessenrodt–Ono type inequalities and log-concavity properties. In this note, we offer some general approach to this type of problems. More precisely, we prove that under some mild conditions on an increasing function <i>F</i> of at most exponential growth satisfying the condition <span>\\(F(\\mathbb {N})\\subset \\mathbb {R}_{+}\\)</span>, we have <span>\\(F(a)F(b)&gt;F(a+b)\\)</span> for sufficiently large positive integers <i>a</i>, <i>b</i>. Moreover, we show that if the sequence <span>\\((F(n))_{n\\ge n_{0}}\\)</span> is log-concave and <span>\\(\\limsup _{n\\rightarrow +\\infty }F(n+n_{0})/F(n)&lt;F(n_{0})\\)</span>, then <i>F</i> satisfies the Bessenrodt–Ono type inequality.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"29 1","pages":"211 - 225"},"PeriodicalIF":0.7000,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00026-024-00700-7.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-024-00700-7","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

In recent literature concerning integer partitions one can find many results related to both the Bessenrodt–Ono type inequalities and log-concavity properties. In this note, we offer some general approach to this type of problems. More precisely, we prove that under some mild conditions on an increasing function F of at most exponential growth satisfying the condition \(F(\mathbb {N})\subset \mathbb {R}_{+}\), we have \(F(a)F(b)>F(a+b)\) for sufficiently large positive integers ab. Moreover, we show that if the sequence \((F(n))_{n\ge n_{0}}\) is log-concave and \(\limsup _{n\rightarrow +\infty }F(n+n_{0})/F(n)<F(n_{0})\), then F satisfies the Bessenrodt–Ono type inequality.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于贝森罗德-奥诺型不等式和对数凹凸特性的一般方法
在最近关于整数分割的文献中,人们可以找到许多与贝森罗特-奥诺型不等式和对数凹性有关的结果。在本文中,我们提供了一些解决这类问题的一般方法。更确切地说,我们证明了在一些温和的条件下,对于一个最不超过指数增长的递增函数F满足条件\(F(\mathbb {N})\subset \mathbb {R}_{+}\),我们有\(F(a)F(b)>F(a+b)\)对于足够大的正整数a, b。并且,我们证明了如果序列\((F(n))_{n\ge n_{0}}\)是对数凹的,\(\limsup _{n\rightarrow +\infty }F(n+n_{0})/F(n)<F(n_{0})\),那么F满足Bessenrodt-Ono型不等式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Annals of Combinatorics
Annals of Combinatorics 数学-应用数学
CiteScore
1.00
自引率
0.00%
发文量
56
审稿时长
>12 weeks
期刊介绍: Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board. The scope of Annals of Combinatorics is covered by the following three tracks: Algebraic Combinatorics: Enumerative combinatorics, symmetric functions, Schubert calculus / Combinatorial Hopf algebras, cluster algebras, Lie algebras, root systems, Coxeter groups / Discrete geometry, tropical geometry / Discrete dynamical systems / Posets and lattices Analytic and Algorithmic Combinatorics: Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms Graphs and Matroids: Structural graph theory, graph minors, graph sparsity, decompositions and colorings / Planar graphs and topological graph theory, geometric representations of graphs / Directed graphs, posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs, extremal graph theory / Matroids, oriented matroids, matroid minors / Algorithmic approaches
期刊最新文献
Connected Components and Non-bipartiteness of Generalized Paley Graphs Correction to: The Likely Maximum Size of Twin Subtrees in a Large Random Tree Periods and Atomic Firing Sequences of Parallel Chip-Firing Games on Directed Graphs Zeta Functions of Geometrically Finite Graphs of Groups Equitable and List Equitable Colorings of Planar Graphs Without 5-Cycles
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1