{"title":"On the log-concavity of the n-th root of sequences","authors":"Ernest X.W. Xia , Zuo-Ru Zhang","doi":"10.1016/j.jsc.2024.102349","DOIUrl":null,"url":null,"abstract":"<div><p>In recent years, the log-concavity of the <em>n</em>-th root of a sequence <span><math><msub><mrow><mo>{</mo><mroot><mrow><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow><mrow><mi>n</mi></mrow></mroot><mo>}</mo></mrow><mrow><mi>n</mi><mo>≥</mo><mn>1</mn></mrow></msub></math></span> has been received a lot of attention. Recently, Sun posed the following conjecture in his new book: the sequences <span><math><msub><mrow><mo>{</mo><mroot><mrow><msub><mrow><mi>a</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow><mrow><mi>n</mi></mrow></mroot><mo>}</mo></mrow><mrow><mi>n</mi><mo>≥</mo><mn>2</mn></mrow></msub></math></span> and <span><math><msub><mrow><mo>{</mo><mroot><mrow><msub><mrow><mi>b</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow><mrow><mi>n</mi></mrow></mroot><mo>}</mo></mrow><mrow><mi>n</mi><mo>≥</mo><mn>1</mn></mrow></msub></math></span> are log-concave, where<span><span><span><math><msub><mrow><mi>a</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>:</mo><mo>=</mo><mfrac><mrow><mn>1</mn></mrow><mrow><mi>n</mi></mrow></mfrac><munderover><mo>∑</mo><mrow><mi>k</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></munderover><mfrac><mrow><msup><mrow><mo>(</mo><mtable><mtr><mtd><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></mtd></mtr><mtr><mtd><mi>k</mi></mtd></mtr></mtable><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><msup><mrow><mo>(</mo><mtable><mtr><mtd><mrow><mi>n</mi><mo>+</mo><mi>k</mi></mrow></mtd></mtr><mtr><mtd><mi>k</mi></mtd></mtr></mtable><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup></mrow><mrow><mn>4</mn><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>−</mo><mn>1</mn></mrow></mfrac></math></span></span></span> and<span><span><span><math><msub><mrow><mi>b</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>:</mo><mo>=</mo><mfrac><mrow><mn>1</mn></mrow><mrow><msup><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msup></mrow></mfrac><munderover><mo>∑</mo><mrow><mi>k</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></munderover><mo>(</mo><mn>3</mn><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>+</mo><mn>3</mn><mi>k</mi><mo>+</mo><mn>1</mn><mo>)</mo><msup><mrow><mo>(</mo><mtable><mtr><mtd><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></mtd></mtr><mtr><mtd><mi>k</mi></mtd></mtr></mtable><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><msup><mrow><mo>(</mo><mtable><mtr><mtd><mrow><mi>n</mi><mo>+</mo><mi>k</mi></mrow></mtd></mtr><mtr><mtd><mi>k</mi></mtd></mtr></mtable><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><mo>.</mo></math></span></span></span> In this paper, two methods, semi-automatic and analytic methods, are used to confirm Sun's conjecture. The semi-automatic method relies on a criterion on the log-concavity of <span><math><msub><mrow><mo>{</mo><mroot><mrow><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow><mrow><mi>n</mi></mrow></mroot><mo>}</mo></mrow><mrow><mi>n</mi><mo>≥</mo><mn>1</mn></mrow></msub></math></span> given by us and a mathematica package due to Hou and Zhang, while the analytic method relies on a result due to Xia.</p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"127 ","pages":"Article 102349"},"PeriodicalIF":0.6000,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Symbolic Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0747717124000531","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
In recent years, the log-concavity of the n-th root of a sequence has been received a lot of attention. Recently, Sun posed the following conjecture in his new book: the sequences and are log-concave, where and In this paper, two methods, semi-automatic and analytic methods, are used to confirm Sun's conjecture. The semi-automatic method relies on a criterion on the log-concavity of given by us and a mathematica package due to Hou and Zhang, while the analytic method relies on a result due to Xia.
期刊介绍:
An international journal, the Journal of Symbolic Computation, founded by Bruno Buchberger in 1985, is directed to mathematicians and computer scientists who have a particular interest in symbolic computation. The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects.
It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas. It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation. To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.