相关论文: Sharp Bounds for the Harmonic Numbers

We introduce higher-order Poincar'e constants for compact weighted manifolds and estimate them from above in terms of subsets. These estimates imply upper bounds for eigenvalues of the weighted Laplacian and the first nontrivial eigenvalue…

New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.

We introduce a linear programming framework for obtaining upper bounds for the potential energy of spherical codes of fixed cardinality and minimum distance. Using Hermite interpolation we construct polynomials to derive corresponding…

We study the lowest energy E of a relativistic system of N identical bosons bound by harmonic-oscillator pair potentials in three spatial dimensions. In natural units the system has the semirelativistic ``spinless-Salpeter'' Hamiltonian H =…

We show how positive unital linear maps can be used to obtain lower bounds for the maximum distance between the eigenvalues of two normal matrices. Some related bounds for the spread and condition number of Hermitian matrices are also…

We propose a consistent estimator of sharp bounds on the variance of the difference-in-means estimator in completely randomized experiments. Generalizing Robins [Stat. Med. 7 (1988) 773-785], our results resolve a well-known identification…

We study lower bounds for the self-intersection of the canonical divisor of "canonical varieties" (i.e. varieties whose canonical linear system gives a birational map). We give some improvements for the known results in the case of surfaces…

We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…

This paper is devoted to the study of lower and upper bounds for the number of vertices of the polytope of $n\times n\times n$ stochastic tensors (i.e., triply stochastic arrays of dimension $n$). By using known results on polytopes (i.e.,…

We obtain universal bounds on the energy of codes and for designs in Hamming spaces. Our bounds hold for a large class of potential functions, allow unified treatment, and can be viewed as a generalization of the Levenshtein bounds for…

We study in this paper the function approximation error of linear interpolation and extrapolation. Several upper bounds are presented along with the conditions under which they are sharp. All results are under the assumptions that the…

Ramanujan graphs have extremal spectral properties, which imply a remarkable combinatorial behavior. In this paper we compute the high dimensional Hodge-Laplace spectrum of Ramanujan triangle complexes, and show that it implies a…

We show various sharp Hardy-type inequalities for the linear and quasi-linear Laplacian on non-compact harmonic manifolds with a particular focus on the case of Damek-Ricci spaces. Our methods make use of the optimality theory developed by…

In this paper, we study estimates for eigenvalues of the clamped plate problem. A sharp upper bound for eigenvalues is given and the lower bound for eigenvalues in [10] is improved.

In this paper, we present a sharp upper and lower bounds for the signless Laplacian spectral radius of graphs in terms of clique number. Moreover, the extremal graphs which attain the upper and lower bounds are characterized. In addition,…

We provide numerical evidence towards three conjectures on harmonic numbers by Eswarathasan--Levine and Boyd. Let $J_p$ denote the set of integers $n\geq 1$ such that the harmonic number $H_n$ is divisible by a prime $p$. The conjectures…

This paper is devoted to measures of symmetry based on distance between centroid and one of the centers of John and Lowner ellipsoid. The author proves the accuracy of the derived upper bounds for the considered measures of symmetry.

We give an optimal upper bound for the maximum-norm distance from a vertex of a knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the upper bound can be significantly improved on average. As a…

Let $P$ be a polynomial with integer coefficients and degree at least two. We prove an upper bound on the number of integer solutions $n\leq N$ to $n! = P(x)$ which yields a power saving over the trivial bound. In particular, this applies…

We develop deterministic perturbation bounds for singular values and vectors of orthogonally decomposable tensors, in a spirit similar to classical results for matrices such as those due to Weyl, Davis, Kahan and Wedin. Our bounds…