Related papers: An Efficient Version of the Bombieri-Vaaler Lemma

We present a new form and a short full proof of explicit two-sided estimates for the distribution function F_{n,p}(x) of the binomial law from the paper published by D.Alfers and H.Dinges in 1984. These inequalities are universal (valid for…

We define transgressions of arbitrary order, with respect to families of unit-vector fields indexed by a polytope, for the Pfaffian of metric connections for semi-Riemannian metrics on vector bundles. We apply this formula to compute the…

Consider the equation $q_1\alpha^{x_1}+\dots+q_k\alpha^{x_k} = q$, with constants $\alpha \in \overline{\mathbb{Q}} \setminus \{0,1\}$, $q_1,\ldots,q_k,q\in\overline{\mathbb{Q}}$ and unknowns $x_1,\ldots,x_k$, referred to in this paper as…

In the present article, we study Bell based Euler polynomial of order {\alpha} and investigate some useful correlation formula, summation formula and derivative formula. Also, we introduce some relation of string number of the second kind.…

In this paper, it is shown that if F(x , y) is an irreducible binary form with integral coefficients and degree $n \geq 3$, then provided that the absolute value of the discriminant of F is large enough, the equation |F(x , y)| = 1 has at…

Let $\alpha$ be an algebraic number of degree $d\ge 3$ and let $K$ be the algebraic number field $\Q(\alpha)$. When $\varepsilon$ is a unit of $K$ such that $\Q(\alpha\varepsilon)=K$, we consider the irreducible polynomial $f_\varepsilon(X)…

We prove that the height of any algebraic computation tree for deciding membership in a semialgebraic set is bounded from below (up to a multiplicative constant) by the logarithm of m-th Betti number (with respect to singular homology) of…

We establish a lower bound of $\Omega{(\sqrt{n})}$ on the bounded-error quantum query complexity of read-once Boolean functions, providing evidence for the conjecture that $\Omega(\sqrt{D(f)})$ is a lower bound for all Boolean functions.…

We prove a higher-rank analogue of a well-known result of W. M. Schmidt concerning almost everywhere pointwise discrepancy bounds for lattices in Euclidean space (see Theorem 1 [Trans. Amer. Math. Soc. 95 (1960), 516-529]). We also…

We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit? We argue that this question is certainly difficult.…

We propose a boundary value correction approach for cases when curved boundaries are approximated by straight lines (planes) and Lagrange multipliers are used to enforce Dirichlet boundary conditions. The approach allows for optimal order…

Let $f(x)$ be a polynomial of degree $n \ge 1$ with real coefficients and let $X \ge 2$ and $\delta \ge 0$ be real numbers. Let $\|\cdot\|$ be the distance to the nearest integer. We obtain upper bounds for the number of solutions to the…

In his 1981 Fundamental Theorem of Algebra paper Steve Smale initiated the complexity theory of finding a solution of polynomial equations of one complex variable by a variant of Newton's method. In this paper we reconsider his algorithm in…

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…

In this paper, we obtain under the assumption of the Generalized Riemann Hypothesis upper bounds for all high integral moments of sums of Fourier coefficients of a given modular form twisted by quadratic Dirichlet characters. We show the…

The paper proposes artificial intelligence technique called hill climbing to find numerical solutions of Diophantine Equations. Such equations are important as they have many applications in fields like public key cryptography, integer…

We give an upper bound for the exponential sum over squarefree integers. This establishes a conjecture by Br\"udern and Perelli.

In this paper, we prove effective upper bounds for effective sections of line bundles on projective varieties and hermitian line bundles on arithmetic varieties in terms of the volumes. They are effective versions of the Hilbert--Samuel…

We develop machinery to explicitly determine, in many instances, when the difference $x^2-y^n$ is divisible only by powers of a given fixed prime. This combines a wide variety of techniques from Diophantine approximation (bounds for linear…