Related papers: Universal lower bounds for potential energy of sph…
In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with the best-known bound of…
We prove lower bounds for the Dirichlet Laplacian on possibly unbounded domains in terms of natural geometric conditions. This is used to derive uncertainty principles for low energy functions of general elliptic second order divergence…
In any dimension $n \geq 3$, we show that spherically symmetric bounded energy solutions of the defocusing energy-critical non-linear Schr\"odinger equation $i u_t + \Delta u = |u|^{\frac{4}{n-2}} u$ in $\R \times \R^n$ exist globally and…
We use linear programming techniques to find points of absolute minimum over the unit sphere $S^{d}$ in $\mathbb R^{d+1}$ of the total potential of a point configuration $\omega_N\subset S^{d}$ which is a spherical $(2m-1)$-design contained…
We establish a version of the Pommerenke-Levin-Yoccoz inequality for the modulus of a polynomial-like restriction of a global polynomial and give two applications. First it is shown that if the modulus of a polynomial-like restriction of an…
New lower bounds for the binding energy of a quantum-mechanical system of interacting particles are presented. The new bounds are expressed in terms of two-particle quantities and improve the conventional bounds of the Hall-Post type. They…
The spinless Salpeter equation may be considered either as a standard approximation to the Bethe--Salpeter formalism, designed for the description of bound states within a relativistic quantum field theory, or as the most simple, to a…
We give new proofs of asymptotic upper bounds of coding theory obtained within the frame of Delsarte's linear programming method. The proofs rely on the analysis of eigenvectors of some finite-dimensional operators related to orthogonal…
In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objective exceeds a given number, assuming only knowledge of the…
We use the Hardy spaces for Fourier integral operators to obtain bounds for spherical maximal functions in $L^{p}(\mathbb{R}^{n})$, $n\geq2$, where the radii of the spheres are restricted to a compact interval in $(0,\infty)$. These bounds…
The consideration of the N-body gravitational problem equations can give to us some class of boundary-value problems defined on the "beem's" construction. One can considere it as weak or so-called finite element method's approximation with…
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…
Linear programming bounds provide an elegant method to prove optimality and uniqueness of an (n,N,t) spherical code. However, this method does not apply to the parameters (4,10,1/6). We use semidefinite programming bounds instead to show…
Locally repairable codes which are optimal with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. The new bounds both improve and generalize previously known…
Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.
Utilizing frameworks developed by Delsarte, Yudin and Levenshtein, we deduce linear programming lower bounds (as $N\to \infty$) for the Riesz energy of $N$-point configurations on the $d$-dimensional unit sphere in the so-called…
We consider the total energy decay together with L^2-bound of the solution itself of the Cauchy problem for wave equations with a localized damping and a short-range potential. We treat it in the one dimensional Euclidean space R. We adopt…
The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…
We enumerate and classify all stationary logarithmic configurations of d+2 points on the unit (d-1)-sphere in d-dimensions. In particular, we show that the logarithmic energy attains its relative minima at configurations that consist of two…
In this note, we first try to prove a uniform lower bound of nodal volume in elliptic homogenization setting. This lower bound is far from optimal. But, we can prove a constant lower bound in dimension two. Motivated by the proof, we extend…