arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1712.03263math.FA
收藏

最优多线性Bohnenblust-Hille常数:实际情况的计算解

The optimal multilinear Bohnenblust-Hille constants: a computational solution for the real case

F. V. Costa Júnior

摘要:

$m$ -线性型的Bohnenblust-Hille不等式在1931年被证明为著名的4/3-Littlewood不等式的推广。最佳常数(或至少是它们随着$m$增长的渐近行为)是未知的,但对应用程序很重要。最近的一个结果,得到的Cavalcante,Teixeira和Pellegrino,提供了一种算法,由许多基本步骤组成,作为最终结果的最佳截断Bohnenblust-Hille常数的任何顺序。但是Cavalcante \textit{et al.}的过程具有相当大的计算量,并且不能避免计算机辅助。在本文中,我们提出了一个计算解决方案的问题,使用Wolfram语言。我们还使用这种方法来调查的Pellegrino和Teixeira提出的猜想,断言$C_m=2^{1-1/m}$的所有$m\in\mathbb{N}$和揭示有趣的未知事实的几何$B_{\mathcal{L}(^3\mathbb{R}^3)}$。

英文摘要:

The Bohnenblust-Hille inequality for $m$-linear forms was proven in 1931 as a generalization of the famous 4/3-Littlewood inequality. The optimal constants (or at least their asymptotic behavior as $m$ grows) is unknown, but significant for applications. A recent result, obtained by Cavalcante, Teixeira and Pellegrino, provides a kind of algorithm, composed by finitely many elementary steps, giving as the final outcome the optimal truncated Bohnenblust-Hille constants of any order. But the procedure of Cavalcante \textit{et al.} has a fairly large number of calculations and computer assistance cannot be avoided. In this paper we present a computational solution to the problem, using the Wolfram Language. We also use this approach to investigate a conjecture raised by Pellegrino and Teixeira, asserting that $C_m=2^{1-1/m}$ for all $m\in\mathbb{N}$ and to reveal interesting unknown facts about the geometry of $B_{\mathcal{L}(^3\mathbb{R}^3)}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