Related papers: Diophantine approximation on lines in $\mathbb{C}^…
We relate a previous result of ours on families of Diophantine equations having only trivial solutions with a result on the approximation of an algebraic number by products of rational numbers and units. We compare this approximation with a…
In the present paper, we have developed a method for solving \textit{diophantine inequalities} using their relationship with the \textit{difference between consecutive primes}. Using this approach we have been able to prove some theorems,…
The paper study the discrete sets of translations of the Gaussian function that span the spaces L1(R) and L2(R).
We propose a new sampling-based approach for approximate inference in filtering problems. Instead of approximating conditional distributions with a finite set of states, as done in particle filters, our approach approximates the…
In this paper we develop a general theory of metric Diophantine approximation for systems of linear forms. A new notion of `weak non-planarity' of manifolds and more generally measures on the space of $m\times n$ matrices over $\Bbb R$ is…
We investigate the Dirichlet problem of the two dimensional Lagrangian mean curvature equation in a bounded domain. Infinitely many $C^{1, \alpha} (\alpha\in (0,\frac{1}{5}))$ very weak solutions are built through Nash-Kuiper construction.…
The Gaussian moat problem asks whether it is possible to find an infinite sequence of distinct Gaussian prime numbers such that the difference between consecutive numbers in the sequence is bounded. In this paper, we have proved that the…
In this paper we obtain the Lebesgue and Hausdorff measure results for the set of vectors satisfying infinitely many fully non-linear Diophantine inequalities. The set is associated with a class of linear inhomogeneous partial differential…
We consider natural conformal invariants arising from the Gauss-Bonnet formulas on manifolds with boundary, and study conformal deformation problems associated to them. The key technique we used is to derive boundary C^2 estimates directly…
We study linear chance-constrained problems where the coefficients follow a Gaussian mixture distribution. We provide mixed-binary quadratic programs that give inner and outer approximations of the chance constraint based on piecewise…
In this paper we show that, for any fixed $1<c<\frac{5363}{3900}$, every sufficiently large positive number $N$ and a small constant $\varepsilon>0$, the diophantine inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c+p_5^c-N|<\varepsilon…
We propose an efficient computational method for finding all solutions $n\leq U$ to the Diophantine equation $a\sigma(n) = bn + c$, where integer coefficient $a,b,c$ and an upper bound $U$ are given. Our method is implemented in SageMath…
The inequalities concern the sum of s powers of primes with non-integer exponent c>1. Here s =2,3,4,or 5. The equations are similar, taking integer part before summing; here s = 3 or 5. New ranges of c are found in all cases for which many…
This article develops an approximate proximal approach for the generalized method of lines. The present results are extensions and applications of previous ones which have been published since 2011, in books and articles such as [3,4,5,6].…
We study the exponential Diophantine equation $x^2+p^mq^n=2y^p$ in positive integers $x,y,m,n$, and odd primes $p$ and $q$ using primitive divisors of Lehmer sequences in combination with elementary number theory. We discuss the solvability…
We prove that the Diophantine equation (a^2 c x^k - 1)(b^2 c y^k - 1) = (abc z^k - 1)^2 has no solutions in positive integers with x, y, z > 1, k \geq 7 and a^2x^k \neq b^2y^k.
We prove Gaussian approximation theorems for specific $k$-dimensional marginals of convex bodies which possess certain symmetries. In particular, we treat bodies which possess a 1-unconditional basis, as well as simplices. Our results…
Some new decidability results for multiplicative matrix equations over algebraic number fields are established. In particular, special instances of the so-called knapsack problem are considered. The proofs are based on effective methods for…
These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…
In this chapter we introduce the theory of Diophantine approximation via a series of basic examples from information theory relevant to wireless communications. In particular, we discuss Dirichlet's theorem, badly approximable points,…