Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the log-concavity of $n$-th root of a sequence

Published 23 Dec 2021 in math.CO | (2112.12427v3)

Abstract: In recent years, the log-concavity of ${\sqrt[n]{S_n}}{n\geq 1}$ have been received a lot of attention. Very recently, Sun posed the following conjecture in his new book: the sequences ${\sqrt[n]{a_n}}{n\geq 2}$ and ${ \sqrt[n]{b_n}}{n\geq 1}$ are log-concave, where [ a_n:= \frac{1}{n}\sum{k=0}{n-1} \frac{{n-1\choose k}2{n+k\choose k}2 }{4k2-1} ] and [ b_n:= \frac{1}{n3}\sum_{k=0}{n-1} (3k2+3k+1){n-1\choose k}2 {n+k\choose k}2. ] 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 ${\sqrt[n]{S_n}}_{n\geq 1}$ given by us and a mathematica package due to Hou and Zhang, while the analytic method relies on a result due to Xia.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.