Related papers: An Efficient Version of the Bombieri-Vaaler Lemma
Author developed a method in the paper, which, unlike the circle method of Hardy and Littlewood (CM), allows you to perform a lower estimate for the number of natural (integer) solutions of algebraic Diophantine equation with integer…
One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…
We give upper and lower bounds for Diophantine exponents measuring how well a point in the plane can be approximated by points in the orbit of a lattice $\Gamma<\mathrm{SL}_2(\mathbb{R})$ acting linearly on $\mathbb{R}^2$. Our method gives…
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…
A numerical procedure providing guaranteed two-sided bounds on the effective coefficients of elliptic partial differential operators is presented. The upper bounds are obtained in a standard manner through the variational formulation of the…
We construct a class of multiple Legendre polynomials and prove that they satisfy an Ap\'ery-like recurrence. We give new upper bounds of the approximation measures of logarithms of rational numbers by algebraic numbers of bounded degree.…
We study the Frobenius problem: given relatively prime positive integers a_1,...,a_d, find the largest value of t (the Frobenius number g(a_1,...,a_d)) such that m_1 a_1 + ... m_d a_d = t has no solution in nonnegative integers m_1,...,m_d.…
Building on work of Davenport and Schmidt, we mainly prove two results. The first one is a version of Gel'fond's transcendence criterion which provides a sufficient condition for a complex or $p$-adic number $\xi$ to be algebraic in terms…
The solving degree of a system of multivariate polynomial equations provides an upper bound for the complexity of computing the solutions of the system via Groebner bases methods. In this paper, we consider polynomial systems that are…
In this paper, we study linear forms \[\lambda = \beta_1\mathrm{e}^{\alpha_1}+\cdots+\beta_m\mathrm{e}^{\alpha_m},\] where $\alpha_i$ and $\beta_i$ are algebraic numbers. An explicit lower bound for the absolute value of $\lambda$ is…
We consider the problem of computing upper and lower bounds on the price of a European basket call option, given prices on other similar baskets. Although this problem is very hard to solve exactly in the general case, we show that in some…
In this paper, we obtain a sharp upper bound for the sum of the first $k$-th eigenvalues for this Dirichlet problem of poly-Laplacian with any order, which is viewed as an extension of the result due to Cheng and Wei (Journal of…
Recent theorems of Dubickas and Mossinghoff use auxiliary polynomials to give lower bounds on the Weil height of an algebraic number $\alpha$ under certain assumptions on $\alpha$. We prove a theorem which introduces an auxiliary polynomial…
We find upper and lower bounds on the number of rational points that are $\psi$-approximations of some $n$-dimensional $p$-adic integer. Lattice point counting techniques are used to find the upper bound result, and a Pigeon-hole principle…
Several recent papers construct auxiliary polynomials to bound the Weil height of certain classes of algebraic numbers from below. Following these techniques, the author gave a general method for introducing auxiliary polynomials to…
We determine two explicit upper bounds for the stable Faltings height of principally polarised abelian surfaces over number fields corresponding to S-integral points on the Siegel modular variety A_2(2). One upper bound, using Runge's…
In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…
We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showed that an IP can be solved in strongly polynomial time if…
Using the Thue-Siegel method, we obtain effective improvements on Liouville's irrationality measure for certain one-parameter families of algebraic numbers, defined by equations of the type $(t-a)Q(t)+P(t)=0$. We apply these to some…
The Bounded Height Conjecture of Bombieri, Masser, and Zannier states that for any sufficiently generic algebraic subvariety of a semiabelian $\overline{\mathbb{Q}}$-variety $G$ there is an upper bound on the Weil height of the points…