中文
相关论文

相关论文: Sharp Bounds for the Harmonic Numbers

200 篇论文

We develop new elements of harmonic analysis on the complex sphere on the basis of which Bernstein's, Jackson's and Kolmogorov's inequalities are established. We apply these results to get order sharp estimates of $m$-term approximations.…

经典分析与常微分方程 · 数学 2015-04-25 Huda Alsaud , Alexander Kushpel , Jeremy Levesley

M. Aouchiche and P. Hansen proposed the distance Laplacian and the distance signless Laplacian of a connected graph [Two Laplacians for the distance matrix of a graph, LAA 439 (2013) 21{33]. In this paper, we obtain three theorems on the…

组合数学 · 数学 2013-08-16 Wenxi Hong , Lihua You

We derive lower bounds for the $L^p(\mu)$ norms of monic extremal polynomials with respect to compactly supported probability measures $\mu$. We obtain a sharp universal lower bound for all $0<p<\infty$ and all measures in the Szeg\H{o}…

经典分析与常微分方程 · 数学 2019-07-30 Gökalp Alpan , Maxim Zinchenko

We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on…

量子物理 · 物理学 2007-05-23 Stefan Heinrich

A lower bound on the chromatic number of a graph is derived by majorization of spectra of weighted adjacency matrices. These matrices are given by Hadamard products of the adjacency matrix and arbitrary Hermitian matrices.

离散数学 · 计算机科学 2007-05-23 Pawel Wocjan , Dominik Janzing , Thomas Beth

For any $n \geq 3$ and any closed manifold $\mathcal{N}$ with $\pi_{n+k}(\mathcal{N}) \neq \{0\}$ for some $k \geq 0$, we establish the existence of nontrivial $n$-harmonic maps from $\mathbb{S}^n$ into $\mathcal{N}$. When $k\geq 1$, these…

偏微分方程分析 · 数学 2026-01-12 Dorian Martino , Katarzyna Mazowiecka , Armin Schikorra

We establish a majorization-based theory for bounding observables of waves with varied coherence. For any measurement, exact bounds are attained by the maximal and minimal elements in the set of input coherence spectra. The set's supremum…

光学 · 物理学 2026-01-16 Shiyu Li , Cheng Guo

In this paper we give a criterion to prove boundedness results for several operators from $H^1((0,\infty),\gamma_\alpha)$ to $L^1((0,\infty),\gamma_\alpha)$ and also from $L^\infty((0,\infty),\gamma_\alpha)$ to…

经典分析与常微分方程 · 数学 2022-10-27 Jorge J. Betancor , Estefanía Dalmasso , Pablo Quijano , Roberto Scotto

We obtain sharp lower bounds for the first eigenvalue of four types of eigenvalue problem defined by the bi-Laplace operator on compact manifolds with boundary and determine all the eigenvalues and the corresponding eigenfunctions of a…

偏微分方程分析 · 数学 2020-01-22 Qiaoling Wang , Changyu Xia

We give improved bounds for the distortion of the Hausdorff dimension under quasisymmetric maps in terms of the dilatation of their quasiconformal extension. The sharpness of the estimates remains an open question and is shown to be closely…

复变函数 · 数学 2011-10-25 István Prause , Stanislav Smirnov

A recent breakthrough of Conlon and Ferber yielded an exponential improvement on the lower bounds for multicolor diagonal Ramsey numbers. In this note, we modify their construction and obtain improved bounds for more than three colors.

组合数学 · 数学 2020-12-11 Yuval Wigderson

In this note we establish a Ramsey-type result for certain subsets of the $n$-dimensional cube. This can then be applied to obtain reasonable bounds on various related structures, such as (partial) Hales-Jewett lines for alphabets of sized…

组合数学 · 数学 2008-07-11 Ron Graham , Jozsef Solymosi

We investigate approximation to a given real number by algebraic numbers and algebraic integers of prescribed degree. We deal with both best and uniform approximation, and highlight the similarities and differences compared with the…

数论 · 数学 2018-12-31 Johannes Schleischitz

A class of linear block codes which simultaneously generalizes Gabidulin codes and a class of skew cyclic codes is defined. For these codes, both a Hartmann-Tzeng-like bound and a Roos-like bound, with respect to their rank distance, are…

信息论 · 计算机科学 2025-03-18 José Manuel Muñoz

We establish almost tight upper and lower approximation bounds for the Vertex Cover problem on dense k-partite hypergraphs.

数据结构与算法 · 计算机科学 2011-07-12 Marek Karpinski , Richard Schmied , Claus Viehmann

In this note we consider high energy eigenfunctions of the harmonic oscillator in $\mathbb{R}^d$ and prove that any invariant measure on the energy surface can be written as a weak limit of eigenfunctions.

偏微分方程分析 · 数学 2020-01-28 Elie Studnia

There are several numerical methods for computing approximate zeros of a given univariate polynomial. In this paper, we develop a simple and novel method for determining sharp upper bounds on errors in approximate zeros of a given…

We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.

chao-dyn · 物理学 2009-10-22 N. J. Balmforth , E. A. Spiegel , C. Tresser

We prove asymptotically optimal upper bounds for the eigenvalues of the Wentzel-Laplace operator on Riemannian manifolds with Ricci curvature bounded below. These bounds depend highly on the geometry of the boundary in addition to the…

度量几何 · 数学 2020-06-23 Aïssatou M. Ndiaye

An estimate of the order of approximation in the central limit theorem for strictly stationary associated random variables with finite moments of order q > 2 is obtained. A moderate deviation result is also obtained. We have a refinement of…

概率论 · 数学 2017-09-19 M. Sreehari
‹ 上一页 1 8 9 10 下一页 ›