Pub Date : 2024-03-20DOI: 10.1142/s179304212450057x
Milton Espinoza
Following a theorem of Hayes, we give a geometric interpretation of the special value at of certain -cocycle on previously introduced by the author. This work yields three main results: an explicit formula for our cocycle at , a generalization and a new proof of Hayes’ theorem, and an elegant summation formula for the zeroth coefficient of the Ehrhart quasi-polynomial of certain triangles in .
{"title":"The Barnes–Hurwitz zeta cocycle at s = 0 and Ehrhart quasi-polynomials of triangles","authors":"Milton Espinoza","doi":"10.1142/s179304212450057x","DOIUrl":"https://doi.org/10.1142/s179304212450057x","url":null,"abstract":"<p>Following a theorem of Hayes, we give a geometric interpretation of the special value at <span><math altimg=\"eq-00003.gif\" display=\"inline\" overflow=\"scroll\"><mi>s</mi><mo>=</mo><mn>0</mn></math></span><span></span> of certain <span><math altimg=\"eq-00004.gif\" display=\"inline\" overflow=\"scroll\"><mn>1</mn></math></span><span></span>-cocycle on <span><math altimg=\"eq-00005.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mstyle><mtext mathvariant=\"normal\">PGL</mtext></mstyle></mrow><mrow><mn>2</mn></mrow></msub><mo stretchy=\"false\">(</mo><mi>ℚ</mi><mo stretchy=\"false\">)</mo></math></span><span></span> previously introduced by the author. This work yields three main results: an explicit formula for our cocycle at <span><math altimg=\"eq-00006.gif\" display=\"inline\" overflow=\"scroll\"><mi>s</mi><mo>=</mo><mn>0</mn></math></span><span></span>, a generalization and a new proof of Hayes’ theorem, and an elegant summation formula for the zeroth coefficient of the Ehrhart quasi-polynomial of certain triangles in <span><math altimg=\"eq-00007.gif\" display=\"inline\" overflow=\"scroll\"><msup><mrow><mi>ℝ</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span><span></span>.</p>","PeriodicalId":14293,"journal":{"name":"International Journal of Number Theory","volume":"149 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140204340","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-20DOI: 10.1142/s1793042124500702
Shi-Chao Chen
In this paper, we provide an algorithm to detect linear congruences of , the number of MacMahon’s -rowed plane partitions, and give a quantitative result on the nonexistence of Ramanujan-type congruences of the -rowed plane partition functions. We also show that the number of partitions at most parts always admits linear congruences.
在本文中,我们提供了一种检测 plk(n)(麦克马洪 k 行平面分区数)线性全等的算法,并给出了 k 行平面分区函数的拉马努金式全等不存在的定量结果。我们还证明了 p(n,m),即最多有 m 个部分的分割数总是允许线性全等。
{"title":"Linear algebra and congruences for MacMahon’s k-rowed plane partitions","authors":"Shi-Chao Chen","doi":"10.1142/s1793042124500702","DOIUrl":"https://doi.org/10.1142/s1793042124500702","url":null,"abstract":"<p>In this paper, we provide an algorithm to detect linear congruences of <span><math altimg=\"eq-00002.gif\" display=\"inline\" overflow=\"scroll\"><mi>p</mi><msub><mrow><mi>l</mi></mrow><mrow><mi>k</mi></mrow></msub><mo stretchy=\"false\">(</mo><mi>n</mi><mo stretchy=\"false\">)</mo></math></span><span></span>, the number of MacMahon’s <span><math altimg=\"eq-00003.gif\" display=\"inline\" overflow=\"scroll\"><mi>k</mi></math></span><span></span>-rowed plane partitions, and give a quantitative result on the nonexistence of Ramanujan-type congruences of the <span><math altimg=\"eq-00004.gif\" display=\"inline\" overflow=\"scroll\"><mi>k</mi></math></span><span></span>-rowed plane partition functions. We also show <span><math altimg=\"eq-00005.gif\" display=\"inline\" overflow=\"scroll\"><mi>p</mi><mo stretchy=\"false\">(</mo><mi>n</mi><mo>,</mo><mi>m</mi><mo stretchy=\"false\">)</mo></math></span><span></span> that the number of partitions at most <span><math altimg=\"eq-00006.gif\" display=\"inline\" overflow=\"scroll\"><mi>m</mi></math></span><span></span> parts always admits linear congruences.</p>","PeriodicalId":14293,"journal":{"name":"International Journal of Number Theory","volume":"23 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140204255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-20DOI: 10.1142/s179304212450060x
Preston Tranbarger, Jessica Wang
We construct an algorithm that reduces the complexity for computing generalized Dedekind sums from exponential to polynomial time. We do so by using an efficient word rewriting process in group theory.
{"title":"Fast computation of generalized dedekind sums","authors":"Preston Tranbarger, Jessica Wang","doi":"10.1142/s179304212450060x","DOIUrl":"https://doi.org/10.1142/s179304212450060x","url":null,"abstract":"<p>We construct an algorithm that reduces the complexity for computing generalized Dedekind sums from exponential to polynomial time. We do so by using an efficient word rewriting process in group theory.</p>","PeriodicalId":14293,"journal":{"name":"International Journal of Number Theory","volume":"9 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140204260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-20DOI: 10.1142/s1793042124500623
Xiaodong Zhao
By the circle method, an asymptotic formula is established for the number of integer points on certain hypersurfaces within multiprojective space. Using Möbius inversion and the modified hyperbola method, we prove the Manin–Peyre conjecture on the asymptotic behavior of the number of rational points of bounded anticanonical height for certain smooth hypersurfaces in the multiprojective space of sufficiently large dimension.
{"title":"The Manin–Peyre conjecture for certain multiprojective hypersurfaces","authors":"Xiaodong Zhao","doi":"10.1142/s1793042124500623","DOIUrl":"https://doi.org/10.1142/s1793042124500623","url":null,"abstract":"<p>By the circle method, an asymptotic formula is established for the number of integer points on certain hypersurfaces within multiprojective space. Using Möbius inversion and the modified hyperbola method, we prove the Manin–Peyre conjecture on the asymptotic behavior of the number of rational points of bounded anticanonical height for certain smooth hypersurfaces in the multiprojective space of sufficiently large dimension.</p>","PeriodicalId":14293,"journal":{"name":"International Journal of Number Theory","volume":"17 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140204261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-20DOI: 10.1142/s179304212450088x
Jonathan Bayless, Paul Kinlaw, Jared Duker Lichtman
For , let denote the reciprocal sum up to of numbers with prime factors, counted with multiplicity. In prior work, the authors obtained estimates for , extending Mertens’ second theorem, as well as a finer-scale estimate for up to error for any . In this paper, we establish the limiting behavior of the higher Mertens constants from the estimate. We also extend these results to , and we comment on the general case .
对于 k≥1,让ℛk(x)表示具有 k 个质因数的数到 x 的倒数和,以倍数计数。在之前的工作中,作者扩展了梅尔腾斯第二定理,得到了ℛk(x)的估计值,并对任意 N>0 的ℛ2(x)进行了更精细的估计,误差可达 (logx)-N。在本文中,我们从ℛ2(x) 估计中建立了较高默顿常量的极限行为。我们还将这些结果扩展到ℛ3(x),并对 k≥4 的一般情况进行了评论。
{"title":"Higher Mertens constants for almost primes II","authors":"Jonathan Bayless, Paul Kinlaw, Jared Duker Lichtman","doi":"10.1142/s179304212450088x","DOIUrl":"https://doi.org/10.1142/s179304212450088x","url":null,"abstract":"<p>For <span><math altimg=\"eq-00001.gif\" display=\"inline\" overflow=\"scroll\"><mi>k</mi><mo>≥</mo><mn>1</mn></math></span><span></span>, let <span><math altimg=\"eq-00002.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi mathvariant=\"cal\">ℛ</mi></mrow><mrow><mi>k</mi></mrow></msub><mo stretchy=\"false\">(</mo><mi>x</mi><mo stretchy=\"false\">)</mo></math></span><span></span> denote the reciprocal sum up to <span><math altimg=\"eq-00003.gif\" display=\"inline\" overflow=\"scroll\"><mi>x</mi></math></span><span></span> of numbers with <span><math altimg=\"eq-00004.gif\" display=\"inline\" overflow=\"scroll\"><mi>k</mi></math></span><span></span> prime factors, counted with multiplicity. In prior work, the authors obtained estimates for <span><math altimg=\"eq-00005.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi mathvariant=\"cal\">ℛ</mi></mrow><mrow><mi>k</mi></mrow></msub><mo stretchy=\"false\">(</mo><mi>x</mi><mo stretchy=\"false\">)</mo></math></span><span></span>, extending Mertens’ second theorem, as well as a finer-scale estimate for <span><math altimg=\"eq-00006.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi mathvariant=\"cal\">ℛ</mi></mrow><mrow><mn>2</mn></mrow></msub><mo stretchy=\"false\">(</mo><mi>x</mi><mo stretchy=\"false\">)</mo></math></span><span></span> up to <span><math altimg=\"eq-00007.gif\" display=\"inline\" overflow=\"scroll\"><msup><mrow><mo stretchy=\"false\">(</mo><mo>log</mo><mi>x</mi><mo stretchy=\"false\">)</mo></mrow><mrow><mo stretchy=\"false\">−</mo><mi>N</mi></mrow></msup></math></span><span></span> error for any <span><math altimg=\"eq-00008.gif\" display=\"inline\" overflow=\"scroll\"><mi>N</mi><mo>></mo><mn>0</mn></math></span><span></span>. In this paper, we establish the limiting behavior of the higher Mertens constants from the <span><math altimg=\"eq-00009.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi mathvariant=\"cal\">ℛ</mi></mrow><mrow><mn>2</mn></mrow></msub><mo stretchy=\"false\">(</mo><mi>x</mi><mo stretchy=\"false\">)</mo></math></span><span></span> estimate. We also extend these results to <span><math altimg=\"eq-00010.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi mathvariant=\"cal\">ℛ</mi></mrow><mrow><mn>3</mn></mrow></msub><mo stretchy=\"false\">(</mo><mi>x</mi><mo stretchy=\"false\">)</mo></math></span><span></span>, and we comment on the general case <span><math altimg=\"eq-00011.gif\" display=\"inline\" overflow=\"scroll\"><mi>k</mi><mo>≥</mo><mn>4</mn></math></span><span></span>.</p>","PeriodicalId":14293,"journal":{"name":"International Journal of Number Theory","volume":"17 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140204259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-20DOI: 10.1142/s1793042124500465
Pradipto Banerjee
<p>Elementary irreducibility criteria are established for <span><math altimg="eq-00002.gif" display="inline" overflow="scroll"><mi>f</mi><mo stretchy="false">(</mo><msup><mrow><mi>x</mi></mrow><mrow><mi>p</mi></mrow></msup><mo stretchy="false">)</mo></math></span><span></span> where <span><math altimg="eq-00003.gif" display="inline" overflow="scroll"><mi>f</mi><mo stretchy="false">(</mo><mi>x</mi><mo stretchy="false">)</mo><mo>∈</mo><mi>ℤ</mi><mo stretchy="false">[</mo><mi>x</mi><mo stretchy="false">]</mo></math></span><span></span> is irreducible over <span><math altimg="eq-00004.gif" display="inline" overflow="scroll"><mi>ℚ</mi></math></span><span></span> and <span><math altimg="eq-00005.gif" display="inline" overflow="scroll"><mi>p</mi></math></span><span></span> is a prime. For instance, our main criterion implies that if <span><math altimg="eq-00006.gif" display="inline" overflow="scroll"><mi>f</mi><mo stretchy="false">(</mo><msup><mrow><mi>x</mi></mrow><mrow><mi>p</mi></mrow></msup><mo stretchy="false">)</mo></math></span><span></span> is reducible over <span><math altimg="eq-00007.gif" display="inline" overflow="scroll"><mi>ℚ</mi></math></span><span></span>, then <span><math altimg="eq-00008.gif" display="inline" overflow="scroll"><mi>f</mi><mo stretchy="false">(</mo><mi>x</mi><mo stretchy="false">)</mo></math></span><span></span> divides <span><math altimg="eq-00009.gif" display="inline" overflow="scroll"><mi>f</mi><mo stretchy="false">(</mo><msup><mrow><mi>x</mi></mrow><mrow><mi>p</mi></mrow></msup><mo stretchy="false">)</mo></math></span><span></span> modulo <span><math altimg="eq-00010.gif" display="inline" overflow="scroll"><msup><mrow><mi>p</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span><span></span>. Among several applications, it is shown that if <span><math altimg="eq-00011.gif" display="inline" overflow="scroll"><mi>f</mi><mo stretchy="false">(</mo><mi>x</mi><mo stretchy="false">)</mo></math></span><span></span> has coefficients in <span><math altimg="eq-00012.gif" display="inline" overflow="scroll"><mo stretchy="false">{</mo><mo stretchy="false">−</mo><mn>1</mn><mo>,</mo><mn>1</mn><mo stretchy="false">}</mo></math></span><span></span>, then <span><math altimg="eq-00013.gif" display="inline" overflow="scroll"><mi>f</mi><mo stretchy="false">(</mo><msup><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msup><mo stretchy="false">)</mo></math></span><span></span> is irreducible over <span><math altimg="eq-00014.gif" display="inline" overflow="scroll"><mi>ℚ</mi></math></span><span></span> excluding a couple of obvious exceptions. As another application, it is proved that if <span><math altimg="eq-00015.gif" display="inline" overflow="scroll"><mi>n</mi><mo>></mo><mn>4</mn></math></span><span></span> and <span><math altimg="eq-00016.gif" display="inline" overflow="scroll"><msub><mrow><mi>a</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>a</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo>
{"title":"Variations on a theorem of Capelli","authors":"Pradipto Banerjee","doi":"10.1142/s1793042124500465","DOIUrl":"https://doi.org/10.1142/s1793042124500465","url":null,"abstract":"<p>Elementary irreducibility criteria are established for <span><math altimg=\"eq-00002.gif\" display=\"inline\" overflow=\"scroll\"><mi>f</mi><mo stretchy=\"false\">(</mo><msup><mrow><mi>x</mi></mrow><mrow><mi>p</mi></mrow></msup><mo stretchy=\"false\">)</mo></math></span><span></span> where <span><math altimg=\"eq-00003.gif\" display=\"inline\" overflow=\"scroll\"><mi>f</mi><mo stretchy=\"false\">(</mo><mi>x</mi><mo stretchy=\"false\">)</mo><mo>∈</mo><mi>ℤ</mi><mo stretchy=\"false\">[</mo><mi>x</mi><mo stretchy=\"false\">]</mo></math></span><span></span> is irreducible over <span><math altimg=\"eq-00004.gif\" display=\"inline\" overflow=\"scroll\"><mi>ℚ</mi></math></span><span></span> and <span><math altimg=\"eq-00005.gif\" display=\"inline\" overflow=\"scroll\"><mi>p</mi></math></span><span></span> is a prime. For instance, our main criterion implies that if <span><math altimg=\"eq-00006.gif\" display=\"inline\" overflow=\"scroll\"><mi>f</mi><mo stretchy=\"false\">(</mo><msup><mrow><mi>x</mi></mrow><mrow><mi>p</mi></mrow></msup><mo stretchy=\"false\">)</mo></math></span><span></span> is reducible over <span><math altimg=\"eq-00007.gif\" display=\"inline\" overflow=\"scroll\"><mi>ℚ</mi></math></span><span></span>, then <span><math altimg=\"eq-00008.gif\" display=\"inline\" overflow=\"scroll\"><mi>f</mi><mo stretchy=\"false\">(</mo><mi>x</mi><mo stretchy=\"false\">)</mo></math></span><span></span> divides <span><math altimg=\"eq-00009.gif\" display=\"inline\" overflow=\"scroll\"><mi>f</mi><mo stretchy=\"false\">(</mo><msup><mrow><mi>x</mi></mrow><mrow><mi>p</mi></mrow></msup><mo stretchy=\"false\">)</mo></math></span><span></span> modulo <span><math altimg=\"eq-00010.gif\" display=\"inline\" overflow=\"scroll\"><msup><mrow><mi>p</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span><span></span>. Among several applications, it is shown that if <span><math altimg=\"eq-00011.gif\" display=\"inline\" overflow=\"scroll\"><mi>f</mi><mo stretchy=\"false\">(</mo><mi>x</mi><mo stretchy=\"false\">)</mo></math></span><span></span> has coefficients in <span><math altimg=\"eq-00012.gif\" display=\"inline\" overflow=\"scroll\"><mo stretchy=\"false\">{</mo><mo stretchy=\"false\">−</mo><mn>1</mn><mo>,</mo><mn>1</mn><mo stretchy=\"false\">}</mo></math></span><span></span>, then <span><math altimg=\"eq-00013.gif\" display=\"inline\" overflow=\"scroll\"><mi>f</mi><mo stretchy=\"false\">(</mo><msup><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msup><mo stretchy=\"false\">)</mo></math></span><span></span> is irreducible over <span><math altimg=\"eq-00014.gif\" display=\"inline\" overflow=\"scroll\"><mi>ℚ</mi></math></span><span></span> excluding a couple of obvious exceptions. As another application, it is proved that if <span><math altimg=\"eq-00015.gif\" display=\"inline\" overflow=\"scroll\"><mi>n</mi><mo>></mo><mn>4</mn></math></span><span></span> and <span><math altimg=\"eq-00016.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>a</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>a</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo>","PeriodicalId":14293,"journal":{"name":"International Journal of Number Theory","volume":"21 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140204253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-16DOI: 10.1142/s1793042124500477
Xing-Wang Jiang, Wu-Xia Ma
For a given sequence of nonnegative integers, let be the set of all finite subsequence sums of . is called complete if contains all sufficiently large integers. A real number is called as an infinite diadical fraction (briefly i.d.f.) if the digit 1 appears infinitely many times in the binary representation of . Hegyvári conjectured that is complete if or is i.d.f. and , where is a sequence of integers. In this paper, we give a partial result of Hegyvári’s conjecture.
{"title":"A conjecture of Hegyvári","authors":"Xing-Wang Jiang, Wu-Xia Ma","doi":"10.1142/s1793042124500477","DOIUrl":"https://doi.org/10.1142/s1793042124500477","url":null,"abstract":"<p>For a given sequence <span><math altimg=\"eq-00001.gif\" display=\"inline\" overflow=\"scroll\"><mi>A</mi></math></span><span></span> of nonnegative integers, let <span><math altimg=\"eq-00002.gif\" display=\"inline\" overflow=\"scroll\"><mi>P</mi><mo stretchy=\"false\">(</mo><mi>A</mi><mo stretchy=\"false\">)</mo></math></span><span></span> be the set of all finite subsequence sums of <span><math altimg=\"eq-00003.gif\" display=\"inline\" overflow=\"scroll\"><mi>A</mi></math></span><span></span>. <span><math altimg=\"eq-00004.gif\" display=\"inline\" overflow=\"scroll\"><mi>A</mi></math></span><span></span> is called complete if <span><math altimg=\"eq-00005.gif\" display=\"inline\" overflow=\"scroll\"><mi>P</mi><mo stretchy=\"false\">(</mo><mi>A</mi><mo stretchy=\"false\">)</mo></math></span><span></span> contains all sufficiently large integers. A real number <span><math altimg=\"eq-00006.gif\" display=\"inline\" overflow=\"scroll\"><mi>α</mi><mo>></mo><mn>0</mn></math></span><span></span> is called as an infinite diadical fraction (briefly i.d.f.) if the digit 1 appears infinitely many times in the binary representation of <span><math altimg=\"eq-00007.gif\" display=\"inline\" overflow=\"scroll\"><mi>α</mi></math></span><span></span>. Hegyvári conjectured that <span><math altimg=\"eq-00008.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>A</mi></mrow><mrow><mi>α</mi><mo>,</mo><mi>β</mi></mrow></msub></math></span><span></span> is complete if <span><math altimg=\"eq-00009.gif\" display=\"inline\" overflow=\"scroll\"><mi>α</mi></math></span><span></span> or <span><math altimg=\"eq-00010.gif\" display=\"inline\" overflow=\"scroll\"><mi>β</mi></math></span><span></span> is i.d.f. and <span><math altimg=\"eq-00011.gif\" display=\"inline\" overflow=\"scroll\"><mi>α</mi><mo stretchy=\"false\">/</mo><mi>β</mi><mo>≠</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>l</mi></mrow></msup><mspace width=\"0.25em\"></mspace><mo stretchy=\"false\">(</mo><mi>l</mi><mo>∈</mo><mi>ℤ</mi><mo stretchy=\"false\">)</mo></math></span><span></span>, where <span><math altimg=\"eq-00012.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>A</mi></mrow><mrow><mi>α</mi><mo>,</mo><mi>β</mi></mrow></msub><mo>=</mo><mo stretchy=\"false\">{</mo><mo stretchy=\"false\">[</mo><mi>α</mi><mo stretchy=\"false\">]</mo><mo>,</mo><mo stretchy=\"false\">[</mo><mi>β</mi><mo stretchy=\"false\">]</mo><mo>,</mo><mo>…</mo><mo>,</mo><mo stretchy=\"false\">[</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup><mi>α</mi><mo stretchy=\"false\">]</mo><mo>,</mo><mo stretchy=\"false\">[</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup><mi>β</mi><mo stretchy=\"false\">]</mo><mo>,</mo><mo>…</mo><mo stretchy=\"false\">}</mo></math></span><span></span> is a sequence of integers. In this paper, we give a partial result of Hegyvári’s conjecture.</p>","PeriodicalId":14293,"journal":{"name":"International Journal of Number Theory","volume":"40 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140204335","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-13DOI: 10.1142/s1793042124500519
Dominic Lanphier, Allen Lin
We determine new values of certain Dirichlet series and related infinite series. These formulas extend results of several authors. To obtain these results we apply recent expansions of higher derivative formulas of trigonometric functions. We also investigate the transcendentality of values of these series and arithmetic relations of the values of certain related infinite series.
{"title":"Values of certain Dirichlet series and higher derivative formulas of trigonometric functions","authors":"Dominic Lanphier, Allen Lin","doi":"10.1142/s1793042124500519","DOIUrl":"https://doi.org/10.1142/s1793042124500519","url":null,"abstract":"<p>We determine new values of certain Dirichlet series and related infinite series. These formulas extend results of several authors. To obtain these results we apply recent expansions of higher derivative formulas of trigonometric functions. We also investigate the transcendentality of values of these series and arithmetic relations of the values of certain related infinite series.</p>","PeriodicalId":14293,"journal":{"name":"International Journal of Number Theory","volume":"22 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140204257","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-02DOI: 10.1142/s1793042124500179
Fang-Gang Xue
Let [Formula: see text] be the set of integers and [Formula: see text] the set of positive integers. For a nonempty set [Formula: see text] of integers and any integers [Formula: see text], [Formula: see text] with [Formula: see text], define [Formula: see text] as the number of solutions of [Formula: see text], where [Formula: see text] and [Formula: see text] for [Formula: see text] A set [Formula: see text] of integers is defined as a basis of order [Formula: see text] for [Formula: see text] if [Formula: see text] for every integer [Formula: see text]. In 2004, Nešetřil and Serra considered the Erdős–Turán conjecture for a class of bounded bases. In this paper, we generalize the above result and obtain that: for any function [Formula: see text], there exists a bounded basis of order [Formula: see text] for [Formula: see text] such that [Formula: see text] for every integer [Formula: see text].
{"title":"On bounded basis with prescribed representation functions","authors":"Fang-Gang Xue","doi":"10.1142/s1793042124500179","DOIUrl":"https://doi.org/10.1142/s1793042124500179","url":null,"abstract":"Let [Formula: see text] be the set of integers and [Formula: see text] the set of positive integers. For a nonempty set [Formula: see text] of integers and any integers [Formula: see text], [Formula: see text] with [Formula: see text], define [Formula: see text] as the number of solutions of [Formula: see text], where [Formula: see text] and [Formula: see text] for [Formula: see text] A set [Formula: see text] of integers is defined as a basis of order [Formula: see text] for [Formula: see text] if [Formula: see text] for every integer [Formula: see text]. In 2004, Nešetřil and Serra considered the Erdős–Turán conjecture for a class of bounded bases. In this paper, we generalize the above result and obtain that: for any function [Formula: see text], there exists a bounded basis of order [Formula: see text] for [Formula: see text] such that [Formula: see text] for every integer [Formula: see text].","PeriodicalId":14293,"journal":{"name":"International Journal of Number Theory","volume":"57 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135875133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-02DOI: 10.1142/s1793042124500283
Archit Agarwal, Meghali Garg
Ramanujan, in his lost notebook, gave an interesting identity, which generates infinite families of solutions to Euler’s Diophantine equation [Formula: see text]. In this paper, we produce a few infinite families of solutions to the aforementioned Diophantine equation as well as for the Diophantine equation [Formula: see text] in the spirit of Ramanujan.
{"title":"Infinite families of solutions for A3 + B3 = C3 + D3 and A4 + B4 + C4 + D4 + E4 = F4 in the spirit of Ramanujan","authors":"Archit Agarwal, Meghali Garg","doi":"10.1142/s1793042124500283","DOIUrl":"https://doi.org/10.1142/s1793042124500283","url":null,"abstract":"Ramanujan, in his lost notebook, gave an interesting identity, which generates infinite families of solutions to Euler’s Diophantine equation [Formula: see text]. In this paper, we produce a few infinite families of solutions to the aforementioned Diophantine equation as well as for the Diophantine equation [Formula: see text] in the spirit of Ramanujan.","PeriodicalId":14293,"journal":{"name":"International Journal of Number Theory","volume":"57 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135875134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}