Related papers: $S$-unit equation in two variables and Pad\'{e} ap…
In this paper we consider a simple linear recurrence sequence $ G_n $ defined over a function field in one variable over the field of complex numbers. We prove an upper bound on the indices $ n $ and $ m $ such that $ G_n + G_m $ is an $ S…
The emphasis of this paper is to investigate the high-order approximation of a class of SPDEs with cubic nonlinearity driven by multiplicative noise with the help of the amplitude equations. The highlight of our work is that we improve the…
Based on the mathematically well defined Pad\'e Theory, a theoretically safe new procedure for the extraction of the pole mass and width of a resonance is proposed. In particular, thanks to the Montessus de Ballore theorem we are able to…
A representation of the Pad\'e approximation of the $Z$-transform of a signal as a resolvent of a tridiagonal matrix $J$ is given. Several formulas for the poles, zeros and residues of the Pad\'e approximation in terms of the matrix $J$ are…
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…
In this paper, we obtain uniform bounds for a number of expressions that involve derivatives and integrals of modified Bessel functions. These uniform bounds are motivated by the need to bound such expressions in the study of variance-gamma…
We study solutions of uniformly elliptic PDE with Lipschitz leading coefficients and bounded lower order coefficients. We extend previous results of A. Logunov concerning nodal sets of harmonic functions and, in particular, prove polynomial…
In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints,…
The Bethe-Salpeter Equation for a two-scalar, S-wave bound system, interacting through a massive scalar, is investigated within the ladder approximation. By assuming a Nakanishi integral representation of the Bethe-Salpeter amplitude, one…
The advantages and difficulties of application of Pad\'e approximants to two-dimensional regression analysis are discussed. New formulation of residuals is suggested in the method of least squares. It leads to a system of linear equations…
There are several kinds of universal Taylor series. In one such kind the universal approximation is required at every boundary point of the domain of definition $\OO$ of the universal function $f$. In another kind the universal…
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…
We consider upper bounds for the approximation error E|g(X)-g(\hat X)|^p, where X and \hat X are random variables such that \hat X is an approximation of X in the L_p-norm, and the function g belongs to certain function classes, which…
Using the auxiliary field method, a generic upper bound is obtained for the spinless Salpeter equation with two different masses. Analytical results are presented for the cases of the Coulomb and linear potentials when a mass is vanishing.
We prove new upper bounds on the number of representations of rational numbers $\frac{m}{n}$ as a sum of $4$ unit fractions, giving five different regions, depending on the size of $m$ in terms of $n$. In particular, we improve the most…
For a fixed unit vector a=(a_1,a_2,...,a_n) in S^{n-1}, i.e. sum_{i=1}^n a_i^2=1, we consider the 2^n sign vectors epsilon=(epsilon_1,epsilon_2,...,epsilon_n) in {-1,1}^n and the corresponding scalar products a.epsilon=sum_{i=1}^n a_i…
We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…
We obtain a small improvement of Gallagher's larger sieve and we extend it to higher dimensions. We also obtain two interesting upper bounds for the number of solutions to polynomial congruences.
We study one-parameter families of S-unit equations of the form f(t)u+g(t)v=h(t), where f, g, and h are univariate polynomials over a number field, t is an S-integer, and u and v are S-units. For many possible choices of f, g, and h, we are…
Uniform bounds are obtained using the auxiliary Monge-Amp\`ere equation method for solutions of very general classes of fully non-linear partial differential equations, assuming the existence of a ${C}$-subsolution in the sense of G.…