2
$\begingroup$

I'm looking for polynomial lower estimates for beta function, and what I've found so far is this, which can be found in proposition 2.3 in this paper

Proposition 2.3 1. If $0<𝑞<1$ and $𝑝 \geq 𝑞$, then $\dfrac{2^{2(1-q)}}{p-q+1} \leq 𝐵(𝑝,𝑞)$. where $$𝐵(𝑝,𝑞)=\int_{0}^1𝑡^{𝑝−1}(1−𝑡)^{𝑞−1} 𝑑𝑡.$$ From this proposition it follows for example that $\dfrac{1}{p-q+1} \leq 𝐵(𝑝,𝑞).$ (1)

I wanted to know if this inequality is optimal, if it is the best possible polynomial estimate. In fact, the paper presents some other estimates, but of an exponential type. I find this condition $0<𝑞<1$ restrictive, are there estimates of type (1) without this restriction? I would appreciate it if you could refer me to works with such estimates.

Thanks in advance.

$\endgroup$
6
  • 1
    $\begingroup$ What do mean by "the best possible polynomial estimate"? $\endgroup$ Commented May 26, 2024 at 16:18
  • 1
    $\begingroup$ $B(x,x)\sim 2\big(\sqrt{\pi/x}\big)(1/4)^x$ is exponentially small as $x\to +\infty$ so you won't find any without bounding the parameters. $\endgroup$ Commented May 26, 2024 at 19:39
  • $\begingroup$ @losif Pinelis Maybe I expressed myself badly when I said, specifically I want to know when it is possible to get estimates like $\dfrac{1}{p-q+1} \leq 𝐵(𝑝,𝑞)$ without the restrictions of the proposition I mentioned. $\endgroup$ Commented May 26, 2024 at 21:47
  • $\begingroup$ @ClaudeChaunier This estimate that you showed demonstrates a very fast decay when $x \rightarrow \infty$, I am looking for estimates of this type $\dfrac{1}{p-q+1} \leq 𝐵(𝑝,𝑞).$, which are slower. $\endgroup$ Commented May 26, 2024 at 21:49
  • $\begingroup$ Get a moment to think over it -- no rational polynomial can be a lower bound of something decaying faster. Except 0 or useless negative values. $\endgroup$ Commented May 27, 2024 at 7:52

0

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.