关于沿线性模式的乘法递归

IF 1.2 2区 数学 Q1 MATHEMATICS
Dimitrios Charamaras, Andreas Mountakis, Konstantinos Tsinas
{"title":"关于沿线性模式的乘法递归","authors":"Dimitrios Charamaras,&nbsp;Andreas Mountakis,&nbsp;Konstantinos Tsinas","doi":"10.1112/jlms.70292","DOIUrl":null,"url":null,"abstract":"<p>Donoso, Le, Moreira, and Sun (<i>J. Anal. Math</i>. 149 (2023), 719–761) study sets of recurrence for actions of the multiplicative semigroup <span></span><math>\n <semantics>\n <mrow>\n <mo>(</mo>\n <mi>N</mi>\n <mo>,</mo>\n <mo>×</mo>\n <mo>)</mo>\n </mrow>\n <annotation>$(\\mathbb {N}, \\times)$</annotation>\n </semantics></math> and provide some sufficient conditions for sets of the form <span></span><math>\n <semantics>\n <mrow>\n <mi>S</mi>\n <mo>=</mo>\n <mo>{</mo>\n <mo>(</mo>\n <mi>a</mi>\n <mi>n</mi>\n <mo>+</mo>\n <mi>b</mi>\n <mo>)</mo>\n <mo>/</mo>\n <mo>(</mo>\n <mi>c</mi>\n <mi>n</mi>\n <mo>+</mo>\n <mi>d</mi>\n <mo>)</mo>\n <mo>:</mo>\n <mi>n</mi>\n <mo>∈</mo>\n <mi>N</mi>\n <mo>}</mo>\n </mrow>\n <annotation>$S=\\lbrace (an+b)/(cn+d) \\colon n \\in \\mathbb {N}\\rbrace $</annotation>\n </semantics></math> to be sets of recurrence for such actions. A necessary condition for <span></span><math>\n <semantics>\n <mi>S</mi>\n <annotation>$S$</annotation>\n </semantics></math> to be a set of multiplicative recurrence is that for every completely multiplicative function <span></span><math>\n <semantics>\n <mi>f</mi>\n <annotation>$f$</annotation>\n </semantics></math> taking values on the unit circle, we have that <span></span><math>\n <semantics>\n <mrow>\n <msub>\n <mo>lim inf</mo>\n <mrow>\n <mi>n</mi>\n <mo>→</mo>\n <mi>∞</mi>\n </mrow>\n </msub>\n <mrow>\n <mo>|</mo>\n <mi>f</mi>\n <mrow>\n <mo>(</mo>\n <mi>a</mi>\n <mi>n</mi>\n <mo>+</mo>\n <mi>b</mi>\n <mo>)</mo>\n </mrow>\n <mo>−</mo>\n <mi>f</mi>\n <mrow>\n <mo>(</mo>\n <mi>c</mi>\n <mi>n</mi>\n <mo>+</mo>\n <mi>d</mi>\n <mo>)</mo>\n </mrow>\n <mo>|</mo>\n </mrow>\n <mo>=</mo>\n <mn>0</mn>\n </mrow>\n <annotation>$\\liminf _{n \\rightarrow \\infty } |f(an+b)-f(cn+d)|=0$</annotation>\n </semantics></math>. In this article, we fully characterize the integer quadruples <span></span><math>\n <semantics>\n <mrow>\n <mo>(</mo>\n <mi>a</mi>\n <mo>,</mo>\n <mi>b</mi>\n <mo>,</mo>\n <mi>c</mi>\n <mo>,</mo>\n <mi>d</mi>\n <mo>)</mo>\n </mrow>\n <annotation>$(a,b,c,d)$</annotation>\n </semantics></math> which satisfy the latter property. Our result generalizes a result of Klurman and Mangerel (<i>Math. Ann</i>. 372 (2018), 651–697) concerning the pair <span></span><math>\n <semantics>\n <mrow>\n <mo>(</mo>\n <mi>n</mi>\n <mo>,</mo>\n <mi>n</mi>\n <mo>+</mo>\n <mn>1</mn>\n <mo>)</mo>\n </mrow>\n <annotation>$(n,n+1)$</annotation>\n </semantics></math>, as well as some results from (Donoso, Le, Moreira, and Sun, <i>J. Anal. Math</i>. 149 (2023), 719–761). In addition, we prove that, under the same conditions on <span></span><math>\n <semantics>\n <mrow>\n <mo>(</mo>\n <mi>a</mi>\n <mo>,</mo>\n <mi>b</mi>\n <mo>,</mo>\n <mi>c</mi>\n <mo>,</mo>\n <mi>d</mi>\n <mo>)</mo>\n </mrow>\n <annotation>$(a,b,c,d)$</annotation>\n </semantics></math>, the set <span></span><math>\n <semantics>\n <mi>S</mi>\n <annotation>$S$</annotation>\n </semantics></math> is a set of recurrence for finitely generated actions of <span></span><math>\n <semantics>\n <mrow>\n <mo>(</mo>\n <mi>N</mi>\n <mo>,</mo>\n <mo>×</mo>\n <mo>)</mo>\n </mrow>\n <annotation>$(\\mathbb {N}, \\times)$</annotation>\n </semantics></math>.</p>","PeriodicalId":49989,"journal":{"name":"Journal of the London Mathematical Society-Second Series","volume":"112 3","pages":""},"PeriodicalIF":1.2000,"publicationDate":"2025-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://londmathsoc.onlinelibrary.wiley.com/doi/epdf/10.1112/jlms.70292","citationCount":"0","resultStr":"{\"title\":\"On multiplicative recurrence along linear patterns\",\"authors\":\"Dimitrios Charamaras,&nbsp;Andreas Mountakis,&nbsp;Konstantinos Tsinas\",\"doi\":\"10.1112/jlms.70292\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Donoso, Le, Moreira, and Sun (<i>J. Anal. Math</i>. 149 (2023), 719–761) study sets of recurrence for actions of the multiplicative semigroup <span></span><math>\\n <semantics>\\n <mrow>\\n <mo>(</mo>\\n <mi>N</mi>\\n <mo>,</mo>\\n <mo>×</mo>\\n <mo>)</mo>\\n </mrow>\\n <annotation>$(\\\\mathbb {N}, \\\\times)$</annotation>\\n </semantics></math> and provide some sufficient conditions for sets of the form <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>S</mi>\\n <mo>=</mo>\\n <mo>{</mo>\\n <mo>(</mo>\\n <mi>a</mi>\\n <mi>n</mi>\\n <mo>+</mo>\\n <mi>b</mi>\\n <mo>)</mo>\\n <mo>/</mo>\\n <mo>(</mo>\\n <mi>c</mi>\\n <mi>n</mi>\\n <mo>+</mo>\\n <mi>d</mi>\\n <mo>)</mo>\\n <mo>:</mo>\\n <mi>n</mi>\\n <mo>∈</mo>\\n <mi>N</mi>\\n <mo>}</mo>\\n </mrow>\\n <annotation>$S=\\\\lbrace (an+b)/(cn+d) \\\\colon n \\\\in \\\\mathbb {N}\\\\rbrace $</annotation>\\n </semantics></math> to be sets of recurrence for such actions. A necessary condition for <span></span><math>\\n <semantics>\\n <mi>S</mi>\\n <annotation>$S$</annotation>\\n </semantics></math> to be a set of multiplicative recurrence is that for every completely multiplicative function <span></span><math>\\n <semantics>\\n <mi>f</mi>\\n <annotation>$f$</annotation>\\n </semantics></math> taking values on the unit circle, we have that <span></span><math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mo>lim inf</mo>\\n <mrow>\\n <mi>n</mi>\\n <mo>→</mo>\\n <mi>∞</mi>\\n </mrow>\\n </msub>\\n <mrow>\\n <mo>|</mo>\\n <mi>f</mi>\\n <mrow>\\n <mo>(</mo>\\n <mi>a</mi>\\n <mi>n</mi>\\n <mo>+</mo>\\n <mi>b</mi>\\n <mo>)</mo>\\n </mrow>\\n <mo>−</mo>\\n <mi>f</mi>\\n <mrow>\\n <mo>(</mo>\\n <mi>c</mi>\\n <mi>n</mi>\\n <mo>+</mo>\\n <mi>d</mi>\\n <mo>)</mo>\\n </mrow>\\n <mo>|</mo>\\n </mrow>\\n <mo>=</mo>\\n <mn>0</mn>\\n </mrow>\\n <annotation>$\\\\liminf _{n \\\\rightarrow \\\\infty } |f(an+b)-f(cn+d)|=0$</annotation>\\n </semantics></math>. In this article, we fully characterize the integer quadruples <span></span><math>\\n <semantics>\\n <mrow>\\n <mo>(</mo>\\n <mi>a</mi>\\n <mo>,</mo>\\n <mi>b</mi>\\n <mo>,</mo>\\n <mi>c</mi>\\n <mo>,</mo>\\n <mi>d</mi>\\n <mo>)</mo>\\n </mrow>\\n <annotation>$(a,b,c,d)$</annotation>\\n </semantics></math> which satisfy the latter property. Our result generalizes a result of Klurman and Mangerel (<i>Math. Ann</i>. 372 (2018), 651–697) concerning the pair <span></span><math>\\n <semantics>\\n <mrow>\\n <mo>(</mo>\\n <mi>n</mi>\\n <mo>,</mo>\\n <mi>n</mi>\\n <mo>+</mo>\\n <mn>1</mn>\\n <mo>)</mo>\\n </mrow>\\n <annotation>$(n,n+1)$</annotation>\\n </semantics></math>, as well as some results from (Donoso, Le, Moreira, and Sun, <i>J. Anal. Math</i>. 149 (2023), 719–761). In addition, we prove that, under the same conditions on <span></span><math>\\n <semantics>\\n <mrow>\\n <mo>(</mo>\\n <mi>a</mi>\\n <mo>,</mo>\\n <mi>b</mi>\\n <mo>,</mo>\\n <mi>c</mi>\\n <mo>,</mo>\\n <mi>d</mi>\\n <mo>)</mo>\\n </mrow>\\n <annotation>$(a,b,c,d)$</annotation>\\n </semantics></math>, the set <span></span><math>\\n <semantics>\\n <mi>S</mi>\\n <annotation>$S$</annotation>\\n </semantics></math> is a set of recurrence for finitely generated actions of <span></span><math>\\n <semantics>\\n <mrow>\\n <mo>(</mo>\\n <mi>N</mi>\\n <mo>,</mo>\\n <mo>×</mo>\\n <mo>)</mo>\\n </mrow>\\n <annotation>$(\\\\mathbb {N}, \\\\times)$</annotation>\\n </semantics></math>.</p>\",\"PeriodicalId\":49989,\"journal\":{\"name\":\"Journal of the London Mathematical Society-Second Series\",\"volume\":\"112 3\",\"pages\":\"\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2025-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://londmathsoc.onlinelibrary.wiley.com/doi/epdf/10.1112/jlms.70292\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the London Mathematical Society-Second Series\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://londmathsoc.onlinelibrary.wiley.com/doi/10.1112/jlms.70292\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the London Mathematical Society-Second Series","FirstCategoryId":"100","ListUrlMain":"https://londmathsoc.onlinelibrary.wiley.com/doi/10.1112/jlms.70292","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

Donoso, Le, Moreira和Sun (J. Anal)。数学。149(2023),719-761)研究乘法半群(N;×) $(\mathbb {N}, \times)$,并给出S = {(an + b) / (c n)形式的集合的一些充分条件+ d): n∈n}$S=\lbrace (an+b)/(cn+d) \colon n \in \mathbb {N}\rbrace $为这些动作的递归集。S $S$是一组乘法递归式的必要条件是对于每一个在单位圆上取值的完全乘法函数f $f$,我们有lim n→∞| f (a n + b)−f (c n + d) | = 0 $\liminf _{n \rightarrow \infty } |f(an+b)-f(cn+d)|=0$。在本文中,我们完全刻画了满足后一个性质的整数四元组(a, b, c, d) $(a,b,c,d)$。我们的结果推广了Klurman和Mangerel(数学)的结果。Ann. 372(2018), 651-697)关于对(n, n + 1) $(n,n+1)$,以及(Donoso, Le, Moreira, and Sun, J. Anal.)的一些结果。数学。149(2023),719-761)。此外,证明了在(a, b, c, d) $(a,b,c,d)$相同条件下,集合S $S$是有限生成动作(N, x) $(\mathbb {N}, \times)$的递归集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

