{"title":"关于贝森罗德-奥诺型不等式和对数凹凸特性的一般方法","authors":"Krystian Gajdzica, Piotr Miska, 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)>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)<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.6000,"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":"{\"title\":\"On a General Approach to Bessenrodt–Ono Type Inequalities and Log-Concavity Properties\",\"authors\":\"Krystian Gajdzica, Piotr Miska, 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)>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)<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.6000,\"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}","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}
On a General Approach to Bessenrodt–Ono Type Inequalities and Log-Concavity Properties
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 a, b. 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.
期刊介绍:
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