相关论文: Infinite set of non linear Equations for the Li- K…
We give explicit upper bounds for the coefficients of arbitrary weight $k$, level 2 cusp forms, making Deligne's well-known $O(n^{\frac{k-1}{2}+\epsilon})$ bound precise. We also derive asymptotic formulas and explicit upper bounds for the…
Simultaneous estimation of multiple parameters is required in many practical applications. A lower bound on the variance of simultaneous estimation is given by the quantum Fisher information matrix. This lower bound is, however, not…
Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions.…
We study kernel functions, and associated reproducing kernel Hilbert spaces $\mathscr{H}$ over infinite, discrete and countable sets $V$. Numerical analysis builds discrete models (e.g., finite element) for the purpose of finding…
An optimal bound on the quantiles of a certain kind of distributions is given. Such a bound is used in applications to Berry--Esseen-type bounds for nonlinear statistics.
Elimination of unknowns in systems of equations, starting with Gaussian elimination, is a problem of general interest. The problem of finding an a priori upper bound for the number of differentiations in elimination of unknowns in a system…
This paper presents an energy estimate in terms of the total variation of the control for bilinear infinite dimensional quantum systems with unbounded potentials. These estimates allow a rigorous construction of propagators associated with…
Starting from a result of Stewart, Tijdeman and Ruzsa on iterated difference sequences, we introduce the notion of iterated compositions of linear operations. We prove a general result on the stability of such compositions (with bounded…
We prove Lieb-Robinson bounds for the dynamics of systems with an infinite dimensional Hilbert space and generated by unbounded Hamiltonians. In particular, we consider quantum harmonic and certain anharmonic lattice systems.
Assuming Lang's conjectured lower bound on the heights of non-torsion points on an elliptic curve, we show that there exists an absolute constant C such that for any elliptic curve E/Q and non-torsion point P in E(Q), there is at most one…
We examine the value distributions of coefficients in certain $q$-series related to half Appell sums in higher-level and the first moment of the Garvan's $k$-rank of partitions. We prove that these coefficients equal certain restricted…
Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…
The linearity inherent in quantum mechanics limits current quantum hardware from directly solving nonlinear systems governed by nonlinear differential equations. One can opt for linearization frameworks such as Carleman linearization, which…
The study of minimal complements in a group or a semigroup was initiated by Nathanson. The notion of minimal complements and being a minimal complement leads to the notion of co-minimal pairs which was considered in a prior work of the…
We study several aspects of the $k$-th Cheeger constant of a complex X, a parameter that quantifies the distance of $X$ from a complex $Y$ with nontrivial $k$-th cohomology over $\mathbb{Z}_2$. Our results include general methods for…
We consider nonlinear elliptic systems satisfying componentwise coercivity condition. The nonlinear terms have controlled growths with respect to the solution and its gradient, while the behaviour in the independent variable is governed by…
Let $A_{\pi}(n,1)$ be the $(n,1)$-th Fourier coefficient of the Hecke-Maass cusp form $\pi$ for $\rm SL_3(\mathbb{Z})$ and $ \omega(x)$ be a smooth compactly supported function. In this paper, we prove a nontrivial upper bound for the sum…
We deal with a problem of finding maximum of a function from the Holder class on a quantum computer. We show matching lower and upper bounds on the complexity of this problem. We prove upper bounds by constructing an algorithm that uses the…
An inequality refining the lower bound for a periodic (Breitenberger) uncertainty constant is proved for a wide class of functions. A connection of uncertainty constants for periodic and non-periodic functions is extended to this class. A…
Kazhdan constants of discrete groups are hard to compute and the actual constants are known only for several classes of groups. By solving a semidefinite programming problem by a computer, we obtain a lower bound of the Kazhdan constant of…