On multiplicative recurrence along linear patterns

On multiplicative recurrence along linear patterns

On multiplicative recurrence along linear patterns

Donoso, Le, Moreira, and Sun (J. Anal. Math. 149 (2023), 719–761) study sets of recurrence for actions of the multiplicative semigroup ( N , × ) $(\mathbb {N}, \times)$ and provide some sufficient conditions for sets of the form S = { ( a n + b ) / ( c n + d ) : n N } $S=\lbrace (an+b)/(cn+d) \colon n \in \mathbb {N}\rbrace $ to be sets of recurrence for such actions. A necessary condition for S $S$ to be a set of multiplicative recurrence is that for every completely multiplicative function f $f$ taking values on the unit circle, we have that lim inf n | f ( a n + b ) f ( c n + d ) | = 0 $\liminf _{n \rightarrow \infty } |f(an+b)-f(cn+d)|=0$ . In this article, we fully characterize the integer quadruples ( a , b , c , d ) $(a,b,c,d)$ which satisfy the latter property. Our result generalizes a result of Klurman and Mangerel (Math. Ann. 372 (2018), 651–697) concerning the pair ( n , n + 1 ) $(n,n+1)$ , as well as some results from (Donoso, Le, Moreira, and Sun, J. Anal. Math. 149 (2023), 719–761). In addition, we prove that, under the same conditions on ( a , b , c , d ) $(a,b,c,d)$ , the set S $S$ is a set of recurrence for finitely generated actions of ( N , × ) $(\mathbb {N}, \times)$ .

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.90
自引率
0.00%
发文量
186
审稿时长
6-12 weeks
期刊介绍: The Journal of the London Mathematical Society has been publishing leading research in a broad range of mathematical subject areas since 1926. The Journal welcomes papers on subjects of general interest that represent a significant advance in mathematical knowledge, as well as submissions that are deemed to stimulate new interest and research activity.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信