关于不可容许集和完全工频的Berkovich–Uncu型划分不等式

Pub Date : 2023-03-16 DOI:10.1007/s00026-023-00638-2
Damanvir Singh Binner, Neha Gupta, Manoj Upreti
{"title":"关于不可容许集和完全工频的Berkovich–Uncu型划分不等式","authors":"Damanvir Singh Binner,&nbsp;Neha Gupta,&nbsp;Manoj Upreti","doi":"10.1007/s00026-023-00638-2","DOIUrl":null,"url":null,"abstract":"<div><p>Recently, Rattan and the first author (Ann. Comb. 25 (2021) 697–728) proved a conjectured inequality of Berkovich and Uncu (Ann. Comb. 23 (2019) 263–284) concerning partitions with an impermissible part. In this article, we generalize this inequality upon considering <i>t</i> impermissible parts. We compare these with partitions whose certain parts appear with a frequency which is a perfect <span>\\(t^{th}\\)</span> power. In addition, the partitions that we study here have smallest part greater than or equal to <i>s</i> for some given natural number <i>s</i>. Our inequalities hold after a certain bound, which for given <i>t</i> is a polynomial in <i>s</i>, a major improvement over the previously known bound in the case <span>\\(t=1\\)</span>. To prove these inequalities, our methods involve constructing injective maps between the relevant sets of partitions. The construction of these maps crucially involves concepts from analysis and calculus, such as explicit maps used to prove countability of <span>\\(\\mathbb {N}^t\\)</span>, and Jensen’s inequality for convex functions, and then merge them with techniques from number theory such as Frobenius numbers, congruence classes, binary numbers and quadratic residues. We also show a connection of our results to colored partitions. Finally, we pose an open problem which seems to be related to power residues and the almost universality of diagonal ternary quadratic forms.</p></div>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00026-023-00638-2.pdf","citationCount":"0","resultStr":"{\"title\":\"Berkovich–Uncu Type Partition Inequalities Concerning Impermissible Sets and Perfect Power Frequencies\",\"authors\":\"Damanvir Singh Binner,&nbsp;Neha Gupta,&nbsp;Manoj Upreti\",\"doi\":\"10.1007/s00026-023-00638-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Recently, Rattan and the first author (Ann. Comb. 25 (2021) 697–728) proved a conjectured inequality of Berkovich and Uncu (Ann. Comb. 23 (2019) 263–284) concerning partitions with an impermissible part. In this article, we generalize this inequality upon considering <i>t</i> impermissible parts. We compare these with partitions whose certain parts appear with a frequency which is a perfect <span>\\\\(t^{th}\\\\)</span> power. In addition, the partitions that we study here have smallest part greater than or equal to <i>s</i> for some given natural number <i>s</i>. Our inequalities hold after a certain bound, which for given <i>t</i> is a polynomial in <i>s</i>, a major improvement over the previously known bound in the case <span>\\\\(t=1\\\\)</span>. To prove these inequalities, our methods involve constructing injective maps between the relevant sets of partitions. The construction of these maps crucially involves concepts from analysis and calculus, such as explicit maps used to prove countability of <span>\\\\(\\\\mathbb {N}^t\\\\)</span>, and Jensen’s inequality for convex functions, and then merge them with techniques from number theory such as Frobenius numbers, congruence classes, binary numbers and quadratic residues. We also show a connection of our results to colored partitions. Finally, we pose an open problem which seems to be related to power residues and the almost universality of diagonal ternary quadratic forms.</p></div>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2023-03-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s00026-023-00638-2.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00026-023-00638-2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-023-00638-2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

最近,Rattan和第一作者(Ann.Comb.25(2021)697–728)证明了Berkovich和Uncu(Ann.Com.23(2019)263–284)关于不允许部分的分区的一个猜想不等式。在本文中,我们在考虑t个不允许部分的基础上推广了这个不等式。我们将它们与某些部分以完美的(t^{th})幂的频率出现的分区进行比较。此外,对于某些给定的自然数s,我们在这里研究的分区具有大于或等于s的最小部分。我们的不等式在某个界之后成立,对于给定的t,该界是s中的多项式,这是对先前已知的情况\(t=1\)下的界的主要改进。为了证明这些不等式,我们的方法包括在相关的分区集之间构造内射映射。这些映射的构造主要涉及分析和微积分中的概念,例如用于证明\(\mathbb{N}^t\)的可数性的显式映射,以及凸函数的Jensen不等式,然后将它们与数论中的技术相结合,如Frobenius数、同余类、二进制数和二次残差。我们还展示了我们的结果与彩色分区的联系。最后,我们提出了一个似乎与幂残和对角三元二次型的几乎普遍性有关的开放问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
分享
查看原文
Berkovich–Uncu Type Partition Inequalities Concerning Impermissible Sets and Perfect Power Frequencies

Recently, Rattan and the first author (Ann. Comb. 25 (2021) 697–728) proved a conjectured inequality of Berkovich and Uncu (Ann. Comb. 23 (2019) 263–284) concerning partitions with an impermissible part. In this article, we generalize this inequality upon considering t impermissible parts. We compare these with partitions whose certain parts appear with a frequency which is a perfect \(t^{th}\) power. In addition, the partitions that we study here have smallest part greater than or equal to s for some given natural number s. Our inequalities hold after a certain bound, which for given t is a polynomial in s, a major improvement over the previously known bound in the case \(t=1\). To prove these inequalities, our methods involve constructing injective maps between the relevant sets of partitions. The construction of these maps crucially involves concepts from analysis and calculus, such as explicit maps used to prove countability of \(\mathbb {N}^t\), and Jensen’s inequality for convex functions, and then merge them with techniques from number theory such as Frobenius numbers, congruence classes, binary numbers and quadratic residues. We also show a connection of our results to colored partitions. Finally, we pose an open problem which seems to be related to power residues and the almost universality of diagonal ternary quadratic forms.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
×
引用
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学术官方微信