Related papers: $S$-unit equation in two variables and Pad\'{e} ap…
We prove a special case of Erd\H{o}s' unit distance problem using a corollary of the subspace theorem bounding the number of solutions of linear equations from a multiplicative group. We restrict our attention to unit distances coming from…
We consider binomial Thue equations of type $x^n-my^n=\pm 1$ in $x,y\in Z$. Optimizing the method of Peth\H o we perform an extensive calculation by a high performance computer to determine all solutions with $\max(|x|,|y|)<10^{500}$ of…
In this paper, we obtain the analytical solutions of two kinds of transcendental equations with numerous applications in college physics by means of Lagrange inversion theorem, and rewrite them in the form of ratio of rational polynomials…
We shall consider a result of Fel'dman, where a sharp Baker-type lower bound is obtained for linear forms in the values of some E-functions. Fel'dman's proof is based on an explicit construction of Pad\'e approximations of the first kind…
We prove simultaneous universal Pad\'{e} approximation for several universal Pad\'{e} approximants of several types. Our results are generic in the space of holomorphic functions, in the space of formal power series as well as in a subspace…
We refine upper bounds for the classical exponents of uniform approximation for a linear form on the Veronese curve in dimension from $3$ to $9$. For dimension three, this in particular shows that a bound previously obtained by two…
We prove new upper bounds for the number of representations of an arbitrary rational number as a sum of three unit fractions. In particular, for fixed $m$ there are at most $\mathcal{O}_{\epsilon}(n^{3/5+\epsilon})$ solutions of…
The use of approximants of Pad\`e type are employed to develop a method aimed at opening new perspectives in the theory of Appell polynomials $a_n(x)$, specified by the generating function \sum_{n=0}^{\infty} \frac{t^n}{n!} a_n(x) = A(t)…
Pad\'e approximations and Siegel's lemma are widely used tools in Diophantine approximation theory. This work has evolved from the attempts to improve Baker-type linear independence measures, either by using the Bombieri-Vaaler version of…
We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.
Based on combinatorics, we evaluate the upper bounds for the number of solutions to spatially coupled Sudokus, which are popular logic puzzles.
We investigate the rational approximation of fractional powers of unbounded positive operators attainable with a specific integral representation of the operator function. We provide accurate error bounds by exploiting classical results in…
The cosmography known as the Pad\'{e} polynomials has been widely used in the reconstruction of luminosity distance, and the orders of Pad\'{e} polynomials influence the reconstructed result derived from Pad\'{e} approximation. In this…
A method is suggested for treating the well-known deficiency in the use of Pade approximants that are well suited for approximating rational functions, but confront problems in approximating irrational functions. We develop the approach of…
Let $\omega_0,\dots,\omega_M$ be complex numbers. If $H_0,\dots,H_M$ are polynomials of degree at most $\rho_0,\dots,\rho_M$, and $G(z)=\sum_{m=0} ^M H_m(z) (1-z)^{\omega_m}$ has a zero at $z=0$ of maximal order (for the given…
In this work we propose a new kind of parameterized outer estimate of the united solution set to an interval parametric linear system. The new method has several advantages compared to the methods obtaining parameterized solutions…
We obtain a tight, up to a logarithmic factor, upper bound on the number of solutions to the equation $$ \sum_{j=1}^n a_j \frac{s_j}{r_j} =a_0, \qquad $$ with variables $r_1,...,r_n$ in an arbitrary box at the origin and variables $s_1,...,…
We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…
The theory of mixed finite element methods for solving different types of elliptic partial differential equations in saddle point formulation is well established since many decades. This topic was mostly studied for variational formulations…
Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that…